re PR fortran/52473 (CSHIFT slow - inline it?)
2017-06-24 Thomas Koenig <tkoenig@gcc.gnu.org>
PR fortran/52473
* Makefile.am: Add i_cshift1a_c. Add rules to generate files
from cshift1a.m4.
* Makefile.in: Regenerated.
* m4/cshift1a.m4: New file.
* m4/cshift.m4 (cshift1): Split up inner loop by removing
condition. Use memcpy where possible. Call helper functions
based on dtype.
* libgfortran.h: Add prototypes for cshift1_16_c10,
cshift1_16_c16, cshift1_16_c4, cshift1_16_c8, cshift1_16_i1,
cshift1_16_i16, cshift1_16_i2, cshift1_16_i4, cshift1_16_i8,
cshift1_16_r10, cshift1_16_r16, cshift1_16_r4, cshift1_16_r8,
cshift1_4_c10, cshift1_4_c16, cshift1_4_c4, cshift1_4_c8,
cshift1_4_i1, cshift1_4_i16, cshift1_4_i2, cshift1_4_i4,
cshift1_4_i8, cshift1_4_r10, cshift1_4_r16, cshift1_4_r4,
cshift1_4_r8, cshift1_8_c10, cshift1_8_c16, cshift1_8_c4,
cshift1_8_c8, cshift1_8_i1, cshift1_8_i16, cshift1_8_i2,
cshift1_8_i4, cshift1_8_i8, cshift1_8_r10, cshift1_8_r16,
cshift1_8_r4 and cshift1_8_r8.
* generated/cshift1_16_c10.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_c16.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_c4.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_c8.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_i1.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_i16.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_i2.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_i4.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_i8.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_r10.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_r16.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_r4.c: New file, generated from cshift1a.m4.
* generated/cshift1_16_r8.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_c10.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_c16.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_c4.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_c8.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_i1.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_i16.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_i2.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_i4.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_i8.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_r10.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_r16.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_r4.c: New file, generated from cshift1a.m4.
* generated/cshift1_4_r8.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_c10.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_c16.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_c4.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_c8.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_i1.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_i16.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_i2.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_i4.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_i8.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_r10.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_r16.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_r4.c: New file, generated from cshift1a.m4.
* generated/cshift1_8_r8.c: New file, generated from cshift1a.m4.
2017-06-24 Thomas Koenig <tkoenig@gcc.gnu.org>
PR fortran/52473
* gfortran.dg/cshift_2.f90: New test.
From-SVN: r249620
This commit is contained in:
Thomas Koenig
parent
ef5b7d19b6
commit
e56e3fda60
|
|
@ -1,3 +1,8 @@
|
|||
2017-06-24 Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
PR fortran/52473
|
||||
* gfortran.dg/cshift_2.f90: New test.
|
||||
|
||||
2017-06-23 Jim Wilson <jim.wilson@linaro.org>
|
||||
|
||||
PR middle-end/79794
|
||||
|
|
|
|||
|
|
@ -0,0 +1,152 @@
|
|||
! { dg-do run }
|
||||
! Test CSHIFT with array argument for shift
|
||||
module rnd
|
||||
implicit none
|
||||
contains
|
||||
subroutine fill(a,n)
|
||||
integer, intent(out), dimension(:,:) :: a
|
||||
integer, intent(in) :: n
|
||||
real, dimension(size(a,1),size(a,2)) :: r
|
||||
call random_number(r)
|
||||
a = int(2*n*r-n)
|
||||
end subroutine fill
|
||||
end module rnd
|
||||
|
||||
module csh
|
||||
implicit none
|
||||
contains
|
||||
subroutine emul_cshift(a,sh_in,dim, c)
|
||||
integer, dimension(:,:,:), intent(in) :: a
|
||||
integer, dimension(:,:,:), intent(out) :: c
|
||||
integer, dimension(:,:), intent(in) :: sh_in
|
||||
integer, intent(in) :: dim
|
||||
integer :: sh, rsh
|
||||
integer :: s1, s2, s3, n, i
|
||||
integer :: n1, n2, n3
|
||||
n1 = size(a,1)
|
||||
n2 = size(a,2)
|
||||
n3 = size(a,3)
|
||||
if (dim == 1) then
|
||||
n = n1
|
||||
do s2=1,n2
|
||||
do s3=1,n3
|
||||
sh = modulo(sh_in(s2,s3), n)
|
||||
rsh = n - sh
|
||||
do i=1,rsh
|
||||
c(i,s2,s3) = a(i+sh,s2,s3)
|
||||
end do
|
||||
do i=rsh+1,n
|
||||
c(i,s2,s3) = a(i-rsh,s2,s3)
|
||||
end do
|
||||
end do
|
||||
end do
|
||||
else if (dim == 2) then
|
||||
n = n2
|
||||
do s3=1,n3
|
||||
do s1=1,n1
|
||||
sh = modulo(sh_in(s1,s3),n)
|
||||
rsh = n - sh
|
||||
do i=1,rsh
|
||||
c(s1,i,s3) = a(s1,i+sh,s3)
|
||||
end do
|
||||
do i=rsh+1,n
|
||||
c(s1,i,s3) = a(s1,i-rsh,s3)
|
||||
end do
|
||||
end do
|
||||
end do
|
||||
|
||||
else if (dim == 3) then
|
||||
n = n3
|
||||
do s2=1,n2
|
||||
do s1=1,n1
|
||||
sh = modulo(sh_in(s1,s2),n)
|
||||
rsh = n - sh
|
||||
do i=1,rsh
|
||||
c(s1,s2,i) = a(s1,s2,i+sh)
|
||||
end do
|
||||
do i=rsh+1,n
|
||||
c(s1,s2,i) = a(s1,s2,i-rsh)
|
||||
end do
|
||||
end do
|
||||
end do
|
||||
else
|
||||
stop "Illegal dim"
|
||||
end if
|
||||
end subroutine emul_cshift
|
||||
end module csh
|
||||
program main
|
||||
use csh
|
||||
use rnd
|
||||
implicit none
|
||||
integer, parameter :: n1=30,n2=40,n3=50
|
||||
integer, dimension(n1,n2,n3) :: a, b,c
|
||||
integer :: s1, s2, s3
|
||||
integer :: dim
|
||||
integer, dimension(:,:), allocatable :: sh1, sh2, sh3
|
||||
integer, dimension(:), allocatable :: sh_shift
|
||||
integer :: sh, rsh
|
||||
integer :: i,j,k,v
|
||||
type t
|
||||
integer :: i1, i2, i3
|
||||
end type t
|
||||
type(t), dimension(n1,n2,n3) :: ta, tb
|
||||
|
||||
v = 1
|
||||
do k=1,n3
|
||||
do j=1,n2
|
||||
do i=1,n1
|
||||
a(i,j,k) = v
|
||||
v = v + 1
|
||||
end do
|
||||
end do
|
||||
end do
|
||||
|
||||
ta%i1 = a
|
||||
ta%i2 = a+a
|
||||
ta%i3 = a+a+a
|
||||
allocate(sh1(n2,n3))
|
||||
allocate(sh2(n1,n3))
|
||||
allocate(sh3(n1,n2))
|
||||
|
||||
call fill(sh1,10)
|
||||
call fill(sh2,10)
|
||||
call fill(sh3,10)
|
||||
|
||||
b = cshift(a,sh1,1)
|
||||
call emul_cshift(a,sh1,1,c)
|
||||
if (any(b /= c)) then
|
||||
print *,b
|
||||
print *,c
|
||||
call abort
|
||||
end if
|
||||
tb = cshift(ta,sh1,1)
|
||||
if (any(tb%i1 /= c)) call abort
|
||||
|
||||
b = cshift(a,sh2,2)
|
||||
call emul_cshift(a,sh2,2,c)
|
||||
if (any(b /= c)) call abort
|
||||
tb = cshift(ta,sh2,2)
|
||||
if (any (tb%i2 /= c*2)) call abort
|
||||
|
||||
b = cshift(a,sh3,3)
|
||||
call emul_cshift(a,sh3,3,c)
|
||||
if (any(b /= c)) call abort
|
||||
tb = cshift(ta,sh3,3)
|
||||
if (any(tb%i3 /= c*3)) call abort
|
||||
|
||||
b = -42
|
||||
c = -42
|
||||
b(1:n1:2,:,:) = cshift(a(1:n1/2,:,:),sh1,1)
|
||||
call emul_cshift(a(1:n1/2,:,:), sh1, 1, c(1:n1:2,:,:))
|
||||
if (any(b /= c)) call abort
|
||||
|
||||
tb%i1 = -42
|
||||
tb%i2 = -2*42
|
||||
tb%i3 = -3*42
|
||||
tb(1:n1:2,:,:) = cshift(ta(1:n1/2,:,:),sh1,1)
|
||||
if (any(tb%i1 /= b)) call abort
|
||||
if (any(tb%i2 /= 2*b)) call abort
|
||||
if (any(tb%i3 /= 3*b)) call abort
|
||||
|
||||
9000 format (99(3(I3,1X),2X))
|
||||
end program main
|
||||
|
|
@ -1,3 +1,64 @@
|
|||
2017-06-24 Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
PR fortran/52473
|
||||
* Makefile.am: Add i_cshift1a_c. Add rules to generate files
|
||||
from cshift1a.m4.
|
||||
* Makefile.in: Regenerated.
|
||||
* m4/cshift1a.m4: New file.
|
||||
* m4/cshift.m4 (cshift1): Split up inner loop by removing
|
||||
condition. Use memcpy where possible. Call helper functions
|
||||
based on dtype.
|
||||
* libgfortran.h: Add prototypes for cshift1_16_c10,
|
||||
cshift1_16_c16, cshift1_16_c4, cshift1_16_c8, cshift1_16_i1,
|
||||
cshift1_16_i16, cshift1_16_i2, cshift1_16_i4, cshift1_16_i8,
|
||||
cshift1_16_r10, cshift1_16_r16, cshift1_16_r4, cshift1_16_r8,
|
||||
cshift1_4_c10, cshift1_4_c16, cshift1_4_c4, cshift1_4_c8,
|
||||
cshift1_4_i1, cshift1_4_i16, cshift1_4_i2, cshift1_4_i4,
|
||||
cshift1_4_i8, cshift1_4_r10, cshift1_4_r16, cshift1_4_r4,
|
||||
cshift1_4_r8, cshift1_8_c10, cshift1_8_c16, cshift1_8_c4,
|
||||
cshift1_8_c8, cshift1_8_i1, cshift1_8_i16, cshift1_8_i2,
|
||||
cshift1_8_i4, cshift1_8_i8, cshift1_8_r10, cshift1_8_r16,
|
||||
cshift1_8_r4 and cshift1_8_r8.
|
||||
* generated/cshift1_16_c10.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_c16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_c4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_c8.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_i1.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_i16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_i2.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_i4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_i8.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_r10.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_r16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_r4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_16_r8.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_c10.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_c16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_c4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_c8.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_i1.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_i16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_i2.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_i4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_i8.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_r10.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_r16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_r4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_4_r8.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_c10.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_c16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_c4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_c8.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_i1.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_i16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_i2.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_i4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_i8.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_r10.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_r16.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_r4.c: New file, generated from cshift1a.m4.
|
||||
* generated/cshift1_8_r8.c: New file, generated from cshift1a.m4.
|
||||
|
||||
2017-06-18 Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
PR fortran/52473
|
||||
|
|
|
|||
|
|
@ -524,13 +524,53 @@ $(srcdir)/generated/cshift0_c4.c \
|
|||
$(srcdir)/generated/cshift0_c8.c \
|
||||
$(srcdir)/generated/cshift0_c10.c \
|
||||
$(srcdir)/generated/cshift0_c16.c
|
||||
|
||||
|
||||
i_cshift1_c= \
|
||||
$(srcdir)/generated/cshift1_4.c \
|
||||
$(srcdir)/generated/cshift1_8.c \
|
||||
$(srcdir)/generated/cshift1_16.c
|
||||
|
||||
i_cshift1a_c = \
|
||||
$(srcdir)/generated/cshift1_4_i1.c \
|
||||
$(srcdir)/generated/cshift1_4_i2.c \
|
||||
$(srcdir)/generated/cshift1_4_i4.c \
|
||||
$(srcdir)/generated/cshift1_4_i8.c \
|
||||
$(srcdir)/generated/cshift1_4_i16.c \
|
||||
$(srcdir)/generated/cshift1_4_r4.c \
|
||||
$(srcdir)/generated/cshift1_4_r8.c \
|
||||
$(srcdir)/generated/cshift1_4_r10.c \
|
||||
$(srcdir)/generated/cshift1_4_r16.c \
|
||||
$(srcdir)/generated/cshift1_4_c4.c \
|
||||
$(srcdir)/generated/cshift1_4_c8.c \
|
||||
$(srcdir)/generated/cshift1_4_c10.c \
|
||||
$(srcdir)/generated/cshift1_4_c16.c \
|
||||
$(srcdir)/generated/cshift1_8_i1.c \
|
||||
$(srcdir)/generated/cshift1_8_i2.c \
|
||||
$(srcdir)/generated/cshift1_8_i4.c \
|
||||
$(srcdir)/generated/cshift1_8_i8.c \
|
||||
$(srcdir)/generated/cshift1_8_i16.c \
|
||||
$(srcdir)/generated/cshift1_8_r4.c \
|
||||
$(srcdir)/generated/cshift1_8_r8.c \
|
||||
$(srcdir)/generated/cshift1_8_r10.c \
|
||||
$(srcdir)/generated/cshift1_8_r16.c \
|
||||
$(srcdir)/generated/cshift1_8_c4.c \
|
||||
$(srcdir)/generated/cshift1_8_c8.c \
|
||||
$(srcdir)/generated/cshift1_8_c10.c \
|
||||
$(srcdir)/generated/cshift1_8_c16.c \
|
||||
$(srcdir)/generated/cshift1_16_i1.c \
|
||||
$(srcdir)/generated/cshift1_16_i2.c \
|
||||
$(srcdir)/generated/cshift1_16_i4.c \
|
||||
$(srcdir)/generated/cshift1_16_i8.c \
|
||||
$(srcdir)/generated/cshift1_16_i16.c \
|
||||
$(srcdir)/generated/cshift1_16_r4.c \
|
||||
$(srcdir)/generated/cshift1_16_r8.c \
|
||||
$(srcdir)/generated/cshift1_16_r10.c \
|
||||
$(srcdir)/generated/cshift1_16_r16.c \
|
||||
$(srcdir)/generated/cshift1_16_c4.c \
|
||||
$(srcdir)/generated/cshift1_16_c8.c \
|
||||
$(srcdir)/generated/cshift1_16_c10.c \
|
||||
$(srcdir)/generated/cshift1_16_c16.c
|
||||
|
||||
in_pack_c = \
|
||||
$(srcdir)/generated/in_pack_i1.c \
|
||||
$(srcdir)/generated/in_pack_i2.c \
|
||||
|
|
@ -658,7 +698,8 @@ gfor_built_src= $(i_all_c) $(i_any_c) $(i_count_c) $(i_maxloc0_c) \
|
|||
$(i_eoshift3_c) $(i_cshift1_c) $(i_reshape_c) $(in_pack_c) $(in_unpack_c) \
|
||||
$(i_pow_c) $(i_pack_c) $(i_unpack_c) $(i_matmulavx128_c) \
|
||||
$(i_spread_c) selected_int_kind.inc selected_real_kind.inc kinds.h \
|
||||
$(i_cshift0_c) kinds.inc c99_protos.inc fpu-target.h fpu-target.inc
|
||||
$(i_cshift0_c) kinds.inc c99_protos.inc fpu-target.h fpu-target.inc \
|
||||
$(i_cshift1a_c)
|
||||
|
||||
# Machine generated specifics
|
||||
gfor_built_specific_src= \
|
||||
|
|
@ -986,6 +1027,9 @@ $(i_cshift0_c): m4/cshift0.m4 $(I_M4_DEPS)
|
|||
$(i_cshift1_c): m4/cshift1.m4 $(I_M4_DEPS)
|
||||
$(M4) -Dfile=$@ -I$(srcdir)/m4 cshift1.m4 > $@
|
||||
|
||||
$(i_cshift1a_c): m4/cshift1a.m4 $(I_M$_DEPS)
|
||||
$(M4) -Dfile=$@ -I$(srcdir)/m4 cshift1a.m4 > $@
|
||||
|
||||
$(in_pack_c): m4/in_pack.m4 $(I_M4_DEPS)
|
||||
$(M4) -Dfile=$@ -I$(srcdir)/m4 in_pack.m4 > $@
|
||||
|
||||
|
|
|
|||
|
|
@ -302,7 +302,20 @@ am__objects_35 = cshift0_i1.lo cshift0_i2.lo cshift0_i4.lo \
|
|||
cshift0_i8.lo cshift0_i16.lo cshift0_r4.lo cshift0_r8.lo \
|
||||
cshift0_r10.lo cshift0_r16.lo cshift0_c4.lo cshift0_c8.lo \
|
||||
cshift0_c10.lo cshift0_c16.lo
|
||||
am__objects_36 = $(am__objects_4) $(am__objects_5) $(am__objects_6) \
|
||||
am__objects_36 = cshift1_4_i1.lo cshift1_4_i2.lo cshift1_4_i4.lo \
|
||||
cshift1_4_i8.lo cshift1_4_i16.lo cshift1_4_r4.lo \
|
||||
cshift1_4_r8.lo cshift1_4_r10.lo cshift1_4_r16.lo \
|
||||
cshift1_4_c4.lo cshift1_4_c8.lo cshift1_4_c10.lo \
|
||||
cshift1_4_c16.lo cshift1_8_i1.lo cshift1_8_i2.lo \
|
||||
cshift1_8_i4.lo cshift1_8_i8.lo cshift1_8_i16.lo \
|
||||
cshift1_8_r4.lo cshift1_8_r8.lo cshift1_8_r10.lo \
|
||||
cshift1_8_r16.lo cshift1_8_c4.lo cshift1_8_c8.lo \
|
||||
cshift1_8_c10.lo cshift1_8_c16.lo cshift1_16_i1.lo \
|
||||
cshift1_16_i2.lo cshift1_16_i4.lo cshift1_16_i8.lo \
|
||||
cshift1_16_i16.lo cshift1_16_r4.lo cshift1_16_r8.lo \
|
||||
cshift1_16_r10.lo cshift1_16_r16.lo cshift1_16_c4.lo \
|
||||
cshift1_16_c8.lo cshift1_16_c10.lo cshift1_16_c16.lo
|
||||
am__objects_37 = $(am__objects_4) $(am__objects_5) $(am__objects_6) \
|
||||
$(am__objects_7) $(am__objects_8) $(am__objects_9) \
|
||||
$(am__objects_10) $(am__objects_11) $(am__objects_12) \
|
||||
$(am__objects_13) $(am__objects_14) $(am__objects_15) \
|
||||
|
|
@ -312,14 +325,14 @@ am__objects_36 = $(am__objects_4) $(am__objects_5) $(am__objects_6) \
|
|||
$(am__objects_25) $(am__objects_26) $(am__objects_27) \
|
||||
$(am__objects_28) $(am__objects_29) $(am__objects_30) \
|
||||
$(am__objects_31) $(am__objects_32) $(am__objects_33) \
|
||||
$(am__objects_34) $(am__objects_35)
|
||||
@LIBGFOR_MINIMAL_FALSE@am__objects_37 = close.lo file_pos.lo format.lo \
|
||||
$(am__objects_34) $(am__objects_35) $(am__objects_36)
|
||||
@LIBGFOR_MINIMAL_FALSE@am__objects_38 = close.lo file_pos.lo format.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ inquire.lo intrinsics.lo list_read.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ lock.lo open.lo read.lo transfer.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ transfer128.lo unit.lo unix.lo write.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ fbuf.lo
|
||||
am__objects_38 = size_from_kind.lo $(am__objects_37)
|
||||
@LIBGFOR_MINIMAL_FALSE@am__objects_39 = access.lo c99_functions.lo \
|
||||
am__objects_39 = size_from_kind.lo $(am__objects_38)
|
||||
@LIBGFOR_MINIMAL_FALSE@am__objects_40 = access.lo c99_functions.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ chdir.lo chmod.lo clock.lo cpu_time.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ ctime.lo date_and_time.lo dtime.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ env.lo etime.lo execute_command_line.lo \
|
||||
|
|
@ -329,19 +342,19 @@ am__objects_38 = size_from_kind.lo $(am__objects_37)
|
|||
@LIBGFOR_MINIMAL_FALSE@ rename.lo stat.lo symlnk.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ system_clock.lo time.lo umask.lo \
|
||||
@LIBGFOR_MINIMAL_FALSE@ unlink.lo
|
||||
@IEEE_SUPPORT_TRUE@am__objects_40 = ieee_helper.lo
|
||||
am__objects_41 = associated.lo abort.lo args.lo cshift0.lo eoshift0.lo \
|
||||
@IEEE_SUPPORT_TRUE@am__objects_41 = ieee_helper.lo
|
||||
am__objects_42 = associated.lo abort.lo args.lo cshift0.lo eoshift0.lo \
|
||||
eoshift2.lo erfc_scaled.lo extends_type_of.lo fnum.lo \
|
||||
ierrno.lo ishftc.lo mvbits.lo move_alloc.lo pack_generic.lo \
|
||||
selected_char_kind.lo size.lo spread_generic.lo \
|
||||
string_intrinsics.lo rand.lo random.lo reshape_generic.lo \
|
||||
reshape_packed.lo selected_int_kind.lo selected_real_kind.lo \
|
||||
unpack_generic.lo in_pack_generic.lo in_unpack_generic.lo \
|
||||
$(am__objects_39) $(am__objects_40)
|
||||
@IEEE_SUPPORT_TRUE@am__objects_42 = ieee_arithmetic.lo \
|
||||
$(am__objects_40) $(am__objects_41)
|
||||
@IEEE_SUPPORT_TRUE@am__objects_43 = ieee_arithmetic.lo \
|
||||
@IEEE_SUPPORT_TRUE@ ieee_exceptions.lo ieee_features.lo
|
||||
am__objects_43 =
|
||||
am__objects_44 = _abs_c4.lo _abs_c8.lo _abs_c10.lo _abs_c16.lo \
|
||||
am__objects_44 =
|
||||
am__objects_45 = _abs_c4.lo _abs_c8.lo _abs_c10.lo _abs_c16.lo \
|
||||
_abs_i4.lo _abs_i8.lo _abs_i16.lo _abs_r4.lo _abs_r8.lo \
|
||||
_abs_r10.lo _abs_r16.lo _aimag_c4.lo _aimag_c8.lo \
|
||||
_aimag_c10.lo _aimag_c16.lo _exp_r4.lo _exp_r8.lo _exp_r10.lo \
|
||||
|
|
@ -365,19 +378,19 @@ am__objects_44 = _abs_c4.lo _abs_c8.lo _abs_c10.lo _abs_c16.lo \
|
|||
_conjg_c4.lo _conjg_c8.lo _conjg_c10.lo _conjg_c16.lo \
|
||||
_aint_r4.lo _aint_r8.lo _aint_r10.lo _aint_r16.lo _anint_r4.lo \
|
||||
_anint_r8.lo _anint_r10.lo _anint_r16.lo
|
||||
am__objects_45 = _sign_i4.lo _sign_i8.lo _sign_i16.lo _sign_r4.lo \
|
||||
am__objects_46 = _sign_i4.lo _sign_i8.lo _sign_i16.lo _sign_r4.lo \
|
||||
_sign_r8.lo _sign_r10.lo _sign_r16.lo _dim_i4.lo _dim_i8.lo \
|
||||
_dim_i16.lo _dim_r4.lo _dim_r8.lo _dim_r10.lo _dim_r16.lo \
|
||||
_atan2_r4.lo _atan2_r8.lo _atan2_r10.lo _atan2_r16.lo \
|
||||
_mod_i4.lo _mod_i8.lo _mod_i16.lo _mod_r4.lo _mod_r8.lo \
|
||||
_mod_r10.lo _mod_r16.lo
|
||||
am__objects_46 = misc_specifics.lo
|
||||
am__objects_47 = $(am__objects_44) $(am__objects_45) $(am__objects_46) \
|
||||
am__objects_47 = misc_specifics.lo
|
||||
am__objects_48 = $(am__objects_45) $(am__objects_46) $(am__objects_47) \
|
||||
dprod_r8.lo f2c_specifics.lo
|
||||
am__objects_48 = $(am__objects_3) $(am__objects_36) $(am__objects_38) \
|
||||
$(am__objects_41) $(am__objects_42) $(am__objects_43) \
|
||||
$(am__objects_47)
|
||||
@onestep_FALSE@am_libgfortran_la_OBJECTS = $(am__objects_48)
|
||||
am__objects_49 = $(am__objects_3) $(am__objects_37) $(am__objects_39) \
|
||||
$(am__objects_42) $(am__objects_43) $(am__objects_44) \
|
||||
$(am__objects_48)
|
||||
@onestep_FALSE@am_libgfortran_la_OBJECTS = $(am__objects_49)
|
||||
@onestep_TRUE@am_libgfortran_la_OBJECTS = libgfortran_c.lo
|
||||
libgfortran_la_OBJECTS = $(am_libgfortran_la_OBJECTS)
|
||||
DEFAULT_INCLUDES = -I.@am__isrc@
|
||||
|
|
@ -954,6 +967,47 @@ $(srcdir)/generated/cshift1_4.c \
|
|||
$(srcdir)/generated/cshift1_8.c \
|
||||
$(srcdir)/generated/cshift1_16.c
|
||||
|
||||
i_cshift1a_c = \
|
||||
$(srcdir)/generated/cshift1_4_i1.c \
|
||||
$(srcdir)/generated/cshift1_4_i2.c \
|
||||
$(srcdir)/generated/cshift1_4_i4.c \
|
||||
$(srcdir)/generated/cshift1_4_i8.c \
|
||||
$(srcdir)/generated/cshift1_4_i16.c \
|
||||
$(srcdir)/generated/cshift1_4_r4.c \
|
||||
$(srcdir)/generated/cshift1_4_r8.c \
|
||||
$(srcdir)/generated/cshift1_4_r10.c \
|
||||
$(srcdir)/generated/cshift1_4_r16.c \
|
||||
$(srcdir)/generated/cshift1_4_c4.c \
|
||||
$(srcdir)/generated/cshift1_4_c8.c \
|
||||
$(srcdir)/generated/cshift1_4_c10.c \
|
||||
$(srcdir)/generated/cshift1_4_c16.c \
|
||||
$(srcdir)/generated/cshift1_8_i1.c \
|
||||
$(srcdir)/generated/cshift1_8_i2.c \
|
||||
$(srcdir)/generated/cshift1_8_i4.c \
|
||||
$(srcdir)/generated/cshift1_8_i8.c \
|
||||
$(srcdir)/generated/cshift1_8_i16.c \
|
||||
$(srcdir)/generated/cshift1_8_r4.c \
|
||||
$(srcdir)/generated/cshift1_8_r8.c \
|
||||
$(srcdir)/generated/cshift1_8_r10.c \
|
||||
$(srcdir)/generated/cshift1_8_r16.c \
|
||||
$(srcdir)/generated/cshift1_8_c4.c \
|
||||
$(srcdir)/generated/cshift1_8_c8.c \
|
||||
$(srcdir)/generated/cshift1_8_c10.c \
|
||||
$(srcdir)/generated/cshift1_8_c16.c \
|
||||
$(srcdir)/generated/cshift1_16_i1.c \
|
||||
$(srcdir)/generated/cshift1_16_i2.c \
|
||||
$(srcdir)/generated/cshift1_16_i4.c \
|
||||
$(srcdir)/generated/cshift1_16_i8.c \
|
||||
$(srcdir)/generated/cshift1_16_i16.c \
|
||||
$(srcdir)/generated/cshift1_16_r4.c \
|
||||
$(srcdir)/generated/cshift1_16_r8.c \
|
||||
$(srcdir)/generated/cshift1_16_r10.c \
|
||||
$(srcdir)/generated/cshift1_16_r16.c \
|
||||
$(srcdir)/generated/cshift1_16_c4.c \
|
||||
$(srcdir)/generated/cshift1_16_c8.c \
|
||||
$(srcdir)/generated/cshift1_16_c10.c \
|
||||
$(srcdir)/generated/cshift1_16_c16.c
|
||||
|
||||
in_pack_c = \
|
||||
$(srcdir)/generated/in_pack_i1.c \
|
||||
$(srcdir)/generated/in_pack_i2.c \
|
||||
|
|
@ -1081,7 +1135,8 @@ gfor_built_src = $(i_all_c) $(i_any_c) $(i_count_c) $(i_maxloc0_c) \
|
|||
$(i_eoshift3_c) $(i_cshift1_c) $(i_reshape_c) $(in_pack_c) $(in_unpack_c) \
|
||||
$(i_pow_c) $(i_pack_c) $(i_unpack_c) $(i_matmulavx128_c) \
|
||||
$(i_spread_c) selected_int_kind.inc selected_real_kind.inc kinds.h \
|
||||
$(i_cshift0_c) kinds.inc c99_protos.inc fpu-target.h fpu-target.inc
|
||||
$(i_cshift0_c) kinds.inc c99_protos.inc fpu-target.h fpu-target.inc \
|
||||
$(i_cshift1a_c)
|
||||
|
||||
|
||||
# Machine generated specifics
|
||||
|
|
@ -1437,8 +1492,47 @@ distclean-compile:
|
|||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift0_r4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift0_r8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_c10.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_c16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_c4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_c8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_i1.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_i16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_i2.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_i4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_i8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_r10.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_r16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_r4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_16_r8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_c10.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_c16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_c4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_c8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_i1.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_i16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_i2.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_i4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_i8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_r10.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_r16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_r4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_4_r8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_c10.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_c16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_c4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_c8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_i1.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_i16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_i2.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_i4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_i8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_r10.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_r16.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_r4.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/cshift1_8_r8.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/ctime.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/date_and_time.Plo@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/dtime.Plo@am__quote@
|
||||
|
|
@ -4890,6 +4984,279 @@ cshift0_c16.lo: $(srcdir)/generated/cshift0_c16.c
|
|||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift0_c16.lo `test -f '$(srcdir)/generated/cshift0_c16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift0_c16.c
|
||||
|
||||
cshift1_4_i1.lo: $(srcdir)/generated/cshift1_4_i1.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_i1.lo -MD -MP -MF $(DEPDIR)/cshift1_4_i1.Tpo -c -o cshift1_4_i1.lo `test -f '$(srcdir)/generated/cshift1_4_i1.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i1.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_i1.Tpo $(DEPDIR)/cshift1_4_i1.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_i1.c' object='cshift1_4_i1.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_i1.lo `test -f '$(srcdir)/generated/cshift1_4_i1.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i1.c
|
||||
|
||||
cshift1_4_i2.lo: $(srcdir)/generated/cshift1_4_i2.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_i2.lo -MD -MP -MF $(DEPDIR)/cshift1_4_i2.Tpo -c -o cshift1_4_i2.lo `test -f '$(srcdir)/generated/cshift1_4_i2.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i2.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_i2.Tpo $(DEPDIR)/cshift1_4_i2.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_i2.c' object='cshift1_4_i2.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_i2.lo `test -f '$(srcdir)/generated/cshift1_4_i2.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i2.c
|
||||
|
||||
cshift1_4_i4.lo: $(srcdir)/generated/cshift1_4_i4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_i4.lo -MD -MP -MF $(DEPDIR)/cshift1_4_i4.Tpo -c -o cshift1_4_i4.lo `test -f '$(srcdir)/generated/cshift1_4_i4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_i4.Tpo $(DEPDIR)/cshift1_4_i4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_i4.c' object='cshift1_4_i4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_i4.lo `test -f '$(srcdir)/generated/cshift1_4_i4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i4.c
|
||||
|
||||
cshift1_4_i8.lo: $(srcdir)/generated/cshift1_4_i8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_i8.lo -MD -MP -MF $(DEPDIR)/cshift1_4_i8.Tpo -c -o cshift1_4_i8.lo `test -f '$(srcdir)/generated/cshift1_4_i8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_i8.Tpo $(DEPDIR)/cshift1_4_i8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_i8.c' object='cshift1_4_i8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_i8.lo `test -f '$(srcdir)/generated/cshift1_4_i8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i8.c
|
||||
|
||||
cshift1_4_i16.lo: $(srcdir)/generated/cshift1_4_i16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_i16.lo -MD -MP -MF $(DEPDIR)/cshift1_4_i16.Tpo -c -o cshift1_4_i16.lo `test -f '$(srcdir)/generated/cshift1_4_i16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_i16.Tpo $(DEPDIR)/cshift1_4_i16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_i16.c' object='cshift1_4_i16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_i16.lo `test -f '$(srcdir)/generated/cshift1_4_i16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_i16.c
|
||||
|
||||
cshift1_4_r4.lo: $(srcdir)/generated/cshift1_4_r4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_r4.lo -MD -MP -MF $(DEPDIR)/cshift1_4_r4.Tpo -c -o cshift1_4_r4.lo `test -f '$(srcdir)/generated/cshift1_4_r4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_r4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_r4.Tpo $(DEPDIR)/cshift1_4_r4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_r4.c' object='cshift1_4_r4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_r4.lo `test -f '$(srcdir)/generated/cshift1_4_r4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_r4.c
|
||||
|
||||
cshift1_4_r8.lo: $(srcdir)/generated/cshift1_4_r8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_r8.lo -MD -MP -MF $(DEPDIR)/cshift1_4_r8.Tpo -c -o cshift1_4_r8.lo `test -f '$(srcdir)/generated/cshift1_4_r8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_r8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_r8.Tpo $(DEPDIR)/cshift1_4_r8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_r8.c' object='cshift1_4_r8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_r8.lo `test -f '$(srcdir)/generated/cshift1_4_r8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_r8.c
|
||||
|
||||
cshift1_4_r10.lo: $(srcdir)/generated/cshift1_4_r10.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_r10.lo -MD -MP -MF $(DEPDIR)/cshift1_4_r10.Tpo -c -o cshift1_4_r10.lo `test -f '$(srcdir)/generated/cshift1_4_r10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_r10.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_r10.Tpo $(DEPDIR)/cshift1_4_r10.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_r10.c' object='cshift1_4_r10.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_r10.lo `test -f '$(srcdir)/generated/cshift1_4_r10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_r10.c
|
||||
|
||||
cshift1_4_r16.lo: $(srcdir)/generated/cshift1_4_r16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_r16.lo -MD -MP -MF $(DEPDIR)/cshift1_4_r16.Tpo -c -o cshift1_4_r16.lo `test -f '$(srcdir)/generated/cshift1_4_r16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_r16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_r16.Tpo $(DEPDIR)/cshift1_4_r16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_r16.c' object='cshift1_4_r16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_r16.lo `test -f '$(srcdir)/generated/cshift1_4_r16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_r16.c
|
||||
|
||||
cshift1_4_c4.lo: $(srcdir)/generated/cshift1_4_c4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_c4.lo -MD -MP -MF $(DEPDIR)/cshift1_4_c4.Tpo -c -o cshift1_4_c4.lo `test -f '$(srcdir)/generated/cshift1_4_c4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_c4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_c4.Tpo $(DEPDIR)/cshift1_4_c4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_c4.c' object='cshift1_4_c4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_c4.lo `test -f '$(srcdir)/generated/cshift1_4_c4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_c4.c
|
||||
|
||||
cshift1_4_c8.lo: $(srcdir)/generated/cshift1_4_c8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_c8.lo -MD -MP -MF $(DEPDIR)/cshift1_4_c8.Tpo -c -o cshift1_4_c8.lo `test -f '$(srcdir)/generated/cshift1_4_c8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_c8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_c8.Tpo $(DEPDIR)/cshift1_4_c8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_c8.c' object='cshift1_4_c8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_c8.lo `test -f '$(srcdir)/generated/cshift1_4_c8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_c8.c
|
||||
|
||||
cshift1_4_c10.lo: $(srcdir)/generated/cshift1_4_c10.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_c10.lo -MD -MP -MF $(DEPDIR)/cshift1_4_c10.Tpo -c -o cshift1_4_c10.lo `test -f '$(srcdir)/generated/cshift1_4_c10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_c10.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_c10.Tpo $(DEPDIR)/cshift1_4_c10.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_c10.c' object='cshift1_4_c10.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_c10.lo `test -f '$(srcdir)/generated/cshift1_4_c10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_c10.c
|
||||
|
||||
cshift1_4_c16.lo: $(srcdir)/generated/cshift1_4_c16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_4_c16.lo -MD -MP -MF $(DEPDIR)/cshift1_4_c16.Tpo -c -o cshift1_4_c16.lo `test -f '$(srcdir)/generated/cshift1_4_c16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_c16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_4_c16.Tpo $(DEPDIR)/cshift1_4_c16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_4_c16.c' object='cshift1_4_c16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_4_c16.lo `test -f '$(srcdir)/generated/cshift1_4_c16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_4_c16.c
|
||||
|
||||
cshift1_8_i1.lo: $(srcdir)/generated/cshift1_8_i1.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_i1.lo -MD -MP -MF $(DEPDIR)/cshift1_8_i1.Tpo -c -o cshift1_8_i1.lo `test -f '$(srcdir)/generated/cshift1_8_i1.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i1.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_i1.Tpo $(DEPDIR)/cshift1_8_i1.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_i1.c' object='cshift1_8_i1.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_i1.lo `test -f '$(srcdir)/generated/cshift1_8_i1.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i1.c
|
||||
|
||||
cshift1_8_i2.lo: $(srcdir)/generated/cshift1_8_i2.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_i2.lo -MD -MP -MF $(DEPDIR)/cshift1_8_i2.Tpo -c -o cshift1_8_i2.lo `test -f '$(srcdir)/generated/cshift1_8_i2.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i2.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_i2.Tpo $(DEPDIR)/cshift1_8_i2.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_i2.c' object='cshift1_8_i2.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_i2.lo `test -f '$(srcdir)/generated/cshift1_8_i2.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i2.c
|
||||
|
||||
cshift1_8_i4.lo: $(srcdir)/generated/cshift1_8_i4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_i4.lo -MD -MP -MF $(DEPDIR)/cshift1_8_i4.Tpo -c -o cshift1_8_i4.lo `test -f '$(srcdir)/generated/cshift1_8_i4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_i4.Tpo $(DEPDIR)/cshift1_8_i4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_i4.c' object='cshift1_8_i4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_i4.lo `test -f '$(srcdir)/generated/cshift1_8_i4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i4.c
|
||||
|
||||
cshift1_8_i8.lo: $(srcdir)/generated/cshift1_8_i8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_i8.lo -MD -MP -MF $(DEPDIR)/cshift1_8_i8.Tpo -c -o cshift1_8_i8.lo `test -f '$(srcdir)/generated/cshift1_8_i8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_i8.Tpo $(DEPDIR)/cshift1_8_i8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_i8.c' object='cshift1_8_i8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_i8.lo `test -f '$(srcdir)/generated/cshift1_8_i8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i8.c
|
||||
|
||||
cshift1_8_i16.lo: $(srcdir)/generated/cshift1_8_i16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_i16.lo -MD -MP -MF $(DEPDIR)/cshift1_8_i16.Tpo -c -o cshift1_8_i16.lo `test -f '$(srcdir)/generated/cshift1_8_i16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_i16.Tpo $(DEPDIR)/cshift1_8_i16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_i16.c' object='cshift1_8_i16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_i16.lo `test -f '$(srcdir)/generated/cshift1_8_i16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_i16.c
|
||||
|
||||
cshift1_8_r4.lo: $(srcdir)/generated/cshift1_8_r4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_r4.lo -MD -MP -MF $(DEPDIR)/cshift1_8_r4.Tpo -c -o cshift1_8_r4.lo `test -f '$(srcdir)/generated/cshift1_8_r4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_r4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_r4.Tpo $(DEPDIR)/cshift1_8_r4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_r4.c' object='cshift1_8_r4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_r4.lo `test -f '$(srcdir)/generated/cshift1_8_r4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_r4.c
|
||||
|
||||
cshift1_8_r8.lo: $(srcdir)/generated/cshift1_8_r8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_r8.lo -MD -MP -MF $(DEPDIR)/cshift1_8_r8.Tpo -c -o cshift1_8_r8.lo `test -f '$(srcdir)/generated/cshift1_8_r8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_r8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_r8.Tpo $(DEPDIR)/cshift1_8_r8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_r8.c' object='cshift1_8_r8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_r8.lo `test -f '$(srcdir)/generated/cshift1_8_r8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_r8.c
|
||||
|
||||
cshift1_8_r10.lo: $(srcdir)/generated/cshift1_8_r10.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_r10.lo -MD -MP -MF $(DEPDIR)/cshift1_8_r10.Tpo -c -o cshift1_8_r10.lo `test -f '$(srcdir)/generated/cshift1_8_r10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_r10.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_r10.Tpo $(DEPDIR)/cshift1_8_r10.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_r10.c' object='cshift1_8_r10.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_r10.lo `test -f '$(srcdir)/generated/cshift1_8_r10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_r10.c
|
||||
|
||||
cshift1_8_r16.lo: $(srcdir)/generated/cshift1_8_r16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_r16.lo -MD -MP -MF $(DEPDIR)/cshift1_8_r16.Tpo -c -o cshift1_8_r16.lo `test -f '$(srcdir)/generated/cshift1_8_r16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_r16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_r16.Tpo $(DEPDIR)/cshift1_8_r16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_r16.c' object='cshift1_8_r16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_r16.lo `test -f '$(srcdir)/generated/cshift1_8_r16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_r16.c
|
||||
|
||||
cshift1_8_c4.lo: $(srcdir)/generated/cshift1_8_c4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_c4.lo -MD -MP -MF $(DEPDIR)/cshift1_8_c4.Tpo -c -o cshift1_8_c4.lo `test -f '$(srcdir)/generated/cshift1_8_c4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_c4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_c4.Tpo $(DEPDIR)/cshift1_8_c4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_c4.c' object='cshift1_8_c4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_c4.lo `test -f '$(srcdir)/generated/cshift1_8_c4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_c4.c
|
||||
|
||||
cshift1_8_c8.lo: $(srcdir)/generated/cshift1_8_c8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_c8.lo -MD -MP -MF $(DEPDIR)/cshift1_8_c8.Tpo -c -o cshift1_8_c8.lo `test -f '$(srcdir)/generated/cshift1_8_c8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_c8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_c8.Tpo $(DEPDIR)/cshift1_8_c8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_c8.c' object='cshift1_8_c8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_c8.lo `test -f '$(srcdir)/generated/cshift1_8_c8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_c8.c
|
||||
|
||||
cshift1_8_c10.lo: $(srcdir)/generated/cshift1_8_c10.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_c10.lo -MD -MP -MF $(DEPDIR)/cshift1_8_c10.Tpo -c -o cshift1_8_c10.lo `test -f '$(srcdir)/generated/cshift1_8_c10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_c10.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_c10.Tpo $(DEPDIR)/cshift1_8_c10.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_c10.c' object='cshift1_8_c10.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_c10.lo `test -f '$(srcdir)/generated/cshift1_8_c10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_c10.c
|
||||
|
||||
cshift1_8_c16.lo: $(srcdir)/generated/cshift1_8_c16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_8_c16.lo -MD -MP -MF $(DEPDIR)/cshift1_8_c16.Tpo -c -o cshift1_8_c16.lo `test -f '$(srcdir)/generated/cshift1_8_c16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_c16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_8_c16.Tpo $(DEPDIR)/cshift1_8_c16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_8_c16.c' object='cshift1_8_c16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_8_c16.lo `test -f '$(srcdir)/generated/cshift1_8_c16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_8_c16.c
|
||||
|
||||
cshift1_16_i1.lo: $(srcdir)/generated/cshift1_16_i1.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_i1.lo -MD -MP -MF $(DEPDIR)/cshift1_16_i1.Tpo -c -o cshift1_16_i1.lo `test -f '$(srcdir)/generated/cshift1_16_i1.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i1.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_i1.Tpo $(DEPDIR)/cshift1_16_i1.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_i1.c' object='cshift1_16_i1.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_i1.lo `test -f '$(srcdir)/generated/cshift1_16_i1.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i1.c
|
||||
|
||||
cshift1_16_i2.lo: $(srcdir)/generated/cshift1_16_i2.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_i2.lo -MD -MP -MF $(DEPDIR)/cshift1_16_i2.Tpo -c -o cshift1_16_i2.lo `test -f '$(srcdir)/generated/cshift1_16_i2.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i2.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_i2.Tpo $(DEPDIR)/cshift1_16_i2.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_i2.c' object='cshift1_16_i2.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_i2.lo `test -f '$(srcdir)/generated/cshift1_16_i2.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i2.c
|
||||
|
||||
cshift1_16_i4.lo: $(srcdir)/generated/cshift1_16_i4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_i4.lo -MD -MP -MF $(DEPDIR)/cshift1_16_i4.Tpo -c -o cshift1_16_i4.lo `test -f '$(srcdir)/generated/cshift1_16_i4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_i4.Tpo $(DEPDIR)/cshift1_16_i4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_i4.c' object='cshift1_16_i4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_i4.lo `test -f '$(srcdir)/generated/cshift1_16_i4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i4.c
|
||||
|
||||
cshift1_16_i8.lo: $(srcdir)/generated/cshift1_16_i8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_i8.lo -MD -MP -MF $(DEPDIR)/cshift1_16_i8.Tpo -c -o cshift1_16_i8.lo `test -f '$(srcdir)/generated/cshift1_16_i8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_i8.Tpo $(DEPDIR)/cshift1_16_i8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_i8.c' object='cshift1_16_i8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_i8.lo `test -f '$(srcdir)/generated/cshift1_16_i8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i8.c
|
||||
|
||||
cshift1_16_i16.lo: $(srcdir)/generated/cshift1_16_i16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_i16.lo -MD -MP -MF $(DEPDIR)/cshift1_16_i16.Tpo -c -o cshift1_16_i16.lo `test -f '$(srcdir)/generated/cshift1_16_i16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_i16.Tpo $(DEPDIR)/cshift1_16_i16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_i16.c' object='cshift1_16_i16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_i16.lo `test -f '$(srcdir)/generated/cshift1_16_i16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_i16.c
|
||||
|
||||
cshift1_16_r4.lo: $(srcdir)/generated/cshift1_16_r4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_r4.lo -MD -MP -MF $(DEPDIR)/cshift1_16_r4.Tpo -c -o cshift1_16_r4.lo `test -f '$(srcdir)/generated/cshift1_16_r4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_r4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_r4.Tpo $(DEPDIR)/cshift1_16_r4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_r4.c' object='cshift1_16_r4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_r4.lo `test -f '$(srcdir)/generated/cshift1_16_r4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_r4.c
|
||||
|
||||
cshift1_16_r8.lo: $(srcdir)/generated/cshift1_16_r8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_r8.lo -MD -MP -MF $(DEPDIR)/cshift1_16_r8.Tpo -c -o cshift1_16_r8.lo `test -f '$(srcdir)/generated/cshift1_16_r8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_r8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_r8.Tpo $(DEPDIR)/cshift1_16_r8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_r8.c' object='cshift1_16_r8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_r8.lo `test -f '$(srcdir)/generated/cshift1_16_r8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_r8.c
|
||||
|
||||
cshift1_16_r10.lo: $(srcdir)/generated/cshift1_16_r10.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_r10.lo -MD -MP -MF $(DEPDIR)/cshift1_16_r10.Tpo -c -o cshift1_16_r10.lo `test -f '$(srcdir)/generated/cshift1_16_r10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_r10.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_r10.Tpo $(DEPDIR)/cshift1_16_r10.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_r10.c' object='cshift1_16_r10.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_r10.lo `test -f '$(srcdir)/generated/cshift1_16_r10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_r10.c
|
||||
|
||||
cshift1_16_r16.lo: $(srcdir)/generated/cshift1_16_r16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_r16.lo -MD -MP -MF $(DEPDIR)/cshift1_16_r16.Tpo -c -o cshift1_16_r16.lo `test -f '$(srcdir)/generated/cshift1_16_r16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_r16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_r16.Tpo $(DEPDIR)/cshift1_16_r16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_r16.c' object='cshift1_16_r16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_r16.lo `test -f '$(srcdir)/generated/cshift1_16_r16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_r16.c
|
||||
|
||||
cshift1_16_c4.lo: $(srcdir)/generated/cshift1_16_c4.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_c4.lo -MD -MP -MF $(DEPDIR)/cshift1_16_c4.Tpo -c -o cshift1_16_c4.lo `test -f '$(srcdir)/generated/cshift1_16_c4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_c4.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_c4.Tpo $(DEPDIR)/cshift1_16_c4.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_c4.c' object='cshift1_16_c4.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_c4.lo `test -f '$(srcdir)/generated/cshift1_16_c4.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_c4.c
|
||||
|
||||
cshift1_16_c8.lo: $(srcdir)/generated/cshift1_16_c8.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_c8.lo -MD -MP -MF $(DEPDIR)/cshift1_16_c8.Tpo -c -o cshift1_16_c8.lo `test -f '$(srcdir)/generated/cshift1_16_c8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_c8.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_c8.Tpo $(DEPDIR)/cshift1_16_c8.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_c8.c' object='cshift1_16_c8.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_c8.lo `test -f '$(srcdir)/generated/cshift1_16_c8.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_c8.c
|
||||
|
||||
cshift1_16_c10.lo: $(srcdir)/generated/cshift1_16_c10.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_c10.lo -MD -MP -MF $(DEPDIR)/cshift1_16_c10.Tpo -c -o cshift1_16_c10.lo `test -f '$(srcdir)/generated/cshift1_16_c10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_c10.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_c10.Tpo $(DEPDIR)/cshift1_16_c10.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_c10.c' object='cshift1_16_c10.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_c10.lo `test -f '$(srcdir)/generated/cshift1_16_c10.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_c10.c
|
||||
|
||||
cshift1_16_c16.lo: $(srcdir)/generated/cshift1_16_c16.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT cshift1_16_c16.lo -MD -MP -MF $(DEPDIR)/cshift1_16_c16.Tpo -c -o cshift1_16_c16.lo `test -f '$(srcdir)/generated/cshift1_16_c16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_c16.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/cshift1_16_c16.Tpo $(DEPDIR)/cshift1_16_c16.Plo
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$(srcdir)/generated/cshift1_16_c16.c' object='cshift1_16_c16.lo' libtool=yes @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o cshift1_16_c16.lo `test -f '$(srcdir)/generated/cshift1_16_c16.c' || echo '$(srcdir)/'`$(srcdir)/generated/cshift1_16_c16.c
|
||||
|
||||
size_from_kind.lo: io/size_from_kind.c
|
||||
@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT size_from_kind.lo -MD -MP -MF $(DEPDIR)/size_from_kind.Tpo -c -o size_from_kind.lo `test -f 'io/size_from_kind.c' || echo '$(srcdir)/'`io/size_from_kind.c
|
||||
@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/size_from_kind.Tpo $(DEPDIR)/size_from_kind.Plo
|
||||
|
|
@ -5824,6 +6191,9 @@ fpu-target.inc: fpu-target.h $(srcdir)/libgfortran.h
|
|||
@MAINTAINER_MODE_TRUE@$(i_cshift1_c): m4/cshift1.m4 $(I_M4_DEPS)
|
||||
@MAINTAINER_MODE_TRUE@ $(M4) -Dfile=$@ -I$(srcdir)/m4 cshift1.m4 > $@
|
||||
|
||||
@MAINTAINER_MODE_TRUE@$(i_cshift1a_c): m4/cshift1a.m4 $(I_M$_DEPS)
|
||||
@MAINTAINER_MODE_TRUE@ $(M4) -Dfile=$@ -I$(srcdir)/m4 cshift1a.m4 > $@
|
||||
|
||||
@MAINTAINER_MODE_TRUE@$(in_pack_c): m4/in_pack.m4 $(I_M4_DEPS)
|
||||
@MAINTAINER_MODE_TRUE@ $(M4) -Dfile=$@ -I$(srcdir)/m4 in_pack.m4 > $@
|
||||
|
||||
|
|
|
|||
|
|
@ -61,12 +61,13 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
GFC_INTEGER_16 sh;
|
||||
index_type arraysize;
|
||||
index_type size;
|
||||
|
||||
index_type type_size;
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
|
||||
if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
|
||||
runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
|
||||
|
||||
|
|
@ -111,6 +112,98 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
if (arraysize == 0)
|
||||
return;
|
||||
|
||||
/* See if we should dispatch to a helper function. */
|
||||
|
||||
type_size = GFC_DTYPE_TYPE_SIZE (array);
|
||||
|
||||
switch (type_size)
|
||||
{
|
||||
case GFC_DTYPE_LOGICAL_1:
|
||||
case GFC_DTYPE_INTEGER_1:
|
||||
case GFC_DTYPE_DERIVED_1:
|
||||
cshift1_16_i1 ((gfc_array_i1 *)ret, (gfc_array_i1 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_2:
|
||||
case GFC_DTYPE_INTEGER_2:
|
||||
cshift1_16_i2 ((gfc_array_i2 *)ret, (gfc_array_i2 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_4:
|
||||
case GFC_DTYPE_INTEGER_4:
|
||||
cshift1_16_i4 ((gfc_array_i4 *)ret, (gfc_array_i4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_8:
|
||||
case GFC_DTYPE_INTEGER_8:
|
||||
cshift1_16_i8 ((gfc_array_i8 *)ret, (gfc_array_i8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_INTEGER_16)
|
||||
case GFC_DTYPE_LOGICAL_16:
|
||||
case GFC_DTYPE_INTEGER_16:
|
||||
cshift1_16_i16 ((gfc_array_i16 *)ret, (gfc_array_i16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
case GFC_DTYPE_REAL_4:
|
||||
cshift1_16_r4 ((gfc_array_r4 *)ret, (gfc_array_r4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_REAL_8:
|
||||
cshift1_16_r8 ((gfc_array_r8 *)ret, (gfc_array_r8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_REAL_10)
|
||||
case GFC_DTYPE_REAL_10:
|
||||
cshift1_16_r10 ((gfc_array_r10 *)ret, (gfc_array_r10 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_REAL_16)
|
||||
case GFC_DTYPE_REAL_16:
|
||||
cshift1_16_r16 ((gfc_array_r16 *)ret, (gfc_array_r16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
case GFC_DTYPE_COMPLEX_4:
|
||||
cshift1_16_c4 ((gfc_array_c4 *)ret, (gfc_array_c4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_COMPLEX_8:
|
||||
cshift1_16_c8 ((gfc_array_c8 *)ret, (gfc_array_c8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_COMPLEX_10)
|
||||
case GFC_DTYPE_COMPLEX_10:
|
||||
cshift1_16_c10 ((gfc_array_c10 *)ret, (gfc_array_c10 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_COMPLEX_16)
|
||||
case GFC_DTYPE_COMPLEX_16:
|
||||
cshift1_16_c16 ((gfc_array_c16 *)ret, (gfc_array_c16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
default:
|
||||
break;
|
||||
|
||||
}
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
|
@ -162,22 +255,41 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
sh = (div (sh, len)).rem;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely (sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
|
||||
for (n = 0; n < len; n++)
|
||||
if (soffset == size && roffset == size)
|
||||
{
|
||||
size_t len1 = sh * size;
|
||||
size_t len2 = (len - sh) * size;
|
||||
memcpy (rptr, sptr + len1, len2);
|
||||
memcpy (rptr + len2, sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
if (n == len - sh - 1)
|
||||
src = sptr;
|
||||
else
|
||||
src += soffset;
|
||||
}
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
|
|
|
|||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_10) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_c10 (gfc_array_c10 * const restrict ret,
|
||||
const gfc_array_c10 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_10 *rptr;
|
||||
GFC_COMPLEX_10 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_10 *sptr;
|
||||
const GFC_COMPLEX_10 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_10);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_10);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_16) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_c16 (gfc_array_c16 * const restrict ret,
|
||||
const gfc_array_c16 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_16 *rptr;
|
||||
GFC_COMPLEX_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_16 *sptr;
|
||||
const GFC_COMPLEX_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_4) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_c4 (gfc_array_c4 * const restrict ret,
|
||||
const gfc_array_c4 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_4 *rptr;
|
||||
GFC_COMPLEX_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_4 *sptr;
|
||||
const GFC_COMPLEX_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_8) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_c8 (gfc_array_c8 * const restrict ret,
|
||||
const gfc_array_c8 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_8 *rptr;
|
||||
GFC_COMPLEX_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_8 *sptr;
|
||||
const GFC_COMPLEX_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_1) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_i1 (gfc_array_i1 * const restrict ret,
|
||||
const gfc_array_i1 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_1 *rptr;
|
||||
GFC_INTEGER_1 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_1 *sptr;
|
||||
const GFC_INTEGER_1 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_1);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_1);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_i16 (gfc_array_i16 * const restrict ret,
|
||||
const gfc_array_i16 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_16 *rptr;
|
||||
GFC_INTEGER_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_16 *sptr;
|
||||
const GFC_INTEGER_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_2) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_i2 (gfc_array_i2 * const restrict ret,
|
||||
const gfc_array_i2 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_2 *rptr;
|
||||
GFC_INTEGER_2 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_2 *sptr;
|
||||
const GFC_INTEGER_2 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_2);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_2);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_i4 (gfc_array_i4 * const restrict ret,
|
||||
const gfc_array_i4 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_4 *rptr;
|
||||
GFC_INTEGER_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_4 *sptr;
|
||||
const GFC_INTEGER_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_i8 (gfc_array_i8 * const restrict ret,
|
||||
const gfc_array_i8 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_8 *rptr;
|
||||
GFC_INTEGER_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_8 *sptr;
|
||||
const GFC_INTEGER_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_10) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_r10 (gfc_array_r10 * const restrict ret,
|
||||
const gfc_array_r10 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_10 *rptr;
|
||||
GFC_REAL_10 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_10 *sptr;
|
||||
const GFC_REAL_10 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_10);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_10);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_16) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_r16 (gfc_array_r16 * const restrict ret,
|
||||
const gfc_array_r16 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_16 *rptr;
|
||||
GFC_REAL_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_16 *sptr;
|
||||
const GFC_REAL_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_4) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_r4 (gfc_array_r4 * const restrict ret,
|
||||
const gfc_array_r4 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_4 *rptr;
|
||||
GFC_REAL_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_4 *sptr;
|
||||
const GFC_REAL_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_8) && defined (HAVE_GFC_INTEGER_16)
|
||||
|
||||
void
|
||||
cshift1_16_r8 (gfc_array_r8 * const restrict ret,
|
||||
const gfc_array_r8 * const restrict array,
|
||||
const gfc_array_i16 * const restrict h,
|
||||
const GFC_INTEGER_16 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_8 *rptr;
|
||||
GFC_REAL_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_8 *sptr;
|
||||
const GFC_REAL_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_16 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_16 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -61,12 +61,13 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
GFC_INTEGER_4 sh;
|
||||
index_type arraysize;
|
||||
index_type size;
|
||||
|
||||
index_type type_size;
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
|
||||
if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
|
||||
runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
|
||||
|
||||
|
|
@ -111,6 +112,98 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
if (arraysize == 0)
|
||||
return;
|
||||
|
||||
/* See if we should dispatch to a helper function. */
|
||||
|
||||
type_size = GFC_DTYPE_TYPE_SIZE (array);
|
||||
|
||||
switch (type_size)
|
||||
{
|
||||
case GFC_DTYPE_LOGICAL_1:
|
||||
case GFC_DTYPE_INTEGER_1:
|
||||
case GFC_DTYPE_DERIVED_1:
|
||||
cshift1_4_i1 ((gfc_array_i1 *)ret, (gfc_array_i1 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_2:
|
||||
case GFC_DTYPE_INTEGER_2:
|
||||
cshift1_4_i2 ((gfc_array_i2 *)ret, (gfc_array_i2 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_4:
|
||||
case GFC_DTYPE_INTEGER_4:
|
||||
cshift1_4_i4 ((gfc_array_i4 *)ret, (gfc_array_i4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_8:
|
||||
case GFC_DTYPE_INTEGER_8:
|
||||
cshift1_4_i8 ((gfc_array_i8 *)ret, (gfc_array_i8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_INTEGER_16)
|
||||
case GFC_DTYPE_LOGICAL_16:
|
||||
case GFC_DTYPE_INTEGER_16:
|
||||
cshift1_4_i16 ((gfc_array_i16 *)ret, (gfc_array_i16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
case GFC_DTYPE_REAL_4:
|
||||
cshift1_4_r4 ((gfc_array_r4 *)ret, (gfc_array_r4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_REAL_8:
|
||||
cshift1_4_r8 ((gfc_array_r8 *)ret, (gfc_array_r8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_REAL_10)
|
||||
case GFC_DTYPE_REAL_10:
|
||||
cshift1_4_r10 ((gfc_array_r10 *)ret, (gfc_array_r10 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_REAL_16)
|
||||
case GFC_DTYPE_REAL_16:
|
||||
cshift1_4_r16 ((gfc_array_r16 *)ret, (gfc_array_r16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
case GFC_DTYPE_COMPLEX_4:
|
||||
cshift1_4_c4 ((gfc_array_c4 *)ret, (gfc_array_c4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_COMPLEX_8:
|
||||
cshift1_4_c8 ((gfc_array_c8 *)ret, (gfc_array_c8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_COMPLEX_10)
|
||||
case GFC_DTYPE_COMPLEX_10:
|
||||
cshift1_4_c10 ((gfc_array_c10 *)ret, (gfc_array_c10 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_COMPLEX_16)
|
||||
case GFC_DTYPE_COMPLEX_16:
|
||||
cshift1_4_c16 ((gfc_array_c16 *)ret, (gfc_array_c16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
default:
|
||||
break;
|
||||
|
||||
}
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
|
@ -162,22 +255,41 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
sh = (div (sh, len)).rem;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely (sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
|
||||
for (n = 0; n < len; n++)
|
||||
if (soffset == size && roffset == size)
|
||||
{
|
||||
size_t len1 = sh * size;
|
||||
size_t len2 = (len - sh) * size;
|
||||
memcpy (rptr, sptr + len1, len2);
|
||||
memcpy (rptr + len2, sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
if (n == len - sh - 1)
|
||||
src = sptr;
|
||||
else
|
||||
src += soffset;
|
||||
}
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
|
|
|
|||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_10) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_c10 (gfc_array_c10 * const restrict ret,
|
||||
const gfc_array_c10 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_10 *rptr;
|
||||
GFC_COMPLEX_10 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_10 *sptr;
|
||||
const GFC_COMPLEX_10 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_10);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_10);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_16) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_c16 (gfc_array_c16 * const restrict ret,
|
||||
const gfc_array_c16 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_16 *rptr;
|
||||
GFC_COMPLEX_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_16 *sptr;
|
||||
const GFC_COMPLEX_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_4) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_c4 (gfc_array_c4 * const restrict ret,
|
||||
const gfc_array_c4 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_4 *rptr;
|
||||
GFC_COMPLEX_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_4 *sptr;
|
||||
const GFC_COMPLEX_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_8) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_c8 (gfc_array_c8 * const restrict ret,
|
||||
const gfc_array_c8 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_8 *rptr;
|
||||
GFC_COMPLEX_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_8 *sptr;
|
||||
const GFC_COMPLEX_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_1) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_i1 (gfc_array_i1 * const restrict ret,
|
||||
const gfc_array_i1 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_1 *rptr;
|
||||
GFC_INTEGER_1 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_1 *sptr;
|
||||
const GFC_INTEGER_1 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_1);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_1);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_i16 (gfc_array_i16 * const restrict ret,
|
||||
const gfc_array_i16 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_16 *rptr;
|
||||
GFC_INTEGER_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_16 *sptr;
|
||||
const GFC_INTEGER_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_2) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_i2 (gfc_array_i2 * const restrict ret,
|
||||
const gfc_array_i2 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_2 *rptr;
|
||||
GFC_INTEGER_2 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_2 *sptr;
|
||||
const GFC_INTEGER_2 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_2);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_2);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_i4 (gfc_array_i4 * const restrict ret,
|
||||
const gfc_array_i4 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_4 *rptr;
|
||||
GFC_INTEGER_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_4 *sptr;
|
||||
const GFC_INTEGER_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_i8 (gfc_array_i8 * const restrict ret,
|
||||
const gfc_array_i8 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_8 *rptr;
|
||||
GFC_INTEGER_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_8 *sptr;
|
||||
const GFC_INTEGER_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_10) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_r10 (gfc_array_r10 * const restrict ret,
|
||||
const gfc_array_r10 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_10 *rptr;
|
||||
GFC_REAL_10 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_10 *sptr;
|
||||
const GFC_REAL_10 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_10);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_10);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_16) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_r16 (gfc_array_r16 * const restrict ret,
|
||||
const gfc_array_r16 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_16 *rptr;
|
||||
GFC_REAL_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_16 *sptr;
|
||||
const GFC_REAL_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_4) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_r4 (gfc_array_r4 * const restrict ret,
|
||||
const gfc_array_r4 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_4 *rptr;
|
||||
GFC_REAL_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_4 *sptr;
|
||||
const GFC_REAL_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_8) && defined (HAVE_GFC_INTEGER_4)
|
||||
|
||||
void
|
||||
cshift1_4_r8 (gfc_array_r8 * const restrict ret,
|
||||
const gfc_array_r8 * const restrict array,
|
||||
const gfc_array_i4 * const restrict h,
|
||||
const GFC_INTEGER_4 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_8 *rptr;
|
||||
GFC_REAL_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_8 *sptr;
|
||||
const GFC_REAL_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_4 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_4 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -61,12 +61,13 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
GFC_INTEGER_8 sh;
|
||||
index_type arraysize;
|
||||
index_type size;
|
||||
|
||||
index_type type_size;
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
|
||||
if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
|
||||
runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
|
||||
|
||||
|
|
@ -111,6 +112,98 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
if (arraysize == 0)
|
||||
return;
|
||||
|
||||
/* See if we should dispatch to a helper function. */
|
||||
|
||||
type_size = GFC_DTYPE_TYPE_SIZE (array);
|
||||
|
||||
switch (type_size)
|
||||
{
|
||||
case GFC_DTYPE_LOGICAL_1:
|
||||
case GFC_DTYPE_INTEGER_1:
|
||||
case GFC_DTYPE_DERIVED_1:
|
||||
cshift1_8_i1 ((gfc_array_i1 *)ret, (gfc_array_i1 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_2:
|
||||
case GFC_DTYPE_INTEGER_2:
|
||||
cshift1_8_i2 ((gfc_array_i2 *)ret, (gfc_array_i2 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_4:
|
||||
case GFC_DTYPE_INTEGER_4:
|
||||
cshift1_8_i4 ((gfc_array_i4 *)ret, (gfc_array_i4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_8:
|
||||
case GFC_DTYPE_INTEGER_8:
|
||||
cshift1_8_i8 ((gfc_array_i8 *)ret, (gfc_array_i8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_INTEGER_16)
|
||||
case GFC_DTYPE_LOGICAL_16:
|
||||
case GFC_DTYPE_INTEGER_16:
|
||||
cshift1_8_i16 ((gfc_array_i16 *)ret, (gfc_array_i16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
case GFC_DTYPE_REAL_4:
|
||||
cshift1_8_r4 ((gfc_array_r4 *)ret, (gfc_array_r4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_REAL_8:
|
||||
cshift1_8_r8 ((gfc_array_r8 *)ret, (gfc_array_r8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_REAL_10)
|
||||
case GFC_DTYPE_REAL_10:
|
||||
cshift1_8_r10 ((gfc_array_r10 *)ret, (gfc_array_r10 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_REAL_16)
|
||||
case GFC_DTYPE_REAL_16:
|
||||
cshift1_8_r16 ((gfc_array_r16 *)ret, (gfc_array_r16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
case GFC_DTYPE_COMPLEX_4:
|
||||
cshift1_8_c4 ((gfc_array_c4 *)ret, (gfc_array_c4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_COMPLEX_8:
|
||||
cshift1_8_c8 ((gfc_array_c8 *)ret, (gfc_array_c8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_COMPLEX_10)
|
||||
case GFC_DTYPE_COMPLEX_10:
|
||||
cshift1_8_c10 ((gfc_array_c10 *)ret, (gfc_array_c10 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_COMPLEX_16)
|
||||
case GFC_DTYPE_COMPLEX_16:
|
||||
cshift1_8_c16 ((gfc_array_c16 *)ret, (gfc_array_c16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
default:
|
||||
break;
|
||||
|
||||
}
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
|
@ -162,22 +255,41 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
sh = (div (sh, len)).rem;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely (sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
|
||||
for (n = 0; n < len; n++)
|
||||
if (soffset == size && roffset == size)
|
||||
{
|
||||
size_t len1 = sh * size;
|
||||
size_t len2 = (len - sh) * size;
|
||||
memcpy (rptr, sptr + len1, len2);
|
||||
memcpy (rptr + len2, sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
if (n == len - sh - 1)
|
||||
src = sptr;
|
||||
else
|
||||
src += soffset;
|
||||
}
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
|
|
|
|||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_10) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_c10 (gfc_array_c10 * const restrict ret,
|
||||
const gfc_array_c10 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_10 *rptr;
|
||||
GFC_COMPLEX_10 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_10 *sptr;
|
||||
const GFC_COMPLEX_10 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_10);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_10);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_16) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_c16 (gfc_array_c16 * const restrict ret,
|
||||
const gfc_array_c16 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_16 *rptr;
|
||||
GFC_COMPLEX_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_16 *sptr;
|
||||
const GFC_COMPLEX_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_4) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_c4 (gfc_array_c4 * const restrict ret,
|
||||
const gfc_array_c4 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_4 *rptr;
|
||||
GFC_COMPLEX_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_4 *sptr;
|
||||
const GFC_COMPLEX_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_COMPLEX_8) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_c8 (gfc_array_c8 * const restrict ret,
|
||||
const gfc_array_c8 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_COMPLEX_8 *rptr;
|
||||
GFC_COMPLEX_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_COMPLEX_8 *sptr;
|
||||
const GFC_COMPLEX_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_COMPLEX_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_COMPLEX_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_1) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_i1 (gfc_array_i1 * const restrict ret,
|
||||
const gfc_array_i1 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_1 *rptr;
|
||||
GFC_INTEGER_1 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_1 *sptr;
|
||||
const GFC_INTEGER_1 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_1);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_1);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_i16 (gfc_array_i16 * const restrict ret,
|
||||
const gfc_array_i16 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_16 *rptr;
|
||||
GFC_INTEGER_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_16 *sptr;
|
||||
const GFC_INTEGER_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_2) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_i2 (gfc_array_i2 * const restrict ret,
|
||||
const gfc_array_i2 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_2 *rptr;
|
||||
GFC_INTEGER_2 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_2 *sptr;
|
||||
const GFC_INTEGER_2 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_2);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_2);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_i4 (gfc_array_i4 * const restrict ret,
|
||||
const gfc_array_i4 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_4 *rptr;
|
||||
GFC_INTEGER_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_4 *sptr;
|
||||
const GFC_INTEGER_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_i8 (gfc_array_i8 * const restrict ret,
|
||||
const gfc_array_i8 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_INTEGER_8 *rptr;
|
||||
GFC_INTEGER_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_INTEGER_8 *sptr;
|
||||
const GFC_INTEGER_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_INTEGER_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_INTEGER_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_10) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_r10 (gfc_array_r10 * const restrict ret,
|
||||
const gfc_array_r10 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_10 *rptr;
|
||||
GFC_REAL_10 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_10 *sptr;
|
||||
const GFC_REAL_10 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_10);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_10);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_16) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_r16 (gfc_array_r16 * const restrict ret,
|
||||
const gfc_array_r16 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_16 *rptr;
|
||||
GFC_REAL_16 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_16 *sptr;
|
||||
const GFC_REAL_16 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_16);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_16);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_4) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_r4 (gfc_array_r4 * const restrict ret,
|
||||
const gfc_array_r4 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_4 *rptr;
|
||||
GFC_REAL_4 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_4 *sptr;
|
||||
const GFC_REAL_4 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_4);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_4);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,193 @@
|
|||
/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>
|
||||
|
||||
#if defined (HAVE_GFC_REAL_8) && defined (HAVE_GFC_INTEGER_8)
|
||||
|
||||
void
|
||||
cshift1_8_r8 (gfc_array_r8 * const restrict ret,
|
||||
const gfc_array_r8 * const restrict array,
|
||||
const gfc_array_i8 * const restrict h,
|
||||
const GFC_INTEGER_8 * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
GFC_REAL_8 *rptr;
|
||||
GFC_REAL_8 *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const GFC_REAL_8 *sptr;
|
||||
const GFC_REAL_8 *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const GFC_INTEGER_8 *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
GFC_INTEGER_8 sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof (GFC_REAL_8);
|
||||
size_t len2 = (len - sh) * sizeof (GFC_REAL_8);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -1418,4 +1418,317 @@ void cshift0_c16 (gfc_array_c16 *, const gfc_array_c16 *, ptrdiff_t, int);
|
|||
internal_proto(cshift0_c16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_1)
|
||||
void cshift1_4_i1 (gfc_array_i1 * const restrict,
|
||||
const gfc_array_i1 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_i1);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_2)
|
||||
void cshift1_4_i2 (gfc_array_i2 * const restrict,
|
||||
const gfc_array_i2 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_i2);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_4)
|
||||
void cshift1_4_i4 (gfc_array_i4 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_i4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_8)
|
||||
void cshift1_4_i8 (gfc_array_i8 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_i8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_INTEGER_16)
|
||||
void cshift1_4_i16 (gfc_array_i16 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_i16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_1)
|
||||
void cshift1_8_i1 (gfc_array_i1 * const restrict,
|
||||
const gfc_array_i1 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_i1);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_2)
|
||||
void cshift1_8_i2 (gfc_array_i2 * const restrict,
|
||||
const gfc_array_i2 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_i2);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_4)
|
||||
void cshift1_8_i4 (gfc_array_i4 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_i4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_8)
|
||||
void cshift1_8_i8 (gfc_array_i8 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_i8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_INTEGER_16)
|
||||
void cshift1_8_i16 (gfc_array_i16 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_i16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_INTEGER_1)
|
||||
void cshift1_16_i1 (gfc_array_i1 * const restrict,
|
||||
const gfc_array_i1 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_i1);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_INTEGER_2)
|
||||
void cshift1_16_i2 (gfc_array_i2 * const restrict,
|
||||
const gfc_array_i2 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_i2);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_INTEGER_4)
|
||||
void cshift1_16_i4 (gfc_array_i4 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_i4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_INTEGER_8)
|
||||
void cshift1_16_i8 (gfc_array_i8 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_i8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_INTEGER_16)
|
||||
void cshift1_16_i16 (gfc_array_i16 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_i16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_REAL_4)
|
||||
void cshift1_4_r4 (gfc_array_r4 * const restrict,
|
||||
const gfc_array_r4 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_r4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_REAL_8)
|
||||
void cshift1_4_r8 (gfc_array_r8 * const restrict,
|
||||
const gfc_array_r8 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_r8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_REAL_10)
|
||||
void cshift1_4_r10 (gfc_array_r10 * const restrict,
|
||||
const gfc_array_r10 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_r10);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_REAL_16)
|
||||
void cshift1_4_r16 (gfc_array_r16 * const restrict,
|
||||
const gfc_array_r16 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_r16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_REAL_4)
|
||||
void cshift1_8_r4 (gfc_array_r4 * const restrict,
|
||||
const gfc_array_r4 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_r4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_REAL_8)
|
||||
void cshift1_8_r8 (gfc_array_r8 * const restrict,
|
||||
const gfc_array_r8 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_r8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_REAL_10)
|
||||
void cshift1_8_r10 (gfc_array_r10 * const restrict,
|
||||
const gfc_array_r10 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_r10);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_REAL_16)
|
||||
void cshift1_8_r16 (gfc_array_r16 * const restrict,
|
||||
const gfc_array_r16 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_r16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_REAL_4)
|
||||
void cshift1_16_r4 (gfc_array_r4 * const restrict,
|
||||
const gfc_array_r4 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_r4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_REAL_8)
|
||||
void cshift1_16_r8 (gfc_array_r8 * const restrict,
|
||||
const gfc_array_r8 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_r8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_REAL_10)
|
||||
void cshift1_16_r10 (gfc_array_r10 * const restrict,
|
||||
const gfc_array_r10 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_r10);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_REAL_16)
|
||||
void cshift1_16_r16 (gfc_array_r16 * const restrict,
|
||||
const gfc_array_r16 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_r16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_COMPLEX_4)
|
||||
void cshift1_4_c4 (gfc_array_c4 * const restrict,
|
||||
const gfc_array_c4 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_c4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_COMPLEX_8)
|
||||
void cshift1_4_c8 (gfc_array_c8 * const restrict,
|
||||
const gfc_array_c8 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_c8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_COMPLEX_10)
|
||||
void cshift1_4_c10 (gfc_array_c10 * const restrict,
|
||||
const gfc_array_c10 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_c10);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_4) && defined (HAVE_GFC_COMPLEX_16)
|
||||
void cshift1_4_c16 (gfc_array_c16 * const restrict,
|
||||
const gfc_array_c16 * const restrict,
|
||||
const gfc_array_i4 * const restrict,
|
||||
const GFC_INTEGER_4 * const restrict);
|
||||
internal_proto(cshift1_4_c16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_COMPLEX_4)
|
||||
void cshift1_8_c4 (gfc_array_c4 * const restrict,
|
||||
const gfc_array_c4 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_c4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_COMPLEX_8)
|
||||
void cshift1_8_c8 (gfc_array_c8 * const restrict,
|
||||
const gfc_array_c8 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_c8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_COMPLEX_10)
|
||||
void cshift1_8_c10 (gfc_array_c10 * const restrict,
|
||||
const gfc_array_c10 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_c10);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_8) && defined (HAVE_GFC_COMPLEX_16)
|
||||
void cshift1_8_c16 (gfc_array_c16 * const restrict,
|
||||
const gfc_array_c16 * const restrict,
|
||||
const gfc_array_i8 * const restrict,
|
||||
const GFC_INTEGER_8 * const restrict);
|
||||
internal_proto(cshift1_8_c16);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_COMPLEX_4)
|
||||
void cshift1_16_c4 (gfc_array_c4 * const restrict,
|
||||
const gfc_array_c4 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_c4);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_COMPLEX_8)
|
||||
void cshift1_16_c8 (gfc_array_c8 * const restrict,
|
||||
const gfc_array_c8 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_c8);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_COMPLEX_10)
|
||||
void cshift1_16_c10 (gfc_array_c10 * const restrict,
|
||||
const gfc_array_c10 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_c10);
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_GFC_INTEGER_16) && defined (HAVE_GFC_COMPLEX_16)
|
||||
void cshift1_16_c16 (gfc_array_c16 * const restrict,
|
||||
const gfc_array_c16 * const restrict,
|
||||
const gfc_array_i16 * const restrict,
|
||||
const GFC_INTEGER_16 * const restrict);
|
||||
internal_proto(cshift1_16_c16);
|
||||
#endif
|
||||
|
||||
|
||||
#endif /* LIBGFOR_H */
|
||||
|
|
|
|||
|
|
@ -62,12 +62,13 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
'atype_name` sh;
|
||||
index_type arraysize;
|
||||
index_type size;
|
||||
|
||||
index_type type_size;
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
|
||||
if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
|
||||
runtime_error ("Argument ''`DIM''` is out of range in call to ''`CSHIFT''`");
|
||||
|
||||
|
|
@ -112,6 +113,98 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
if (arraysize == 0)
|
||||
return;
|
||||
|
||||
/* See if we should dispatch to a helper function. */
|
||||
|
||||
type_size = GFC_DTYPE_TYPE_SIZE (array);
|
||||
|
||||
switch (type_size)
|
||||
{
|
||||
case GFC_DTYPE_LOGICAL_1:
|
||||
case GFC_DTYPE_INTEGER_1:
|
||||
case GFC_DTYPE_DERIVED_1:
|
||||
cshift1_'atype_kind`_i1 ((gfc_array_i1 *)ret, (gfc_array_i1 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_2:
|
||||
case GFC_DTYPE_INTEGER_2:
|
||||
cshift1_'atype_kind`_i2 ((gfc_array_i2 *)ret, (gfc_array_i2 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_4:
|
||||
case GFC_DTYPE_INTEGER_4:
|
||||
cshift1_'atype_kind`_i4 ((gfc_array_i4 *)ret, (gfc_array_i4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_LOGICAL_8:
|
||||
case GFC_DTYPE_INTEGER_8:
|
||||
cshift1_'atype_kind`_i8 ((gfc_array_i8 *)ret, (gfc_array_i8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_INTEGER_16)
|
||||
case GFC_DTYPE_LOGICAL_16:
|
||||
case GFC_DTYPE_INTEGER_16:
|
||||
cshift1_'atype_kind`_i16 ((gfc_array_i16 *)ret, (gfc_array_i16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
case GFC_DTYPE_REAL_4:
|
||||
cshift1_'atype_kind`_r4 ((gfc_array_r4 *)ret, (gfc_array_r4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_REAL_8:
|
||||
cshift1_'atype_kind`_r8 ((gfc_array_r8 *)ret, (gfc_array_r8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_REAL_10)
|
||||
case GFC_DTYPE_REAL_10:
|
||||
cshift1_'atype_kind`_r10 ((gfc_array_r10 *)ret, (gfc_array_r10 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_REAL_16)
|
||||
case GFC_DTYPE_REAL_16:
|
||||
cshift1_'atype_kind`_r16 ((gfc_array_r16 *)ret, (gfc_array_r16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
case GFC_DTYPE_COMPLEX_4:
|
||||
cshift1_'atype_kind`_c4 ((gfc_array_c4 *)ret, (gfc_array_c4 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
case GFC_DTYPE_COMPLEX_8:
|
||||
cshift1_'atype_kind`_c8 ((gfc_array_c8 *)ret, (gfc_array_c8 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
|
||||
#if defined (HAVE_COMPLEX_10)
|
||||
case GFC_DTYPE_COMPLEX_10:
|
||||
cshift1_'atype_kind`_c10 ((gfc_array_c10 *)ret, (gfc_array_c10 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
#if defined (HAVE_COMPLEX_16)
|
||||
case GFC_DTYPE_COMPLEX_16:
|
||||
cshift1_'atype_kind`_c16 ((gfc_array_c16 *)ret, (gfc_array_c16 *) array,
|
||||
h, pwhich);
|
||||
return;
|
||||
#endif
|
||||
|
||||
default:
|
||||
break;
|
||||
|
||||
}
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
|
@ -163,22 +256,41 @@ cshift1 (gfc_array_char * const restrict ret,
|
|||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
sh = (div (sh, len)).rem;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely (sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
|
||||
for (n = 0; n < len; n++)
|
||||
if (soffset == size && roffset == size)
|
||||
{
|
||||
size_t len1 = sh * size;
|
||||
size_t len2 = (len - sh) * size;
|
||||
memcpy (rptr, sptr + len1, len2);
|
||||
memcpy (rptr + len2, sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
if (n == len - sh - 1)
|
||||
src = sptr;
|
||||
else
|
||||
src += soffset;
|
||||
}
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
memcpy (dest, src, size);
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
|
|
|
|||
|
|
@ -0,0 +1,194 @@
|
|||
`/* Implementation of the CSHIFT intrinsic.
|
||||
Copyright (C) 2017 Free Software Foundation, Inc.
|
||||
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
||||
|
||||
Libgfortran is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 3 of the License, or (at your option) any later version.
|
||||
|
||||
Libgfortran is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
Under Section 7 of GPL version 3, you are granted additional
|
||||
permissions described in the GCC Runtime Library Exception, version
|
||||
3.1, as published by the Free Software Foundation.
|
||||
|
||||
You should have received a copy of the GNU General Public License and
|
||||
a copy of the GCC Runtime Library Exception along with this program;
|
||||
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
||||
<http://www.gnu.org/licenses/>. */
|
||||
|
||||
#include "libgfortran.h"
|
||||
#include <string.h>'
|
||||
include(iparm.m4)dnl
|
||||
|
||||
`#if defined (HAVE_'atype_name`) && defined (HAVE_'rtype_name`)
|
||||
|
||||
void
|
||||
cshift1'rtype_qual`_'atype_code` ('atype` * const restrict ret,
|
||||
const 'atype` * const restrict array,
|
||||
const 'rtype` * const restrict h,
|
||||
const 'rtype_name` * const restrict pwhich)
|
||||
{
|
||||
/* r.* indicates the return array. */
|
||||
index_type rstride[GFC_MAX_DIMENSIONS];
|
||||
index_type rstride0;
|
||||
index_type roffset;
|
||||
'atype_name` *rptr;
|
||||
'atype_name` *dest;
|
||||
/* s.* indicates the source array. */
|
||||
index_type sstride[GFC_MAX_DIMENSIONS];
|
||||
index_type sstride0;
|
||||
index_type soffset;
|
||||
const 'atype_name` *sptr;
|
||||
const 'atype_name` *src;
|
||||
/* h.* indicates the shift array. */
|
||||
index_type hstride[GFC_MAX_DIMENSIONS];
|
||||
index_type hstride0;
|
||||
const 'rtype_name` *hptr;
|
||||
|
||||
index_type count[GFC_MAX_DIMENSIONS];
|
||||
index_type extent[GFC_MAX_DIMENSIONS];
|
||||
index_type rs_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type ss_ex[GFC_MAX_DIMENSIONS];
|
||||
index_type hs_ex[GFC_MAX_DIMENSIONS];
|
||||
|
||||
index_type dim;
|
||||
index_type len;
|
||||
index_type n;
|
||||
int which;
|
||||
'rtype_name` sh;
|
||||
|
||||
/* Bounds checking etc is already done by the caller. */
|
||||
|
||||
if (pwhich)
|
||||
which = *pwhich - 1;
|
||||
else
|
||||
which = 0;
|
||||
|
||||
extent[0] = 1;
|
||||
count[0] = 0;
|
||||
n = 0;
|
||||
|
||||
/* Initialized for avoiding compiler warnings. */
|
||||
roffset = 1;
|
||||
soffset = 1;
|
||||
len = 0;
|
||||
|
||||
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
||||
{
|
||||
if (dim == which)
|
||||
{
|
||||
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
if (roffset == 0)
|
||||
roffset = 1;
|
||||
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
if (soffset == 0)
|
||||
soffset = 1;
|
||||
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n] = 0;
|
||||
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
||||
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
||||
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
||||
hstride[n] = GFC_DESCRIPTOR_STRIDE(h,n);
|
||||
rs_ex[n] = rstride[n] * extent[n];
|
||||
ss_ex[n] = sstride[n] * extent[n];
|
||||
hs_ex[n] = hstride[n] * extent[n];
|
||||
n++;
|
||||
}
|
||||
}
|
||||
if (sstride[0] == 0)
|
||||
sstride[0] = 1;
|
||||
if (rstride[0] == 0)
|
||||
rstride[0] = 1;
|
||||
if (hstride[0] == 0)
|
||||
hstride[0] = 1;
|
||||
|
||||
dim = GFC_DESCRIPTOR_RANK (array);
|
||||
rstride0 = rstride[0];
|
||||
sstride0 = sstride[0];
|
||||
hstride0 = hstride[0];
|
||||
rptr = ret->base_addr;
|
||||
sptr = array->base_addr;
|
||||
hptr = h->base_addr;
|
||||
|
||||
while (rptr)
|
||||
{
|
||||
/* Do the shift for this dimension. */
|
||||
sh = *hptr;
|
||||
/* Normal case should be -len < sh < len; try to
|
||||
avoid the expensive remainder operation if possible. */
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
if (unlikely(sh >= len || sh < 0))
|
||||
{
|
||||
sh = sh % len;
|
||||
if (sh < 0)
|
||||
sh += len;
|
||||
}
|
||||
src = &sptr[sh * soffset];
|
||||
dest = rptr;
|
||||
if (soffset == 1 && roffset == 1)
|
||||
{
|
||||
size_t len1 = sh * sizeof ('atype_name`);
|
||||
size_t len2 = (len - sh) * sizeof ('atype_name`);
|
||||
memcpy (rptr, sptr + sh, len2);
|
||||
memcpy (rptr + (len - sh), sptr, len1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (n = 0; n < len - sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
for (src = sptr, n = 0; n < sh; n++)
|
||||
{
|
||||
*dest = *src;
|
||||
dest += roffset;
|
||||
src += soffset;
|
||||
}
|
||||
}
|
||||
|
||||
/* Advance to the next section. */
|
||||
rptr += rstride0;
|
||||
sptr += sstride0;
|
||||
hptr += hstride0;
|
||||
count[0]++;
|
||||
n = 0;
|
||||
while (count[n] == extent[n])
|
||||
{
|
||||
/* When we get to the end of a dimension, reset it and increment
|
||||
the next dimension. */
|
||||
count[n] = 0;
|
||||
rptr -= rs_ex[n];
|
||||
sptr -= ss_ex[n];
|
||||
hptr -= hs_ex[n];
|
||||
n++;
|
||||
if (n >= dim - 1)
|
||||
{
|
||||
/* Break out of the loop. */
|
||||
rptr = NULL;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
count[n]++;
|
||||
rptr += rstride[n];
|
||||
sptr += sstride[n];
|
||||
hptr += hstride[n];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif'
|
||||
Loading…
Reference in New Issue