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
|
/* ../blas/src/cscal.f -- translated by f2c (version 20061008).
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
*/
#include "f2c.h"
/* Subroutine */ int REF_cscal_(integer *n, complex *ca, complex *cx, integer *
incx)
{
/* System generated locals */
integer i__1, i__2, i__3, i__4;
complex q__1;
/* Local variables */
static integer i__, nincx;
/* scales a vector by a constant. */
/* jack dongarra, linpack, 3/11/78. */
/* modified 3/93 to return if incx .le. 0. */
/* modified 12/3/93, array(1) declarations changed to array(*) */
/* Parameter adjustments */
--cx;
/* Function Body */
if (*n <= 0 || *incx <= 0) {
return 0;
}
if (*incx == 1) {
goto L20;
}
/* code for increment not equal to 1 */
nincx = *n * *incx;
i__1 = nincx;
i__2 = *incx;
for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
i__3 = i__;
i__4 = i__;
q__1.r = ca->r * cx[i__4].r - ca->i * cx[i__4].i, q__1.i = ca->r * cx[
i__4].i + ca->i * cx[i__4].r;
cx[i__3].r = q__1.r, cx[i__3].i = q__1.i;
/* L10: */
}
return 0;
/* code for increment equal to 1 */
L20:
i__2 = *n;
for (i__ = 1; i__ <= i__2; ++i__) {
i__1 = i__;
i__3 = i__;
q__1.r = ca->r * cx[i__3].r - ca->i * cx[i__3].i, q__1.i = ca->r * cx[
i__3].i + ca->i * cx[i__3].r;
cx[i__1].r = q__1.r, cx[i__1].i = q__1.i;
/* L30: */
}
return 0;
} /* cscal_ */
|
