-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdswap.f
97 lines (97 loc) · 2.72 KB
/
dswap.f
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
subroutine dswap(n,dx,incx,dy,incy)
c***begin prologue dswap
c***date written 791001 (yymmdd)
c***revision date 820801 (yymmdd)
c***category no. d1a5
c***keywords blas,double precision,interchange,linear algebra,vector
c***author lawson, c. l., (jpl)
c hanson, r. j., (snla)
c kincaid, d. r., (u. of texas)
c krogh, f. t., (jpl)
c***purpose interchange d.p. vectors
c***description
c
c b l a s subprogram
c description of parameters
c
c --input--
c n number of elements in input vector(s)
c dx double precision vector with n elements
c incx storage spacing between elements of dx
c dy double precision vector with n elements
c incy storage spacing between elements of dy
c
c --output--
c dx input vector dy (unchanged if n .le. 0)
c dy input vector dx (unchanged if n .le. 0)
c
c interchange double precision dx and double precision dy.
c for i = 0 to n-1, interchange dx(lx+i*incx) and dy(ly+i*incy),
c where lx = 1 if incx .ge. 0, else lx = (-incx)*n, and ly is
c defined in a similar way using incy.
c***references lawson c.l., hanson r.j., kincaid d.r., krogh f.t.,
c *basic linear algebra subprograms for fortran usage*,
c algorithm no. 539, transactions on mathematical
c software, volume 5, number 3, september 1979, 308-323
c***routines called (none)
c***end prologue dswap
c
double precision dx(1),dy(1),dtemp1,dtemp2,dtemp3
c***first executable statement dswap
if(n.le.0)return
if(incx.eq.incy) if(incx-1) 5,20,60
5 continue
c
c code for unequal or nonpositive increments.
c
ix = 1
iy = 1
if(incx.lt.0)ix = (-n+1)*incx + 1
if(incy.lt.0)iy = (-n+1)*incy + 1
do 10 i = 1,n
dtemp1 = dx(ix)
dx(ix) = dy(iy)
dy(iy) = dtemp1
ix = ix + incx
iy = iy + incy
10 continue
return
c
c code for both increments equal to 1
c
c
c clean-up loop so remaining vector length is a multiple of 3.
c
20 m = mod(n,3)
if( m .eq. 0 ) go to 40
do 30 i = 1,m
dtemp1 = dx(i)
dx(i) = dy(i)
dy(i) = dtemp1
30 continue
if( n .lt. 3 ) return
40 mp1 = m + 1
do 50 i = mp1,n,3
dtemp1 = dx(i)
dtemp2 = dx(i+1)
dtemp3 = dx(i+2)
dx(i) = dy(i)
dx(i+1) = dy(i+1)
dx(i+2) = dy(i+2)
dy(i) = dtemp1
dy(i+1) = dtemp2
dy(i+2) = dtemp3
50 continue
return
60 continue
c
c code for equal, positive, nonunit increments.
c
ns = n*incx
do 70 i=1,ns,incx
dtemp1 = dx(i)
dx(i) = dy(i)
dy(i) = dtemp1
70 continue
return
end