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
|
/* blas/srot.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 srot (n,sx,incx,sy,incy,c,s) >*/
/* Subroutine */ int srot_(integer *n, real *sx, integer *incx, real *sy,
integer *incy, real *c__, real *s)
{
/* System generated locals */
integer i__1;
/* Local variables */
integer i__, ix, iy;
real stemp;
/* applies a plane rotation. */
/* jack dongarra, linpack, 3/11/78. */
/* modified 12/3/93, array(1) declarations changed to array(*) */
/*< real sx(*),sy(*),stemp,c,s >*/
/*< integer i,incx,incy,ix,iy,n >*/
/*< if(n.le.0)return >*/
/* Parameter adjustments */
--sy;
--sx;
/* Function Body */
if (*n <= 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__) {
/*< stemp = c*sx(ix) + s*sy(iy) >*/
stemp = *c__ * sx[ix] + *s * sy[iy];
/*< sy(iy) = c*sy(iy) - s*sx(ix) >*/
sy[iy] = *c__ * sy[iy] - *s * sx[ix];
/*< sx(ix) = stemp >*/
sx[ix] = stemp;
/*< ix = ix + incx >*/
ix += *incx;
/*< iy = iy + incy >*/
iy += *incy;
/*< 10 continue >*/
/* L10: */
}
/*< return >*/
return 0;
/* code for both increments equal to 1 */
/*< 20 do 30 i = 1,n >*/
L20:
i__1 = *n;
for (i__ = 1; i__ <= i__1; ++i__) {
/*< stemp = c*sx(i) + s*sy(i) >*/
stemp = *c__ * sx[i__] + *s * sy[i__];
/*< sy(i) = c*sy(i) - s*sx(i) >*/
sy[i__] = *c__ * sy[i__] - *s * sx[i__];
/*< sx(i) = stemp >*/
sx[i__] = stemp;
/*< 30 continue >*/
/* L30: */
}
/*< return >*/
return 0;
/*< end >*/
} /* srot_ */
#ifdef __cplusplus
}
#endif
|
