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 /* > \brief \b CLAGTM performs a matrix-matrix product of the form C = αAB+βC, where A is a tridiagonal matr
514 ix, B and C are rectangular matrices, and α and β are scalars, which may be 0, 1, or -1. */
516 /* =========== DOCUMENTATION =========== */
518 /* Online html documentation available at */
519 /* http://www.netlib.org/lapack/explore-html/ */
522 /* > Download CLAGTM + dependencies */
523 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/clagtm.
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/clagtm.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/clagtm.
537 /* SUBROUTINE CLAGTM( TRANS, N, NRHS, ALPHA, DL, D, DU, X, LDX, BETA, */
540 /* CHARACTER TRANS */
541 /* INTEGER LDB, LDX, N, NRHS */
542 /* REAL ALPHA, BETA */
543 /* COMPLEX B( LDB, * ), D( * ), DL( * ), DU( * ), */
547 /* > \par Purpose: */
552 /* > CLAGTM performs a matrix-vector product of the form */
554 /* > B := alpha * A * X + beta * B */
556 /* > where A is a tridiagonal matrix of order N, B and X are N by NRHS */
557 /* > matrices, and alpha and beta are real scalars, each of which may be */
558 /* > 0., 1., or -1. */
564 /* > \param[in] TRANS */
566 /* > TRANS is CHARACTER*1 */
567 /* > Specifies the operation applied to A. */
568 /* > = 'N': No transpose, B := alpha * A * X + beta * B */
569 /* > = 'T': Transpose, B := alpha * A**T * X + beta * B */
570 /* > = 'C': Conjugate transpose, B := alpha * A**H * X + beta * B */
576 /* > The order of the matrix A. N >= 0. */
579 /* > \param[in] NRHS */
581 /* > NRHS is INTEGER */
582 /* > The number of right hand sides, i.e., the number of columns */
583 /* > of the matrices X and B. */
586 /* > \param[in] ALPHA */
588 /* > ALPHA is REAL */
589 /* > The scalar alpha. ALPHA must be 0., 1., or -1.; otherwise, */
590 /* > it is assumed to be 0. */
593 /* > \param[in] DL */
595 /* > DL is COMPLEX array, dimension (N-1) */
596 /* > The (n-1) sub-diagonal elements of T. */
601 /* > D is COMPLEX array, dimension (N) */
602 /* > The diagonal elements of T. */
605 /* > \param[in] DU */
607 /* > DU is COMPLEX array, dimension (N-1) */
608 /* > The (n-1) super-diagonal elements of T. */
613 /* > X is COMPLEX array, dimension (LDX,NRHS) */
614 /* > The N by NRHS matrix X. */
617 /* > \param[in] LDX */
619 /* > LDX is INTEGER */
620 /* > The leading dimension of the array X. LDX >= f2cmax(N,1). */
623 /* > \param[in] BETA */
626 /* > The scalar beta. BETA must be 0., 1., or -1.; otherwise, */
627 /* > it is assumed to be 1. */
630 /* > \param[in,out] B */
632 /* > B is COMPLEX array, dimension (LDB,NRHS) */
633 /* > On entry, the N by NRHS matrix B. */
634 /* > On exit, B is overwritten by the matrix expression */
635 /* > B := alpha * A * X + beta * B. */
638 /* > \param[in] LDB */
640 /* > LDB is INTEGER */
641 /* > The leading dimension of the array B. LDB >= f2cmax(N,1). */
647 /* > \author Univ. of Tennessee */
648 /* > \author Univ. of California Berkeley */
649 /* > \author Univ. of Colorado Denver */
650 /* > \author NAG Ltd. */
652 /* > \date December 2016 */
654 /* > \ingroup complexOTHERauxiliary */
656 /* ===================================================================== */
657 /* Subroutine */ int clagtm_(char *trans, integer *n, integer *nrhs, real *
658 alpha, complex *dl, complex *d__, complex *du, complex *x, integer *
659 ldx, real *beta, complex *b, integer *ldb)
661 /* System generated locals */
662 integer b_dim1, b_offset, x_dim1, x_offset, i__1, i__2, i__3, i__4, i__5,
663 i__6, i__7, i__8, i__9, i__10;
664 complex q__1, q__2, q__3, q__4, q__5, q__6, q__7, q__8, q__9;
666 /* Local variables */
668 extern logical lsame_(char *, char *);
671 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
672 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
673 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
677 /* ===================================================================== */
680 /* Parameter adjustments */
685 x_offset = 1 + x_dim1 * 1;
688 b_offset = 1 + b_dim1 * 1;
696 /* Multiply B by BETA if BETA.NE.1. */
700 for (j = 1; j <= i__1; ++j) {
702 for (i__ = 1; i__ <= i__2; ++i__) {
703 i__3 = i__ + j * b_dim1;
704 b[i__3].r = 0.f, b[i__3].i = 0.f;
709 } else if (*beta == -1.f) {
711 for (j = 1; j <= i__1; ++j) {
713 for (i__ = 1; i__ <= i__2; ++i__) {
714 i__3 = i__ + j * b_dim1;
715 i__4 = i__ + j * b_dim1;
716 q__1.r = -b[i__4].r, q__1.i = -b[i__4].i;
717 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
725 if (lsame_(trans, "N")) {
727 /* Compute B := B + A*X */
730 for (j = 1; j <= i__1; ++j) {
732 i__2 = j * b_dim1 + 1;
733 i__3 = j * b_dim1 + 1;
734 i__4 = j * x_dim1 + 1;
735 q__2.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
736 q__2.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
738 q__1.r = b[i__3].r + q__2.r, q__1.i = b[i__3].i + q__2.i;
739 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
741 i__2 = j * b_dim1 + 1;
742 i__3 = j * b_dim1 + 1;
743 i__4 = j * x_dim1 + 1;
744 q__3.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
745 q__3.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
747 q__2.r = b[i__3].r + q__3.r, q__2.i = b[i__3].i + q__3.i;
748 i__5 = j * x_dim1 + 2;
749 q__4.r = du[1].r * x[i__5].r - du[1].i * x[i__5].i,
750 q__4.i = du[1].r * x[i__5].i + du[1].i * x[i__5]
752 q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i;
753 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
754 i__2 = *n + j * b_dim1;
755 i__3 = *n + j * b_dim1;
757 i__5 = *n - 1 + j * x_dim1;
758 q__3.r = dl[i__4].r * x[i__5].r - dl[i__4].i * x[i__5].i,
759 q__3.i = dl[i__4].r * x[i__5].i + dl[i__4].i * x[
761 q__2.r = b[i__3].r + q__3.r, q__2.i = b[i__3].i + q__3.i;
763 i__7 = *n + j * x_dim1;
764 q__4.r = d__[i__6].r * x[i__7].r - d__[i__6].i * x[i__7]
765 .i, q__4.i = d__[i__6].r * x[i__7].i + d__[i__6]
767 q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i;
768 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
770 for (i__ = 2; i__ <= i__2; ++i__) {
771 i__3 = i__ + j * b_dim1;
772 i__4 = i__ + j * b_dim1;
774 i__6 = i__ - 1 + j * x_dim1;
775 q__4.r = dl[i__5].r * x[i__6].r - dl[i__5].i * x[i__6]
776 .i, q__4.i = dl[i__5].r * x[i__6].i + dl[i__5]
778 q__3.r = b[i__4].r + q__4.r, q__3.i = b[i__4].i +
781 i__8 = i__ + j * x_dim1;
782 q__5.r = d__[i__7].r * x[i__8].r - d__[i__7].i * x[
783 i__8].i, q__5.i = d__[i__7].r * x[i__8].i +
784 d__[i__7].i * x[i__8].r;
785 q__2.r = q__3.r + q__5.r, q__2.i = q__3.i + q__5.i;
787 i__10 = i__ + 1 + j * x_dim1;
788 q__6.r = du[i__9].r * x[i__10].r - du[i__9].i * x[
789 i__10].i, q__6.i = du[i__9].r * x[i__10].i +
790 du[i__9].i * x[i__10].r;
791 q__1.r = q__2.r + q__6.r, q__1.i = q__2.i + q__6.i;
792 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
798 } else if (lsame_(trans, "T")) {
800 /* Compute B := B + A**T * X */
803 for (j = 1; j <= i__1; ++j) {
805 i__2 = j * b_dim1 + 1;
806 i__3 = j * b_dim1 + 1;
807 i__4 = j * x_dim1 + 1;
808 q__2.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
809 q__2.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
811 q__1.r = b[i__3].r + q__2.r, q__1.i = b[i__3].i + q__2.i;
812 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
814 i__2 = j * b_dim1 + 1;
815 i__3 = j * b_dim1 + 1;
816 i__4 = j * x_dim1 + 1;
817 q__3.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
818 q__3.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
820 q__2.r = b[i__3].r + q__3.r, q__2.i = b[i__3].i + q__3.i;
821 i__5 = j * x_dim1 + 2;
822 q__4.r = dl[1].r * x[i__5].r - dl[1].i * x[i__5].i,
823 q__4.i = dl[1].r * x[i__5].i + dl[1].i * x[i__5]
825 q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i;
826 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
827 i__2 = *n + j * b_dim1;
828 i__3 = *n + j * b_dim1;
830 i__5 = *n - 1 + j * x_dim1;
831 q__3.r = du[i__4].r * x[i__5].r - du[i__4].i * x[i__5].i,
832 q__3.i = du[i__4].r * x[i__5].i + du[i__4].i * x[
834 q__2.r = b[i__3].r + q__3.r, q__2.i = b[i__3].i + q__3.i;
836 i__7 = *n + j * x_dim1;
837 q__4.r = d__[i__6].r * x[i__7].r - d__[i__6].i * x[i__7]
838 .i, q__4.i = d__[i__6].r * x[i__7].i + d__[i__6]
840 q__1.r = q__2.r + q__4.r, q__1.i = q__2.i + q__4.i;
841 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
843 for (i__ = 2; i__ <= i__2; ++i__) {
844 i__3 = i__ + j * b_dim1;
845 i__4 = i__ + j * b_dim1;
847 i__6 = i__ - 1 + j * x_dim1;
848 q__4.r = du[i__5].r * x[i__6].r - du[i__5].i * x[i__6]
849 .i, q__4.i = du[i__5].r * x[i__6].i + du[i__5]
851 q__3.r = b[i__4].r + q__4.r, q__3.i = b[i__4].i +
854 i__8 = i__ + j * x_dim1;
855 q__5.r = d__[i__7].r * x[i__8].r - d__[i__7].i * x[
856 i__8].i, q__5.i = d__[i__7].r * x[i__8].i +
857 d__[i__7].i * x[i__8].r;
858 q__2.r = q__3.r + q__5.r, q__2.i = q__3.i + q__5.i;
860 i__10 = i__ + 1 + j * x_dim1;
861 q__6.r = dl[i__9].r * x[i__10].r - dl[i__9].i * x[
862 i__10].i, q__6.i = dl[i__9].r * x[i__10].i +
863 dl[i__9].i * x[i__10].r;
864 q__1.r = q__2.r + q__6.r, q__1.i = q__2.i + q__6.i;
865 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
871 } else if (lsame_(trans, "C")) {
873 /* Compute B := B + A**H * X */
876 for (j = 1; j <= i__1; ++j) {
878 i__2 = j * b_dim1 + 1;
879 i__3 = j * b_dim1 + 1;
880 r_cnjg(&q__3, &d__[1]);
881 i__4 = j * x_dim1 + 1;
882 q__2.r = q__3.r * x[i__4].r - q__3.i * x[i__4].i, q__2.i =
883 q__3.r * x[i__4].i + q__3.i * x[i__4].r;
884 q__1.r = b[i__3].r + q__2.r, q__1.i = b[i__3].i + q__2.i;
885 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
887 i__2 = j * b_dim1 + 1;
888 i__3 = j * b_dim1 + 1;
889 r_cnjg(&q__4, &d__[1]);
890 i__4 = j * x_dim1 + 1;
891 q__3.r = q__4.r * x[i__4].r - q__4.i * x[i__4].i, q__3.i =
892 q__4.r * x[i__4].i + q__4.i * x[i__4].r;
893 q__2.r = b[i__3].r + q__3.r, q__2.i = b[i__3].i + q__3.i;
894 r_cnjg(&q__6, &dl[1]);
895 i__5 = j * x_dim1 + 2;
896 q__5.r = q__6.r * x[i__5].r - q__6.i * x[i__5].i, q__5.i =
897 q__6.r * x[i__5].i + q__6.i * x[i__5].r;
898 q__1.r = q__2.r + q__5.r, q__1.i = q__2.i + q__5.i;
899 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
900 i__2 = *n + j * b_dim1;
901 i__3 = *n + j * b_dim1;
902 r_cnjg(&q__4, &du[*n - 1]);
903 i__4 = *n - 1 + j * x_dim1;
904 q__3.r = q__4.r * x[i__4].r - q__4.i * x[i__4].i, q__3.i =
905 q__4.r * x[i__4].i + q__4.i * x[i__4].r;
906 q__2.r = b[i__3].r + q__3.r, q__2.i = b[i__3].i + q__3.i;
907 r_cnjg(&q__6, &d__[*n]);
908 i__5 = *n + j * x_dim1;
909 q__5.r = q__6.r * x[i__5].r - q__6.i * x[i__5].i, q__5.i =
910 q__6.r * x[i__5].i + q__6.i * x[i__5].r;
911 q__1.r = q__2.r + q__5.r, q__1.i = q__2.i + q__5.i;
912 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
914 for (i__ = 2; i__ <= i__2; ++i__) {
915 i__3 = i__ + j * b_dim1;
916 i__4 = i__ + j * b_dim1;
917 r_cnjg(&q__5, &du[i__ - 1]);
918 i__5 = i__ - 1 + j * x_dim1;
919 q__4.r = q__5.r * x[i__5].r - q__5.i * x[i__5].i,
920 q__4.i = q__5.r * x[i__5].i + q__5.i * x[i__5]
922 q__3.r = b[i__4].r + q__4.r, q__3.i = b[i__4].i +
924 r_cnjg(&q__7, &d__[i__]);
925 i__6 = i__ + j * x_dim1;
926 q__6.r = q__7.r * x[i__6].r - q__7.i * x[i__6].i,
927 q__6.i = q__7.r * x[i__6].i + q__7.i * x[i__6]
929 q__2.r = q__3.r + q__6.r, q__2.i = q__3.i + q__6.i;
930 r_cnjg(&q__9, &dl[i__]);
931 i__7 = i__ + 1 + j * x_dim1;
932 q__8.r = q__9.r * x[i__7].r - q__9.i * x[i__7].i,
933 q__8.i = q__9.r * x[i__7].i + q__9.i * x[i__7]
935 q__1.r = q__2.r + q__8.r, q__1.i = q__2.i + q__8.i;
936 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
943 } else if (*alpha == -1.f) {
944 if (lsame_(trans, "N")) {
946 /* Compute B := B - A*X */
949 for (j = 1; j <= i__1; ++j) {
951 i__2 = j * b_dim1 + 1;
952 i__3 = j * b_dim1 + 1;
953 i__4 = j * x_dim1 + 1;
954 q__2.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
955 q__2.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
957 q__1.r = b[i__3].r - q__2.r, q__1.i = b[i__3].i - q__2.i;
958 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
960 i__2 = j * b_dim1 + 1;
961 i__3 = j * b_dim1 + 1;
962 i__4 = j * x_dim1 + 1;
963 q__3.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
964 q__3.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
966 q__2.r = b[i__3].r - q__3.r, q__2.i = b[i__3].i - q__3.i;
967 i__5 = j * x_dim1 + 2;
968 q__4.r = du[1].r * x[i__5].r - du[1].i * x[i__5].i,
969 q__4.i = du[1].r * x[i__5].i + du[1].i * x[i__5]
971 q__1.r = q__2.r - q__4.r, q__1.i = q__2.i - q__4.i;
972 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
973 i__2 = *n + j * b_dim1;
974 i__3 = *n + j * b_dim1;
976 i__5 = *n - 1 + j * x_dim1;
977 q__3.r = dl[i__4].r * x[i__5].r - dl[i__4].i * x[i__5].i,
978 q__3.i = dl[i__4].r * x[i__5].i + dl[i__4].i * x[
980 q__2.r = b[i__3].r - q__3.r, q__2.i = b[i__3].i - q__3.i;
982 i__7 = *n + j * x_dim1;
983 q__4.r = d__[i__6].r * x[i__7].r - d__[i__6].i * x[i__7]
984 .i, q__4.i = d__[i__6].r * x[i__7].i + d__[i__6]
986 q__1.r = q__2.r - q__4.r, q__1.i = q__2.i - q__4.i;
987 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
989 for (i__ = 2; i__ <= i__2; ++i__) {
990 i__3 = i__ + j * b_dim1;
991 i__4 = i__ + j * b_dim1;
993 i__6 = i__ - 1 + j * x_dim1;
994 q__4.r = dl[i__5].r * x[i__6].r - dl[i__5].i * x[i__6]
995 .i, q__4.i = dl[i__5].r * x[i__6].i + dl[i__5]
997 q__3.r = b[i__4].r - q__4.r, q__3.i = b[i__4].i -
1000 i__8 = i__ + j * x_dim1;
1001 q__5.r = d__[i__7].r * x[i__8].r - d__[i__7].i * x[
1002 i__8].i, q__5.i = d__[i__7].r * x[i__8].i +
1003 d__[i__7].i * x[i__8].r;
1004 q__2.r = q__3.r - q__5.r, q__2.i = q__3.i - q__5.i;
1006 i__10 = i__ + 1 + j * x_dim1;
1007 q__6.r = du[i__9].r * x[i__10].r - du[i__9].i * x[
1008 i__10].i, q__6.i = du[i__9].r * x[i__10].i +
1009 du[i__9].i * x[i__10].r;
1010 q__1.r = q__2.r - q__6.r, q__1.i = q__2.i - q__6.i;
1011 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
1017 } else if (lsame_(trans, "T")) {
1019 /* Compute B := B - A**T*X */
1022 for (j = 1; j <= i__1; ++j) {
1024 i__2 = j * b_dim1 + 1;
1025 i__3 = j * b_dim1 + 1;
1026 i__4 = j * x_dim1 + 1;
1027 q__2.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
1028 q__2.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
1030 q__1.r = b[i__3].r - q__2.r, q__1.i = b[i__3].i - q__2.i;
1031 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1033 i__2 = j * b_dim1 + 1;
1034 i__3 = j * b_dim1 + 1;
1035 i__4 = j * x_dim1 + 1;
1036 q__3.r = d__[1].r * x[i__4].r - d__[1].i * x[i__4].i,
1037 q__3.i = d__[1].r * x[i__4].i + d__[1].i * x[i__4]
1039 q__2.r = b[i__3].r - q__3.r, q__2.i = b[i__3].i - q__3.i;
1040 i__5 = j * x_dim1 + 2;
1041 q__4.r = dl[1].r * x[i__5].r - dl[1].i * x[i__5].i,
1042 q__4.i = dl[1].r * x[i__5].i + dl[1].i * x[i__5]
1044 q__1.r = q__2.r - q__4.r, q__1.i = q__2.i - q__4.i;
1045 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1046 i__2 = *n + j * b_dim1;
1047 i__3 = *n + j * b_dim1;
1049 i__5 = *n - 1 + j * x_dim1;
1050 q__3.r = du[i__4].r * x[i__5].r - du[i__4].i * x[i__5].i,
1051 q__3.i = du[i__4].r * x[i__5].i + du[i__4].i * x[
1053 q__2.r = b[i__3].r - q__3.r, q__2.i = b[i__3].i - q__3.i;
1055 i__7 = *n + j * x_dim1;
1056 q__4.r = d__[i__6].r * x[i__7].r - d__[i__6].i * x[i__7]
1057 .i, q__4.i = d__[i__6].r * x[i__7].i + d__[i__6]
1059 q__1.r = q__2.r - q__4.r, q__1.i = q__2.i - q__4.i;
1060 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1062 for (i__ = 2; i__ <= i__2; ++i__) {
1063 i__3 = i__ + j * b_dim1;
1064 i__4 = i__ + j * b_dim1;
1066 i__6 = i__ - 1 + j * x_dim1;
1067 q__4.r = du[i__5].r * x[i__6].r - du[i__5].i * x[i__6]
1068 .i, q__4.i = du[i__5].r * x[i__6].i + du[i__5]
1070 q__3.r = b[i__4].r - q__4.r, q__3.i = b[i__4].i -
1073 i__8 = i__ + j * x_dim1;
1074 q__5.r = d__[i__7].r * x[i__8].r - d__[i__7].i * x[
1075 i__8].i, q__5.i = d__[i__7].r * x[i__8].i +
1076 d__[i__7].i * x[i__8].r;
1077 q__2.r = q__3.r - q__5.r, q__2.i = q__3.i - q__5.i;
1079 i__10 = i__ + 1 + j * x_dim1;
1080 q__6.r = dl[i__9].r * x[i__10].r - dl[i__9].i * x[
1081 i__10].i, q__6.i = dl[i__9].r * x[i__10].i +
1082 dl[i__9].i * x[i__10].r;
1083 q__1.r = q__2.r - q__6.r, q__1.i = q__2.i - q__6.i;
1084 b[i__3].r = q__1.r, b[i__3].i = q__1.i;
1090 } else if (lsame_(trans, "C")) {
1092 /* Compute B := B - A**H*X */
1095 for (j = 1; j <= i__1; ++j) {
1097 i__2 = j * b_dim1 + 1;
1098 i__3 = j * b_dim1 + 1;
1099 r_cnjg(&q__3, &d__[1]);
1100 i__4 = j * x_dim1 + 1;
1101 q__2.r = q__3.r * x[i__4].r - q__3.i * x[i__4].i, q__2.i =
1102 q__3.r * x[i__4].i + q__3.i * x[i__4].r;
1103 q__1.r = b[i__3].r - q__2.r, q__1.i = b[i__3].i - q__2.i;
1104 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1106 i__2 = j * b_dim1 + 1;
1107 i__3 = j * b_dim1 + 1;
1108 r_cnjg(&q__4, &d__[1]);
1109 i__4 = j * x_dim1 + 1;
1110 q__3.r = q__4.r * x[i__4].r - q__4.i * x[i__4].i, q__3.i =
1111 q__4.r * x[i__4].i + q__4.i * x[i__4].r;
1112 q__2.r = b[i__3].r - q__3.r, q__2.i = b[i__3].i - q__3.i;
1113 r_cnjg(&q__6, &dl[1]);
1114 i__5 = j * x_dim1 + 2;
1115 q__5.r = q__6.r * x[i__5].r - q__6.i * x[i__5].i, q__5.i =
1116 q__6.r * x[i__5].i + q__6.i * x[i__5].r;
1117 q__1.r = q__2.r - q__5.r, q__1.i = q__2.i - q__5.i;
1118 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1119 i__2 = *n + j * b_dim1;
1120 i__3 = *n + j * b_dim1;
1121 r_cnjg(&q__4, &du[*n - 1]);
1122 i__4 = *n - 1 + j * x_dim1;
1123 q__3.r = q__4.r * x[i__4].r - q__4.i * x[i__4].i, q__3.i =
1124 q__4.r * x[i__4].i + q__4.i * x[i__4].r;
1125 q__2.r = b[i__3].r - q__3.r, q__2.i = b[i__3].i - q__3.i;
1126 r_cnjg(&q__6, &d__[*n]);
1127 i__5 = *n + j * x_dim1;
1128 q__5.r = q__6.r * x[i__5].r - q__6.i * x[i__5].i, q__5.i =
1129 q__6.r * x[i__5].i + q__6.i * x[i__5].r;
1130 q__1.r = q__2.r - q__5.r, q__1.i = q__2.i - q__5.i;
1131 b[i__2].r = q__1.r, b[i__2].i = q__1.i;
1133 for (i__ = 2; i__ <= i__2; ++i__) {
1134 i__3 = i__ + j * b_dim1;
1135 i__4 = i__ + j * b_dim1;
1136 r_cnjg(&q__5, &du[i__ - 1]);
1137 i__5 = i__ - 1 + j * x_dim1;
1138 q__4.r = q__5.r * x[i__5].r - q__5.i * x[i__5].i,
1139 q__4.i = q__5.r * x[i__5].i + q__5.i * x[i__5]
1141 q__3.r = b[i__4].r - q__4.r, q__3.i = b[i__4].i -
1143 r_cnjg(&q__7, &d__[i__]);
1144 i__6 = i__ + j * x_dim1;
1145 q__6.r = q__7.r * x[i__6].r - q__7.i * x[i__6].i,
1146 q__6.i = q__7.r * x[i__6].i + q__7.i * x[i__6]
1148 q__2.r = q__3.r - q__6.r, q__2.i = q__3.i - q__6.i;
1149 r_cnjg(&q__9, &dl[i__]);
1150 i__7 = i__ + 1 + j * x_dim1;
1151 q__8.r = q__9.r * x[i__7].r - q__9.i * x[i__7].i,
1152 q__8.i = q__9.r * x[i__7].i + q__9.i * x[i__7]
1154 q__1.r = q__2.r - q__8.r, q__1.i = q__2.i - q__8.i;
1155 b[i__3].r = q__1.r, b[i__3].i = q__1.i;