14 typedef long long BLASLONG;
15 typedef unsigned long long BLASULONG;
17 typedef long BLASLONG;
18 typedef unsigned long BLASULONG;
22 typedef BLASLONG blasint;
24 #define blasabs(x) llabs(x)
26 #define blasabs(x) labs(x)
30 #define blasabs(x) abs(x)
33 typedef blasint integer;
35 typedef unsigned int uinteger;
36 typedef char *address;
37 typedef short int shortint;
39 typedef double doublereal;
40 typedef struct { real r, i; } complex;
41 typedef struct { doublereal r, i; } doublecomplex;
43 static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
44 static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
45 static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
46 static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
48 static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
49 static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
50 static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
51 static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
53 #define pCf(z) (*_pCf(z))
54 #define pCd(z) (*_pCd(z))
56 typedef short int shortlogical;
57 typedef char logical1;
58 typedef char integer1;
63 /* Extern is for use with -E */
74 /*external read, write*/
83 /*internal read, write*/
113 /*rewind, backspace, endfile*/
125 ftnint *inex; /*parameters in standard's order*/
151 union Multitype { /* for multiple entry points */
162 typedef union Multitype Multitype;
164 struct Vardesc { /* for Namelist */
170 typedef struct Vardesc Vardesc;
177 typedef struct Namelist Namelist;
179 #define abs(x) ((x) >= 0 ? (x) : -(x))
180 #define dabs(x) (fabs(x))
181 #define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
182 #define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
183 #define dmin(a,b) (f2cmin(a,b))
184 #define dmax(a,b) (f2cmax(a,b))
185 #define bit_test(a,b) ((a) >> (b) & 1)
186 #define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
187 #define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
189 #define abort_() { sig_die("Fortran abort routine called", 1); }
190 #define c_abs(z) (cabsf(Cf(z)))
191 #define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
193 #define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
194 #define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
196 #define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
197 #define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
199 #define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
200 #define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
201 #define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
202 //#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
203 #define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
204 #define d_abs(x) (fabs(*(x)))
205 #define d_acos(x) (acos(*(x)))
206 #define d_asin(x) (asin(*(x)))
207 #define d_atan(x) (atan(*(x)))
208 #define d_atn2(x, y) (atan2(*(x),*(y)))
209 #define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
210 #define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
211 #define d_cos(x) (cos(*(x)))
212 #define d_cosh(x) (cosh(*(x)))
213 #define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
214 #define d_exp(x) (exp(*(x)))
215 #define d_imag(z) (cimag(Cd(z)))
216 #define r_imag(z) (cimagf(Cf(z)))
217 #define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
218 #define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
219 #define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
220 #define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
221 #define d_log(x) (log(*(x)))
222 #define d_mod(x, y) (fmod(*(x), *(y)))
223 #define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
224 #define d_nint(x) u_nint(*(x))
225 #define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
226 #define d_sign(a,b) u_sign(*(a),*(b))
227 #define r_sign(a,b) u_sign(*(a),*(b))
228 #define d_sin(x) (sin(*(x)))
229 #define d_sinh(x) (sinh(*(x)))
230 #define d_sqrt(x) (sqrt(*(x)))
231 #define d_tan(x) (tan(*(x)))
232 #define d_tanh(x) (tanh(*(x)))
233 #define i_abs(x) abs(*(x))
234 #define i_dnnt(x) ((integer)u_nint(*(x)))
235 #define i_len(s, n) (n)
236 #define i_nint(x) ((integer)u_nint(*(x)))
237 #define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
238 #define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
239 #define pow_si(B,E) spow_ui(*(B),*(E))
240 #define pow_ri(B,E) spow_ui(*(B),*(E))
241 #define pow_di(B,E) dpow_ui(*(B),*(E))
242 #define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
243 #define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
244 #define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
245 #define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
246 #define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
247 #define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
248 #define sig_die(s, kill) { exit(1); }
249 #define s_stop(s, n) {exit(0);}
250 static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
251 #define z_abs(z) (cabs(Cd(z)))
252 #define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
253 #define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
254 #define myexit_() break;
255 #define mycycle() continue;
256 #define myceiling(w) {ceil(w)}
257 #define myhuge(w) {HUGE_VAL}
258 //#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
259 #define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
261 /* procedure parameter types for -A and -C++ */
263 #define F2C_proc_par_types 1
265 typedef logical (*L_fp)(...);
267 typedef logical (*L_fp)();
270 static float spow_ui(float x, integer n) {
271 float pow=1.0; unsigned long int u;
273 if(n < 0) n = -n, x = 1/x;
282 static double dpow_ui(double x, integer n) {
283 double pow=1.0; unsigned long int u;
285 if(n < 0) n = -n, x = 1/x;
295 static _Fcomplex cpow_ui(complex x, integer n) {
296 complex pow={1.0,0.0}; unsigned long int u;
298 if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
300 if(u & 01) pow.r *= x.r, pow.i *= x.i;
301 if(u >>= 1) x.r *= x.r, x.i *= x.i;
305 _Fcomplex p={pow.r, pow.i};
309 static _Complex float cpow_ui(_Complex float x, integer n) {
310 _Complex float pow=1.0; unsigned long int u;
312 if(n < 0) n = -n, x = 1/x;
323 static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
324 _Dcomplex pow={1.0,0.0}; unsigned long int u;
326 if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
328 if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
329 if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
333 _Dcomplex p = {pow._Val[0], pow._Val[1]};
337 static _Complex double zpow_ui(_Complex double x, integer n) {
338 _Complex double pow=1.0; unsigned long int u;
340 if(n < 0) n = -n, x = 1/x;
350 static integer pow_ii(integer x, integer n) {
351 integer pow; unsigned long int u;
353 if (n == 0 || x == 1) pow = 1;
354 else if (x != -1) pow = x == 0 ? 1/x : 0;
357 if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
367 static integer dmaxloc_(double *w, integer s, integer e, integer *n)
369 double m; integer i, mi;
370 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
371 if (w[i-1]>m) mi=i ,m=w[i-1];
374 static integer smaxloc_(float *w, integer s, integer e, integer *n)
376 float m; integer i, mi;
377 for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
378 if (w[i-1]>m) mi=i ,m=w[i-1];
381 static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
382 integer n = *n_, incx = *incx_, incy = *incy_, i;
384 _Fcomplex zdotc = {0.0, 0.0};
385 if (incx == 1 && incy == 1) {
386 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
387 zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
388 zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
391 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
392 zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
393 zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
399 _Complex float zdotc = 0.0;
400 if (incx == 1 && incy == 1) {
401 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
402 zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
405 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
406 zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
412 static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
413 integer n = *n_, incx = *incx_, incy = *incy_, i;
415 _Dcomplex zdotc = {0.0, 0.0};
416 if (incx == 1 && incy == 1) {
417 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
418 zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
419 zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
422 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
423 zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
424 zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
430 _Complex double zdotc = 0.0;
431 if (incx == 1 && incy == 1) {
432 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
433 zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
436 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
437 zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
443 static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
444 integer n = *n_, incx = *incx_, incy = *incy_, i;
446 _Fcomplex zdotc = {0.0, 0.0};
447 if (incx == 1 && incy == 1) {
448 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
449 zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
450 zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
453 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
454 zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
455 zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
461 _Complex float zdotc = 0.0;
462 if (incx == 1 && incy == 1) {
463 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
464 zdotc += Cf(&x[i]) * Cf(&y[i]);
467 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
468 zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
474 static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
475 integer n = *n_, incx = *incx_, incy = *incy_, i;
477 _Dcomplex zdotc = {0.0, 0.0};
478 if (incx == 1 && incy == 1) {
479 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
480 zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
481 zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
484 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
485 zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
486 zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
492 _Complex double zdotc = 0.0;
493 if (incx == 1 && incy == 1) {
494 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
495 zdotc += Cd(&x[i]) * Cd(&y[i]);
498 for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
499 zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
505 /* -- translated by f2c (version 20000121).
506 You must link the resulting object file with the libraries:
507 -lf2c -lm (in that order)
513 /* Table of constant values */
515 static integer c__4 = 4;
516 static integer c__8 = 8;
518 /* > \brief \b CLAROT */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
528 /* SUBROUTINE CLAROT( LROWS, LLEFT, LRIGHT, NL, C, S, A, LDA, XLEFT, */
531 /* LOGICAL LLEFT, LRIGHT, LROWS */
532 /* INTEGER LDA, NL */
533 /* COMPLEX C, S, XLEFT, XRIGHT */
537 /* > \par Purpose: */
542 /* > CLAROT applies a (Givens) rotation to two adjacent rows or */
543 /* > columns, where one element of the first and/or last column/row */
544 /* > for use on matrices stored in some format other than GE, so */
545 /* > that elements of the matrix may be used or modified for which */
546 /* > no array element is provided. */
548 /* > One example is a symmetric matrix in SB format (bandwidth=4), for */
549 /* > which UPLO='L': Two adjacent rows will have the format: */
551 /* > row j: C> C> C> C> C> . . . . */
552 /* > row j+1: C> C> C> C> C> . . . . */
554 /* > '*' indicates elements for which storage is provided, */
555 /* > '.' indicates elements for which no storage is provided, but */
556 /* > are not necessarily zero; their values are determined by */
557 /* > symmetry. ' ' indicates elements which are necessarily zero, */
558 /* > and have no storage provided. */
560 /* > Those columns which have two '*'s can be handled by SROT. */
561 /* > Those columns which have no '*'s can be ignored, since as long */
562 /* > as the Givens rotations are carefully applied to preserve */
563 /* > symmetry, their values are determined. */
564 /* > Those columns which have one '*' have to be handled separately, */
565 /* > by using separate variables "p" and "q": */
567 /* > row j: C> C> C> C> C> p . . . */
568 /* > row j+1: q C> C> C> C> C> . . . . */
570 /* > The element p would have to be set correctly, then that column */
571 /* > is rotated, setting p to its new value. The next call to */
572 /* > CLAROT would rotate columns j and j+1, using p, and restore */
573 /* > symmetry. The element q would start out being zero, and be */
574 /* > made non-zero by the rotation. Later, rotations would presumably */
575 /* > be chosen to zero q out. */
577 /* > Typical Calling Sequences: rotating the i-th and (i+1)-st rows. */
578 /* > ------- ------- --------- */
580 /* > General dense matrix: */
582 /* > CALL CLAROT(.TRUE.,.FALSE.,.FALSE., N, C,S, */
583 /* > A(i,1),LDA, DUMMY, DUMMY) */
585 /* > General banded matrix in GB format: */
587 /* > j = MAX(1, i-KL ) */
588 /* > NL = MIN( N, i+KU+1 ) + 1-j */
589 /* > CALL CLAROT( .TRUE., i-KL.GE.1, i+KU.LT.N, NL, C,S, */
590 /* > A(KU+i+1-j,j),LDA-1, XLEFT, XRIGHT ) */
592 /* > [ note that i+1-j is just MIN(i,KL+1) ] */
594 /* > Symmetric banded matrix in SY format, bandwidth K, */
595 /* > lower triangle only: */
597 /* > j = MAX(1, i-K ) */
598 /* > NL = MIN( K+1, i ) + 1 */
599 /* > CALL CLAROT( .TRUE., i-K.GE.1, .TRUE., NL, C,S, */
600 /* > A(i,j), LDA, XLEFT, XRIGHT ) */
602 /* > Same, but upper triangle only: */
604 /* > NL = MIN( K+1, N-i ) + 1 */
605 /* > CALL CLAROT( .TRUE., .TRUE., i+K.LT.N, NL, C,S, */
606 /* > A(i,i), LDA, XLEFT, XRIGHT ) */
608 /* > Symmetric banded matrix in SB format, bandwidth K, */
609 /* > lower triangle only: */
611 /* > [ same as for SY, except:] */
613 /* > A(i+1-j,j), LDA-1, XLEFT, XRIGHT ) */
615 /* > [ note that i+1-j is just MIN(i,K+1) ] */
617 /* > Same, but upper triangle only: */
619 /* > A(K+1,i), LDA-1, XLEFT, XRIGHT ) */
621 /* > Rotating columns is just the transpose of rotating rows, except */
622 /* > for GB and SB: (rotating columns i and i+1) */
625 /* > j = MAX(1, i-KU ) */
626 /* > NL = MIN( N, i+KL+1 ) + 1-j */
627 /* > CALL CLAROT( .TRUE., i-KU.GE.1, i+KL.LT.N, NL, C,S, */
628 /* > A(KU+j+1-i,i),LDA-1, XTOP, XBOTTM ) */
630 /* > [note that KU+j+1-i is just MAX(1,KU+2-i)] */
632 /* > SB: (upper triangle) */
635 /* > A(K+j+1-i,i),LDA-1, XTOP, XBOTTM ) */
637 /* > SB: (lower triangle) */
640 /* > A(1,i),LDA-1, XTOP, XBOTTM ) */
647 /* > LROWS - LOGICAL */
648 /* > If .TRUE., then CLAROT will rotate two rows. If .FALSE., */
649 /* > then it will rotate two columns. */
650 /* > Not modified. */
652 /* > LLEFT - LOGICAL */
653 /* > If .TRUE., then XLEFT will be used instead of the */
654 /* > corresponding element of A for the first element in the */
655 /* > second row (if LROWS=.FALSE.) or column (if LROWS=.TRUE.) */
656 /* > If .FALSE., then the corresponding element of A will be */
658 /* > Not modified. */
660 /* > LRIGHT - LOGICAL */
661 /* > If .TRUE., then XRIGHT will be used instead of the */
662 /* > corresponding element of A for the last element in the */
663 /* > first row (if LROWS=.FALSE.) or column (if LROWS=.TRUE.) If */
664 /* > .FALSE., then the corresponding element of A will be used. */
665 /* > Not modified. */
668 /* > The length of the rows (if LROWS=.TRUE.) or columns (if */
669 /* > LROWS=.FALSE.) to be rotated. If XLEFT and/or XRIGHT are */
670 /* > used, the columns/rows they are in should be included in */
671 /* > NL, e.g., if LLEFT = LRIGHT = .TRUE., then NL must be at */
672 /* > least 2. The number of rows/columns to be rotated */
673 /* > exclusive of those involving XLEFT and/or XRIGHT may */
674 /* > not be negative, i.e., NL minus how many of LLEFT and */
675 /* > LRIGHT are .TRUE. must be at least zero; if not, XERBLA */
676 /* > will be called. */
677 /* > Not modified. */
679 /* > C, S - COMPLEX */
680 /* > Specify the Givens rotation to be applied. If LROWS is */
681 /* > true, then the matrix ( c s ) */
683 /* > (-s c ) is applied from the left; */
684 /* > if false, then the transpose (not conjugated) thereof is */
685 /* > applied from the right. Note that in contrast to the */
686 /* > output of CROTG or to most versions of CROT, both C and S */
687 /* > are complex. For a Givens rotation, |C|**2 + |S|**2 should */
688 /* > be 1, but this is not checked. */
689 /* > Not modified. */
691 /* > A - COMPLEX array. */
692 /* > The array containing the rows/columns to be rotated. The */
693 /* > first element of A should be the upper left element to */
695 /* > Read and modified. */
697 /* > LDA - INTEGER */
698 /* > The "effective" leading dimension of A. If A contains */
699 /* > a matrix stored in GE, HE, or SY format, then this is just */
700 /* > the leading dimension of A as dimensioned in the calling */
701 /* > routine. If A contains a matrix stored in band (GB, HB, or */
702 /* > SB) format, then this should be *one less* than the leading */
703 /* > dimension used in the calling routine. Thus, if A were */
704 /* > dimensioned A(LDA,*) in CLAROT, then A(1,j) would be the */
705 /* > j-th element in the first of the two rows to be rotated, */
706 /* > and A(2,j) would be the j-th in the second, regardless of */
707 /* > how the array may be stored in the calling routine. [A */
708 /* > cannot, however, actually be dimensioned thus, since for */
709 /* > band format, the row number may exceed LDA, which is not */
710 /* > legal FORTRAN.] */
711 /* > If LROWS=.TRUE., then LDA must be at least 1, otherwise */
712 /* > it must be at least NL minus the number of .TRUE. values */
713 /* > in XLEFT and XRIGHT. */
714 /* > Not modified. */
716 /* > XLEFT - COMPLEX */
717 /* > If LLEFT is .TRUE., then XLEFT will be used and modified */
718 /* > instead of A(2,1) (if LROWS=.TRUE.) or A(1,2) */
719 /* > (if LROWS=.FALSE.). */
720 /* > Read and modified. */
722 /* > XRIGHT - COMPLEX */
723 /* > If LRIGHT is .TRUE., then XRIGHT will be used and modified */
724 /* > instead of A(1,NL) (if LROWS=.TRUE.) or A(NL,1) */
725 /* > (if LROWS=.FALSE.). */
726 /* > Read and modified. */
732 /* > \author Univ. of Tennessee */
733 /* > \author Univ. of California Berkeley */
734 /* > \author Univ. of Colorado Denver */
735 /* > \author NAG Ltd. */
737 /* > \date December 2016 */
739 /* > \ingroup complex_matgen */
741 /* ===================================================================== */
742 /* Subroutine */ int clarot_(logical *lrows, logical *lleft, logical *lright,
743 integer *nl, complex *c__, complex *s, complex *a, integer *lda,
744 complex *xleft, complex *xright)
746 /* System generated locals */
747 integer i__1, i__2, i__3, i__4;
748 complex q__1, q__2, q__3, q__4, q__5, q__6;
750 /* Local variables */
751 integer iinc, j, inext;
754 complex xt[2], yt[2];
755 extern /* Subroutine */ int xerbla_(char *, integer *);
759 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
760 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
761 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
765 /* ===================================================================== */
768 /* Set up indices, arrays for ends */
770 /* Parameter adjustments */
786 xt[0].r = a[1].r, xt[0].i = a[1].i;
787 yt[0].r = xleft->r, yt[0].i = xleft->i;
795 iyt = inext + 1 + (*nl - 1) * iinc;
798 xt[i__1].r = xright->r, xt[i__1].i = xright->i;
801 yt[i__1].r = a[i__2].r, yt[i__1].i = a[i__2].i;
804 /* Check for errors */
807 xerbla_("CLAROT", &c__4);
810 if (*lda <= 0 || ! (*lrows) && *lda < *nl - nt) {
811 xerbla_("CLAROT", &c__8);
817 /* CROT( NL-NT, A(IX),IINC, A(IY),IINC, C, S ) with complex C, S */
820 for (j = 0; j <= i__1; ++j) {
821 i__2 = ix + j * iinc;
822 q__2.r = c__->r * a[i__2].r - c__->i * a[i__2].i, q__2.i = c__->r * a[
823 i__2].i + c__->i * a[i__2].r;
824 i__3 = iy + j * iinc;
825 q__3.r = s->r * a[i__3].r - s->i * a[i__3].i, q__3.i = s->r * a[i__3]
826 .i + s->i * a[i__3].r;
827 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
828 tempx.r = q__1.r, tempx.i = q__1.i;
829 i__2 = iy + j * iinc;
831 q__3.r = -q__4.r, q__3.i = -q__4.i;
832 i__3 = ix + j * iinc;
833 q__2.r = q__3.r * a[i__3].r - q__3.i * a[i__3].i, q__2.i = q__3.r * a[
834 i__3].i + q__3.i * a[i__3].r;
836 i__4 = iy + j * iinc;
837 q__5.r = q__6.r * a[i__4].r - q__6.i * a[i__4].i, q__5.i = q__6.r * a[
838 i__4].i + q__6.i * a[i__4].r;
839 q__1.r = q__2.r + q__5.r, q__1.i = q__2.i + q__5.i;
840 a[i__2].r = q__1.r, a[i__2].i = q__1.i;
841 i__2 = ix + j * iinc;
842 a[i__2].r = tempx.r, a[i__2].i = tempx.i;
846 /* CROT( NT, XT,1, YT,1, C, S ) with complex C, S */
849 for (j = 1; j <= i__1; ++j) {
851 q__2.r = c__->r * xt[i__2].r - c__->i * xt[i__2].i, q__2.i = c__->r *
852 xt[i__2].i + c__->i * xt[i__2].r;
854 q__3.r = s->r * yt[i__3].r - s->i * yt[i__3].i, q__3.i = s->r * yt[
855 i__3].i + s->i * yt[i__3].r;
856 q__1.r = q__2.r + q__3.r, q__1.i = q__2.i + q__3.i;
857 tempx.r = q__1.r, tempx.i = q__1.i;
860 q__3.r = -q__4.r, q__3.i = -q__4.i;
862 q__2.r = q__3.r * xt[i__3].r - q__3.i * xt[i__3].i, q__2.i = q__3.r *
863 xt[i__3].i + q__3.i * xt[i__3].r;
866 q__5.r = q__6.r * yt[i__4].r - q__6.i * yt[i__4].i, q__5.i = q__6.r *
867 yt[i__4].i + q__6.i * yt[i__4].r;
868 q__1.r = q__2.r + q__5.r, q__1.i = q__2.i + q__5.i;
869 yt[i__2].r = q__1.r, yt[i__2].i = q__1.i;
871 xt[i__2].r = tempx.r, xt[i__2].i = tempx.i;
875 /* Stuff values back into XLEFT, XRIGHT, etc. */
878 a[1].r = xt[0].r, a[1].i = xt[0].i;
879 xleft->r = yt[0].r, xleft->i = yt[0].i;
884 xright->r = xt[i__1].r, xright->i = xt[i__1].i;
887 a[i__1].r = yt[i__2].r, a[i__1].i = yt[i__2].i;