/* clacrt.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"
#include "blaswrap.h"
/* Subroutine */ int clacrt_(integer *n, complex *cx, integer *incx, complex *
cy, integer *incy, complex *c__, complex *s)
{
/* System generated locals */
integer i__1, i__2, i__3, i__4;
complex q__1, q__2, q__3;
/* Local variables */
integer i__, ix, iy;
complex ctemp;
/* -- LAPACK auxiliary routine (version 3.2) -- */
/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
/* November 2006 */
/* .. Scalar Arguments .. */
/* .. */
/* .. Array Arguments .. */
/* .. */
/* Purpose */
/* ======= */
/* CLACRT performs the operation */
/* ( c s )( x ) ==> ( x ) */
/* ( -s c )( y ) ( y ) */
/* where c and s are complex and the vectors x and y are complex. */
/* Arguments */
/* ========= */
/* N (input) INTEGER */
/* The number of elements in the vectors CX and CY. */
/* CX (input/output) COMPLEX array, dimension (N) */
/* On input, the vector x. */
/* On output, CX is overwritten with c*x + s*y. */
/* INCX (input) INTEGER */
/* The increment between successive values of CX. INCX <> 0. */
/* CY (input/output) COMPLEX array, dimension (N) */
/* On input, the vector y. */
/* On output, CY is overwritten with -s*x + c*y. */
/* INCY (input) INTEGER */
/* The increment between successive values of CY. INCY <> 0. */
/* C (input) COMPLEX */
/* S (input) COMPLEX */
/* C and S define the matrix */
/* [ C S ]. */
/* [ -S C ] */
/* ===================================================================== */
/* .. Local Scalars .. */
/* .. */
/* .. Executable Statements .. */
/* 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;
q__2.r = c__->r * cx[i__2].r - c__->i * cx[i__2].i, q__2.i = c__->r *
cx[i__2].i + c__->i * cx[i__2].r;
i__3 = iy;
q__3.r = s->r * cy[i__3].r - s->i * cy[i__3].i, q__3.i = s->r * cy[
i__3].i + s->i * cy[i__3].r;
q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
ctemp.r = q__1.r, ctemp.i = q__1.i;
i__2 = iy;
i__3 = iy;
q__2.r = c__->r * cy[i__3].r - c__->i * cy[i__3].i, q__2.i = c__->r *
cy[i__3].i + c__->i * cy[i__3].r;
i__4 = ix;
q__3.r = s->r * cx[i__4].r - s->i * cx[i__4].i, q__3.i = s->r * cx[
i__4].i + s->i * cx[i__4].r;
q__1.r = q__2.r - q__3.r, q__1.i = q__2.i - q__3.i;
cy[i__2].r = q__1.r, cy[i__2].i = q__1.i;
i__2 = ix;
cx[i__2].r = ctemp.r, cx[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__;
q__2.r = c__->r * cx[i__2].r - c__->i * cx[i__2].i, q__2.i = c__->r *
cx[i__2].i + c__->i * cx[i__2].r;
i__3 = i__;
q__3.r = s->r * cy[i__3].r - s->i * cy[i__3].i, q__3.i = s->r * cy[
i__3].i + s->i * cy[i__3].r;
q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
ctemp.r = q__1.r, ctemp.i = q__1.i;
i__2 = i__;
i__3 = i__;
q__2.r = c__->r * cy[i__3].r - c__->i * cy[i__3].i, q__2.i = c__->r *
cy[i__3].i + c__->i * cy[i__3].r;
i__4 = i__;
q__3.r = s->r * cx[i__4].r - s->i * cx[i__4].i, q__3.i = s->r * cx[
i__4].i + s->i * cx[i__4].r;
q__1.r = q__2.r - q__3.r, q__1.i = q__2.i - q__3.i;
cy[i__2].r = q__1.r, cy[i__2].i = q__1.i;
i__2 = i__;
cx[i__2].r = ctemp.r, cx[i__2].i = ctemp.i;
/* L30: */
}
return 0;
} /* clacrt_ */
