81 lines
1.6 KiB
C
81 lines
1.6 KiB
C
#include "f2c.h"
|
|
/*#include "blaswrap.h"*/
|
|
|
|
/* Subroutine */ int cswap_(integer *n, complex *cx, integer *incx, complex *
|
|
cy, integer *incy)
|
|
{
|
|
/* System generated locals */
|
|
integer i__1, i__2, i__3;
|
|
|
|
/* Local variables */
|
|
integer i__, ix, iy;
|
|
complex ctemp;
|
|
|
|
/* .. Scalar Arguments .. */
|
|
/* .. */
|
|
/* .. Array Arguments .. */
|
|
/* .. */
|
|
|
|
/* Purpose */
|
|
/* ======= */
|
|
|
|
/* interchanges two vectors. */
|
|
/* jack dongarra, linpack, 3/11/78. */
|
|
/* modified 12/3/93, array(1) declarations changed to array(*) */
|
|
|
|
|
|
/* .. Local Scalars .. */
|
|
/* .. */
|
|
/* Parameter adjustments */
|
|
--cy;
|
|
--cx;
|
|
|
|
/* Function Body */
|
|
if (*n <= 0) {
|
|
return 0;
|
|
}
|
|
if (*incx == 1 && *incy == 1) {
|
|
goto L20;
|
|
}
|
|
|
|
/* code for unequal increments or equal increments not equal */
|
|
/* to 1 */
|
|
|
|
ix = 1;
|
|
iy = 1;
|
|
if (*incx < 0) {
|
|
ix = (-(*n) + 1) * *incx + 1;
|
|
}
|
|
if (*incy < 0) {
|
|
iy = (-(*n) + 1) * *incy + 1;
|
|
}
|
|
i__1 = *n;
|
|
for (i__ = 1; i__ <= i__1; ++i__) {
|
|
i__2 = ix;
|
|
ctemp.r = cx[i__2].r, ctemp.i = cx[i__2].i;
|
|
i__2 = ix;
|
|
i__3 = iy;
|
|
cx[i__2].r = cy[i__3].r, cx[i__2].i = cy[i__3].i;
|
|
i__2 = iy;
|
|
cy[i__2].r = ctemp.r, cy[i__2].i = ctemp.i;
|
|
ix += *incx;
|
|
iy += *incy;
|
|
/* L10: */
|
|
}
|
|
return 0;
|
|
|
|
/* code for both increments equal to 1 */
|
|
L20:
|
|
i__1 = *n;
|
|
for (i__ = 1; i__ <= i__1; ++i__) {
|
|
i__2 = i__;
|
|
ctemp.r = cx[i__2].r, ctemp.i = cx[i__2].i;
|
|
i__2 = i__;
|
|
i__3 = i__;
|
|
cx[i__2].r = cy[i__3].r, cx[i__2].i = cy[i__3].i;
|
|
i__2 = i__;
|
|
cy[i__2].r = ctemp.r, cy[i__2].i = ctemp.i;
|
|
/* L30: */
|
|
}
|
|
return 0;
|
|
} /* cswap_ */
|