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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/* blas/daxpy.f -- translated by f2c (version 20050501).
You must link the resulting object file with libf2c:
on Microsoft Windows system, link with libf2c.lib;
on Linux or Unix systems, link with .../path/to/libf2c.a -lm
or, if you install libf2c.a in a standard place, with -lf2c -lm
-- in that order, at the end of the command line, as in
cc *.o -lf2c -lm
Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
http://www.netlib.org/f2c/libf2c.zip
*/
#ifdef __cplusplus
extern "C" {
#endif
#include "v3p_netlib.h"
/*< subroutine daxpy(n,da,dx,incx,dy,incy) >*/
/* Subroutine */ int daxpy_(integer *n, doublereal *da, doublereal *dx,
integer *incx, doublereal *dy, integer *incy)
{
/* System generated locals */
integer i__1;
/* Local variables */
integer i__, m, ix, iy, mp1;
/* constant times a vector plus a vector. */
/* uses unrolled loops for increments equal to one. */
/* jack dongarra, linpack, 3/11/78. */
/* modified 12/3/93, array(1) declarations changed to array(*) */
/*< double precision dx(*),dy(*),da >*/
/*< integer i,incx,incy,ix,iy,m,mp1,n >*/
/*< if(n.le.0)return >*/
/* Parameter adjustments */
--dy;
--dx;
/* Function Body */
if (*n <= 0) {
return 0;
}
/*< if (da .eq. 0.0d0) return >*/
if (*da == 0.) {
return 0;
}
/*< if(incx.eq.1.and.incy.eq.1)go to 20 >*/
if (*incx == 1 && *incy == 1) {
goto L20;
}
/* code for unequal increments or equal increments */
/* not equal to 1 */
/*< ix = 1 >*/
ix = 1;
/*< iy = 1 >*/
iy = 1;
/*< if(incx.lt.0)ix = (-n+1)*incx + 1 >*/
if (*incx < 0) {
ix = (-(*n) + 1) * *incx + 1;
}
/*< if(incy.lt.0)iy = (-n+1)*incy + 1 >*/
if (*incy < 0) {
iy = (-(*n) + 1) * *incy + 1;
}
/*< do 10 i = 1,n >*/
i__1 = *n;
for (i__ = 1; i__ <= i__1; ++i__) {
/*< dy(iy) = dy(iy) + da*dx(ix) >*/
dy[iy] += *da * dx[ix];
/*< ix = ix + incx >*/
ix += *incx;
/*< iy = iy + incy >*/
iy += *incy;
/*< 10 continue >*/
/* L10: */
}
/*< return >*/
return 0;
/* code for both increments equal to 1 */
/* clean-up loop */
/*< 20 m = mod(n,4) >*/
L20:
m = *n % 4;
/*< if( m .eq. 0 ) go to 40 >*/
if (m == 0) {
goto L40;
}
/*< do 30 i = 1,m >*/
i__1 = m;
for (i__ = 1; i__ <= i__1; ++i__) {
/*< dy(i) = dy(i) + da*dx(i) >*/
dy[i__] += *da * dx[i__];
/*< 30 continue >*/
/* L30: */
}
/*< if( n .lt. 4 ) return >*/
if (*n < 4) {
return 0;
}
/*< 40 mp1 = m + 1 >*/
L40:
mp1 = m + 1;
/*< do 50 i = mp1,n,4 >*/
i__1 = *n;
for (i__ = mp1; i__ <= i__1; i__ += 4) {
/*< dy(i) = dy(i) + da*dx(i) >*/
dy[i__] += *da * dx[i__];
/*< dy(i + 1) = dy(i + 1) + da*dx(i + 1) >*/
dy[i__ + 1] += *da * dx[i__ + 1];
/*< dy(i + 2) = dy(i + 2) + da*dx(i + 2) >*/
dy[i__ + 2] += *da * dx[i__ + 2];
/*< dy(i + 3) = dy(i + 3) + da*dx(i + 3) >*/
dy[i__ + 3] += *da * dx[i__ + 3];
/*< 50 continue >*/
/* L50: */
}
/*< return >*/
return 0;
/*< end >*/
} /* daxpy_ */
#ifdef __cplusplus
}
#endif
|
