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__1 = 1;
516 static logical c_false = FALSE_;
517 static integer c__2 = 2;
518 static doublereal c_b26 = 1.;
519 static doublereal c_b30 = 0.;
520 static logical c_true = TRUE_;
522 /* > \brief \b DTRSYL */
524 /* =========== DOCUMENTATION =========== */
526 /* Online html documentation available at */
527 /* http://www.netlib.org/lapack/explore-html/ */
530 /* > Download DTRSYL + dependencies */
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dtrsyl.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dtrsyl.
537 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dtrsyl.
545 /* SUBROUTINE DTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, */
546 /* LDC, SCALE, INFO ) */
548 /* CHARACTER TRANA, TRANB */
549 /* INTEGER INFO, ISGN, LDA, LDB, LDC, M, N */
550 /* DOUBLE PRECISION SCALE */
551 /* DOUBLE PRECISION A( LDA, * ), B( LDB, * ), C( LDC, * ) */
554 /* > \par Purpose: */
559 /* > DTRSYL solves the real Sylvester matrix equation: */
561 /* > op(A)*X + X*op(B) = scale*C or */
562 /* > op(A)*X - X*op(B) = scale*C, */
564 /* > where op(A) = A or A**T, and A and B are both upper quasi- */
565 /* > triangular. A is M-by-M and B is N-by-N; the right hand side C and */
566 /* > the solution X are M-by-N; and scale is an output scale factor, set */
567 /* > <= 1 to avoid overflow in X. */
569 /* > A and B must be in Schur canonical form (as returned by DHSEQR), that */
570 /* > is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; */
571 /* > each 2-by-2 diagonal block has its diagonal elements equal and its */
572 /* > off-diagonal elements of opposite sign. */
578 /* > \param[in] TRANA */
580 /* > TRANA is CHARACTER*1 */
581 /* > Specifies the option op(A): */
582 /* > = 'N': op(A) = A (No transpose) */
583 /* > = 'T': op(A) = A**T (Transpose) */
584 /* > = 'C': op(A) = A**H (Conjugate transpose = Transpose) */
587 /* > \param[in] TRANB */
589 /* > TRANB is CHARACTER*1 */
590 /* > Specifies the option op(B): */
591 /* > = 'N': op(B) = B (No transpose) */
592 /* > = 'T': op(B) = B**T (Transpose) */
593 /* > = 'C': op(B) = B**H (Conjugate transpose = Transpose) */
596 /* > \param[in] ISGN */
598 /* > ISGN is INTEGER */
599 /* > Specifies the sign in the equation: */
600 /* > = +1: solve op(A)*X + X*op(B) = scale*C */
601 /* > = -1: solve op(A)*X - X*op(B) = scale*C */
607 /* > The order of the matrix A, and the number of rows in the */
608 /* > matrices X and C. M >= 0. */
614 /* > The order of the matrix B, and the number of columns in the */
615 /* > matrices X and C. N >= 0. */
620 /* > A is DOUBLE PRECISION array, dimension (LDA,M) */
621 /* > The upper quasi-triangular matrix A, in Schur canonical form. */
624 /* > \param[in] LDA */
626 /* > LDA is INTEGER */
627 /* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
632 /* > B is DOUBLE PRECISION array, dimension (LDB,N) */
633 /* > The upper quasi-triangular matrix B, in Schur canonical form. */
636 /* > \param[in] LDB */
638 /* > LDB is INTEGER */
639 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
642 /* > \param[in,out] C */
644 /* > C is DOUBLE PRECISION array, dimension (LDC,N) */
645 /* > On entry, the M-by-N right hand side matrix C. */
646 /* > On exit, C is overwritten by the solution matrix X. */
649 /* > \param[in] LDC */
651 /* > LDC is INTEGER */
652 /* > The leading dimension of the array C. LDC >= f2cmax(1,M) */
655 /* > \param[out] SCALE */
657 /* > SCALE is DOUBLE PRECISION */
658 /* > The scale factor, scale, set <= 1 to avoid overflow in X. */
661 /* > \param[out] INFO */
663 /* > INFO is INTEGER */
664 /* > = 0: successful exit */
665 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
666 /* > = 1: A and B have common or very close eigenvalues; perturbed */
667 /* > values were used to solve the equation (but the matrices */
668 /* > A and B are unchanged). */
674 /* > \author Univ. of Tennessee */
675 /* > \author Univ. of California Berkeley */
676 /* > \author Univ. of Colorado Denver */
677 /* > \author NAG Ltd. */
679 /* > \date December 2016 */
681 /* > \ingroup doubleSYcomputational */
683 /* ===================================================================== */
684 /* Subroutine */ int dtrsyl_(char *trana, char *tranb, integer *isgn, integer
685 *m, integer *n, doublereal *a, integer *lda, doublereal *b, integer *
686 ldb, doublereal *c__, integer *ldc, doublereal *scale, integer *info)
688 /* System generated locals */
689 integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
691 doublereal d__1, d__2;
693 /* Local variables */
694 extern doublereal ddot_(integer *, doublereal *, integer *, doublereal *,
697 doublereal smin, suml, sumr;
699 extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
701 doublereal x[4] /* was [2][2] */;
702 extern logical lsame_(char *, char *);
703 integer knext, lnext, k1, k2, l1, l2;
705 extern /* Subroutine */ int dlaln2_(logical *, integer *, integer *,
706 doublereal *, doublereal *, doublereal *, integer *, doublereal *,
707 doublereal *, doublereal *, integer *, doublereal *, doublereal *
708 , doublereal *, integer *, doublereal *, doublereal *, integer *),
709 dlasy2_(logical *, logical *, integer *, integer *, integer *,
710 doublereal *, integer *, doublereal *, integer *, doublereal *,
711 integer *, doublereal *, doublereal *, integer *, doublereal *,
714 extern /* Subroutine */ int dlabad_(doublereal *, doublereal *);
715 extern doublereal dlamch_(char *), dlange_(char *, integer *,
716 integer *, doublereal *, integer *, doublereal *);
718 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
720 logical notrna, notrnb;
721 doublereal smlnum, da11, vec[4] /* was [2][2] */, dum[1], eps, sgn;
724 /* -- LAPACK computational routine (version 3.7.0) -- */
725 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
726 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
730 /* ===================================================================== */
733 /* Decode and Test input parameters */
735 /* Parameter adjustments */
737 a_offset = 1 + a_dim1 * 1;
740 b_offset = 1 + b_dim1 * 1;
743 c_offset = 1 + c_dim1 * 1;
747 notrna = lsame_(trana, "N");
748 notrnb = lsame_(tranb, "N");
751 if (! notrna && ! lsame_(trana, "T") && ! lsame_(
754 } else if (! notrnb && ! lsame_(tranb, "T") && !
755 lsame_(tranb, "C")) {
757 } else if (*isgn != 1 && *isgn != -1) {
763 } else if (*lda < f2cmax(1,*m)) {
765 } else if (*ldb < f2cmax(1,*n)) {
767 } else if (*ldc < f2cmax(1,*m)) {
772 xerbla_("DTRSYL", &i__1, (ftnlen)6);
776 /* Quick return if possible */
779 if (*m == 0 || *n == 0) {
783 /* Set constants to control overflow */
786 smlnum = dlamch_("S");
787 bignum = 1. / smlnum;
788 dlabad_(&smlnum, &bignum);
789 smlnum = smlnum * (doublereal) (*m * *n) / eps;
790 bignum = 1. / smlnum;
793 d__1 = smlnum, d__2 = eps * dlange_("M", m, m, &a[a_offset], lda, dum), d__1 = f2cmax(d__1,d__2), d__2 = eps * dlange_("M", n, n,
794 &b[b_offset], ldb, dum);
795 smin = f2cmax(d__1,d__2);
797 sgn = (doublereal) (*isgn);
799 if (notrna && notrnb) {
801 /* Solve A*X + ISGN*X*B = scale*C. */
803 /* The (K,L)th block of X is determined starting from */
804 /* bottom-left corner column by column by */
806 /* A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) */
810 /* R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B(J,L)]. */
813 /* Start column loop (index = L) */
814 /* L1 (L2) : column index of the first (first) row of X(K,L). */
818 for (l = 1; l <= i__1; ++l) {
826 if (b[l + 1 + l * b_dim1] != 0.) {
837 /* Start row loop (index = K) */
838 /* K1 (K2): row index of the first (last) row of X(K,L). */
841 for (k = *m; k >= 1; --k) {
849 if (a[k + (k - 1) * a_dim1] != 0.) {
860 if (l1 == l2 && k1 == k2) {
866 suml = ddot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
867 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
869 sumr = ddot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l1 *
871 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
874 a11 = a[k1 + k1 * a_dim1] + sgn * b[l1 + l1 * b_dim1];
882 if (da11 < 1. && db > 1.) {
883 if (db > bignum * da11) {
887 x[0] = vec[0] * scaloc / a11;
891 for (j = 1; j <= i__2; ++j) {
892 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
897 c__[k1 + l1 * c_dim1] = x[0];
899 } else if (l1 == l2 && k1 != k2) {
906 suml = ddot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
907 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
909 sumr = ddot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l1 *
911 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
918 suml = ddot_(&i__2, &a[k2 + f2cmin(i__3,*m) * a_dim1], lda, &
919 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
921 sumr = ddot_(&i__2, &c__[k2 + c_dim1], ldc, &b[l1 *
923 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
925 d__1 = -sgn * b[l1 + l1 * b_dim1];
926 dlaln2_(&c_false, &c__2, &c__1, &smin, &c_b26, &a[k1 + k1
927 * a_dim1], lda, &c_b26, &c_b26, vec, &c__2, &d__1,
928 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
935 for (j = 1; j <= i__2; ++j) {
936 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
941 c__[k1 + l1 * c_dim1] = x[0];
942 c__[k2 + l1 * c_dim1] = x[1];
944 } else if (l1 != l2 && k1 == k2) {
951 suml = ddot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
952 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
954 sumr = ddot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l1 *
956 vec[0] = sgn * (c__[k1 + l1 * c_dim1] - (suml + sgn *
964 suml = ddot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
965 c__[f2cmin(i__4,*m) + l2 * c_dim1], &c__1);
967 sumr = ddot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l2 *
969 vec[1] = sgn * (c__[k1 + l2 * c_dim1] - (suml + sgn *
972 d__1 = -sgn * a[k1 + k1 * a_dim1];
973 dlaln2_(&c_true, &c__2, &c__1, &smin, &c_b26, &b[l1 + l1 *
974 b_dim1], ldb, &c_b26, &c_b26, vec, &c__2, &d__1,
975 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
982 for (j = 1; j <= i__2; ++j) {
983 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
988 c__[k1 + l1 * c_dim1] = x[0];
989 c__[k1 + l2 * c_dim1] = x[1];
991 } else if (l1 != l2 && k1 != k2) {
998 suml = ddot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
999 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
1001 sumr = ddot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l1 *
1002 b_dim1 + 1], &c__1);
1003 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1010 suml = ddot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
1011 c__[f2cmin(i__4,*m) + l2 * c_dim1], &c__1);
1013 sumr = ddot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l2 *
1014 b_dim1 + 1], &c__1);
1015 vec[2] = c__[k1 + l2 * c_dim1] - (suml + sgn * sumr);
1022 suml = ddot_(&i__2, &a[k2 + f2cmin(i__3,*m) * a_dim1], lda, &
1023 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
1025 sumr = ddot_(&i__2, &c__[k2 + c_dim1], ldc, &b[l1 *
1026 b_dim1 + 1], &c__1);
1027 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1034 suml = ddot_(&i__2, &a[k2 + f2cmin(i__3,*m) * a_dim1], lda, &
1035 c__[f2cmin(i__4,*m) + l2 * c_dim1], &c__1);
1037 sumr = ddot_(&i__2, &c__[k2 + c_dim1], ldc, &b[l2 *
1038 b_dim1 + 1], &c__1);
1039 vec[3] = c__[k2 + l2 * c_dim1] - (suml + sgn * sumr);
1041 dlasy2_(&c_false, &c_false, isgn, &c__2, &c__2, &a[k1 +
1042 k1 * a_dim1], lda, &b[l1 + l1 * b_dim1], ldb, vec,
1043 &c__2, &scaloc, x, &c__2, &xnorm, &ierr);
1050 for (j = 1; j <= i__2; ++j) {
1051 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1056 c__[k1 + l1 * c_dim1] = x[0];
1057 c__[k1 + l2 * c_dim1] = x[2];
1058 c__[k2 + l1 * c_dim1] = x[1];
1059 c__[k2 + l2 * c_dim1] = x[3];
1070 } else if (! notrna && notrnb) {
1072 /* Solve A**T *X + ISGN*X*B = scale*C. */
1074 /* The (K,L)th block of X is determined starting from */
1075 /* upper-left corner column by column by */
1077 /* A(K,K)**T*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) */
1081 /* R(K,L) = SUM [A(I,K)**T*X(I,L)] +ISGN*SUM [X(K,J)*B(J,L)] */
1084 /* Start column loop (index = L) */
1085 /* L1 (L2): column index of the first (last) row of X(K,L) */
1089 for (l = 1; l <= i__1; ++l) {
1097 if (b[l + 1 + l * b_dim1] != 0.) {
1108 /* Start row loop (index = K) */
1109 /* K1 (K2): row index of the first (last) row of X(K,L) */
1113 for (k = 1; k <= i__2; ++k) {
1121 if (a[k + 1 + k * a_dim1] != 0.) {
1132 if (l1 == l2 && k1 == k2) {
1134 suml = ddot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1135 c_dim1 + 1], &c__1);
1137 sumr = ddot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l1 *
1138 b_dim1 + 1], &c__1);
1139 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1142 a11 = a[k1 + k1 * a_dim1] + sgn * b[l1 + l1 * b_dim1];
1150 if (da11 < 1. && db > 1.) {
1151 if (db > bignum * da11) {
1155 x[0] = vec[0] * scaloc / a11;
1159 for (j = 1; j <= i__3; ++j) {
1160 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1165 c__[k1 + l1 * c_dim1] = x[0];
1167 } else if (l1 == l2 && k1 != k2) {
1170 suml = ddot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1171 c_dim1 + 1], &c__1);
1173 sumr = ddot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l1 *
1174 b_dim1 + 1], &c__1);
1175 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1178 suml = ddot_(&i__3, &a[k2 * a_dim1 + 1], &c__1, &c__[l1 *
1179 c_dim1 + 1], &c__1);
1181 sumr = ddot_(&i__3, &c__[k2 + c_dim1], ldc, &b[l1 *
1182 b_dim1 + 1], &c__1);
1183 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1185 d__1 = -sgn * b[l1 + l1 * b_dim1];
1186 dlaln2_(&c_true, &c__2, &c__1, &smin, &c_b26, &a[k1 + k1 *
1187 a_dim1], lda, &c_b26, &c_b26, vec, &c__2, &d__1,
1188 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1195 for (j = 1; j <= i__3; ++j) {
1196 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1201 c__[k1 + l1 * c_dim1] = x[0];
1202 c__[k2 + l1 * c_dim1] = x[1];
1204 } else if (l1 != l2 && k1 == k2) {
1207 suml = ddot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1208 c_dim1 + 1], &c__1);
1210 sumr = ddot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l1 *
1211 b_dim1 + 1], &c__1);
1212 vec[0] = sgn * (c__[k1 + l1 * c_dim1] - (suml + sgn *
1216 suml = ddot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l2 *
1217 c_dim1 + 1], &c__1);
1219 sumr = ddot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l2 *
1220 b_dim1 + 1], &c__1);
1221 vec[1] = sgn * (c__[k1 + l2 * c_dim1] - (suml + sgn *
1224 d__1 = -sgn * a[k1 + k1 * a_dim1];
1225 dlaln2_(&c_true, &c__2, &c__1, &smin, &c_b26, &b[l1 + l1 *
1226 b_dim1], ldb, &c_b26, &c_b26, vec, &c__2, &d__1,
1227 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1234 for (j = 1; j <= i__3; ++j) {
1235 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1240 c__[k1 + l1 * c_dim1] = x[0];
1241 c__[k1 + l2 * c_dim1] = x[1];
1243 } else if (l1 != l2 && k1 != k2) {
1246 suml = ddot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1247 c_dim1 + 1], &c__1);
1249 sumr = ddot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l1 *
1250 b_dim1 + 1], &c__1);
1251 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1254 suml = ddot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l2 *
1255 c_dim1 + 1], &c__1);
1257 sumr = ddot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l2 *
1258 b_dim1 + 1], &c__1);
1259 vec[2] = c__[k1 + l2 * c_dim1] - (suml + sgn * sumr);
1262 suml = ddot_(&i__3, &a[k2 * a_dim1 + 1], &c__1, &c__[l1 *
1263 c_dim1 + 1], &c__1);
1265 sumr = ddot_(&i__3, &c__[k2 + c_dim1], ldc, &b[l1 *
1266 b_dim1 + 1], &c__1);
1267 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1270 suml = ddot_(&i__3, &a[k2 * a_dim1 + 1], &c__1, &c__[l2 *
1271 c_dim1 + 1], &c__1);
1273 sumr = ddot_(&i__3, &c__[k2 + c_dim1], ldc, &b[l2 *
1274 b_dim1 + 1], &c__1);
1275 vec[3] = c__[k2 + l2 * c_dim1] - (suml + sgn * sumr);
1277 dlasy2_(&c_true, &c_false, isgn, &c__2, &c__2, &a[k1 + k1
1278 * a_dim1], lda, &b[l1 + l1 * b_dim1], ldb, vec, &
1279 c__2, &scaloc, x, &c__2, &xnorm, &ierr);
1286 for (j = 1; j <= i__3; ++j) {
1287 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1292 c__[k1 + l1 * c_dim1] = x[0];
1293 c__[k1 + l2 * c_dim1] = x[2];
1294 c__[k2 + l1 * c_dim1] = x[1];
1295 c__[k2 + l2 * c_dim1] = x[3];
1305 } else if (! notrna && ! notrnb) {
1307 /* Solve A**T*X + ISGN*X*B**T = scale*C. */
1309 /* The (K,L)th block of X is determined starting from */
1310 /* top-right corner column by column by */
1312 /* A(K,K)**T*X(K,L) + ISGN*X(K,L)*B(L,L)**T = C(K,L) - R(K,L) */
1316 /* R(K,L) = SUM [A(I,K)**T*X(I,L)] + ISGN*SUM [X(K,J)*B(L,J)**T]. */
1319 /* Start column loop (index = L) */
1320 /* L1 (L2): column index of the first (last) row of X(K,L) */
1323 for (l = *n; l >= 1; --l) {
1331 if (b[l + (l - 1) * b_dim1] != 0.) {
1342 /* Start row loop (index = K) */
1343 /* K1 (K2): row index of the first (last) row of X(K,L) */
1347 for (k = 1; k <= i__1; ++k) {
1355 if (a[k + 1 + k * a_dim1] != 0.) {
1366 if (l1 == l2 && k1 == k2) {
1368 suml = ddot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1369 c_dim1 + 1], &c__1);
1375 sumr = ddot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1376 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1377 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1380 a11 = a[k1 + k1 * a_dim1] + sgn * b[l1 + l1 * b_dim1];
1388 if (da11 < 1. && db > 1.) {
1389 if (db > bignum * da11) {
1393 x[0] = vec[0] * scaloc / a11;
1397 for (j = 1; j <= i__2; ++j) {
1398 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1403 c__[k1 + l1 * c_dim1] = x[0];
1405 } else if (l1 == l2 && k1 != k2) {
1408 suml = ddot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1409 c_dim1 + 1], &c__1);
1415 sumr = ddot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1416 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1417 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1420 suml = ddot_(&i__2, &a[k2 * a_dim1 + 1], &c__1, &c__[l1 *
1421 c_dim1 + 1], &c__1);
1427 sumr = ddot_(&i__2, &c__[k2 + f2cmin(i__3,*n) * c_dim1], ldc,
1428 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1429 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1431 d__1 = -sgn * b[l1 + l1 * b_dim1];
1432 dlaln2_(&c_true, &c__2, &c__1, &smin, &c_b26, &a[k1 + k1 *
1433 a_dim1], lda, &c_b26, &c_b26, vec, &c__2, &d__1,
1434 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1441 for (j = 1; j <= i__2; ++j) {
1442 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1447 c__[k1 + l1 * c_dim1] = x[0];
1448 c__[k2 + l1 * c_dim1] = x[1];
1450 } else if (l1 != l2 && k1 == k2) {
1453 suml = ddot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1454 c_dim1 + 1], &c__1);
1460 sumr = ddot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1461 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1462 vec[0] = sgn * (c__[k1 + l1 * c_dim1] - (suml + sgn *
1466 suml = ddot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l2 *
1467 c_dim1 + 1], &c__1);
1473 sumr = ddot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1474 &b[l2 + f2cmin(i__4,*n) * b_dim1], ldb);
1475 vec[1] = sgn * (c__[k1 + l2 * c_dim1] - (suml + sgn *
1478 d__1 = -sgn * a[k1 + k1 * a_dim1];
1479 dlaln2_(&c_false, &c__2, &c__1, &smin, &c_b26, &b[l1 + l1
1480 * b_dim1], ldb, &c_b26, &c_b26, vec, &c__2, &d__1,
1481 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1488 for (j = 1; j <= i__2; ++j) {
1489 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1494 c__[k1 + l1 * c_dim1] = x[0];
1495 c__[k1 + l2 * c_dim1] = x[1];
1497 } else if (l1 != l2 && k1 != k2) {
1500 suml = ddot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1501 c_dim1 + 1], &c__1);
1507 sumr = ddot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1508 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1509 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1512 suml = ddot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l2 *
1513 c_dim1 + 1], &c__1);
1519 sumr = ddot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1520 &b[l2 + f2cmin(i__4,*n) * b_dim1], ldb);
1521 vec[2] = c__[k1 + l2 * c_dim1] - (suml + sgn * sumr);
1524 suml = ddot_(&i__2, &a[k2 * a_dim1 + 1], &c__1, &c__[l1 *
1525 c_dim1 + 1], &c__1);
1531 sumr = ddot_(&i__2, &c__[k2 + f2cmin(i__3,*n) * c_dim1], ldc,
1532 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1533 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1536 suml = ddot_(&i__2, &a[k2 * a_dim1 + 1], &c__1, &c__[l2 *
1537 c_dim1 + 1], &c__1);
1543 sumr = ddot_(&i__2, &c__[k2 + f2cmin(i__3,*n) * c_dim1], ldc,
1544 &b[l2 + f2cmin(i__4,*n) * b_dim1], ldb);
1545 vec[3] = c__[k2 + l2 * c_dim1] - (suml + sgn * sumr);
1547 dlasy2_(&c_true, &c_true, isgn, &c__2, &c__2, &a[k1 + k1 *
1548 a_dim1], lda, &b[l1 + l1 * b_dim1], ldb, vec, &
1549 c__2, &scaloc, x, &c__2, &xnorm, &ierr);
1556 for (j = 1; j <= i__2; ++j) {
1557 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1562 c__[k1 + l1 * c_dim1] = x[0];
1563 c__[k1 + l2 * c_dim1] = x[2];
1564 c__[k2 + l1 * c_dim1] = x[1];
1565 c__[k2 + l2 * c_dim1] = x[3];
1575 } else if (notrna && ! notrnb) {
1577 /* Solve A*X + ISGN*X*B**T = scale*C. */
1579 /* The (K,L)th block of X is determined starting from */
1580 /* bottom-right corner column by column by */
1582 /* A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L)**T = C(K,L) - R(K,L) */
1586 /* R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B(L,J)**T]. */
1589 /* Start column loop (index = L) */
1590 /* L1 (L2): column index of the first (last) row of X(K,L) */
1593 for (l = *n; l >= 1; --l) {
1601 if (b[l + (l - 1) * b_dim1] != 0.) {
1612 /* Start row loop (index = K) */
1613 /* K1 (K2): row index of the first (last) row of X(K,L) */
1616 for (k = *m; k >= 1; --k) {
1624 if (a[k + (k - 1) * a_dim1] != 0.) {
1635 if (l1 == l2 && k1 == k2) {
1641 suml = ddot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1642 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1648 sumr = ddot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1649 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1650 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1653 a11 = a[k1 + k1 * a_dim1] + sgn * b[l1 + l1 * b_dim1];
1661 if (da11 < 1. && db > 1.) {
1662 if (db > bignum * da11) {
1666 x[0] = vec[0] * scaloc / a11;
1670 for (j = 1; j <= i__1; ++j) {
1671 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1676 c__[k1 + l1 * c_dim1] = x[0];
1678 } else if (l1 == l2 && k1 != k2) {
1685 suml = ddot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1686 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1692 sumr = ddot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1693 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1694 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1701 suml = ddot_(&i__1, &a[k2 + f2cmin(i__2,*m) * a_dim1], lda, &
1702 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1708 sumr = ddot_(&i__1, &c__[k2 + f2cmin(i__2,*n) * c_dim1], ldc,
1709 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1710 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1712 d__1 = -sgn * b[l1 + l1 * b_dim1];
1713 dlaln2_(&c_false, &c__2, &c__1, &smin, &c_b26, &a[k1 + k1
1714 * a_dim1], lda, &c_b26, &c_b26, vec, &c__2, &d__1,
1715 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1722 for (j = 1; j <= i__1; ++j) {
1723 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1728 c__[k1 + l1 * c_dim1] = x[0];
1729 c__[k2 + l1 * c_dim1] = x[1];
1731 } else if (l1 != l2 && k1 == k2) {
1738 suml = ddot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1739 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1745 sumr = ddot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1746 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1747 vec[0] = sgn * (c__[k1 + l1 * c_dim1] - (suml + sgn *
1755 suml = ddot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1756 c__[f2cmin(i__3,*m) + l2 * c_dim1], &c__1);
1762 sumr = ddot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1763 &b[l2 + f2cmin(i__3,*n) * b_dim1], ldb);
1764 vec[1] = sgn * (c__[k1 + l2 * c_dim1] - (suml + sgn *
1767 d__1 = -sgn * a[k1 + k1 * a_dim1];
1768 dlaln2_(&c_false, &c__2, &c__1, &smin, &c_b26, &b[l1 + l1
1769 * b_dim1], ldb, &c_b26, &c_b26, vec, &c__2, &d__1,
1770 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1777 for (j = 1; j <= i__1; ++j) {
1778 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1783 c__[k1 + l1 * c_dim1] = x[0];
1784 c__[k1 + l2 * c_dim1] = x[1];
1786 } else if (l1 != l2 && k1 != k2) {
1793 suml = ddot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1794 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1800 sumr = ddot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1801 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1802 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1809 suml = ddot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1810 c__[f2cmin(i__3,*m) + l2 * c_dim1], &c__1);
1816 sumr = ddot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1817 &b[l2 + f2cmin(i__3,*n) * b_dim1], ldb);
1818 vec[2] = c__[k1 + l2 * c_dim1] - (suml + sgn * sumr);
1825 suml = ddot_(&i__1, &a[k2 + f2cmin(i__2,*m) * a_dim1], lda, &
1826 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1832 sumr = ddot_(&i__1, &c__[k2 + f2cmin(i__2,*n) * c_dim1], ldc,
1833 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1834 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1841 suml = ddot_(&i__1, &a[k2 + f2cmin(i__2,*m) * a_dim1], lda, &
1842 c__[f2cmin(i__3,*m) + l2 * c_dim1], &c__1);
1848 sumr = ddot_(&i__1, &c__[k2 + f2cmin(i__2,*n) * c_dim1], ldc,
1849 &b[l2 + f2cmin(i__3,*n) * b_dim1], ldb);
1850 vec[3] = c__[k2 + l2 * c_dim1] - (suml + sgn * sumr);
1852 dlasy2_(&c_false, &c_true, isgn, &c__2, &c__2, &a[k1 + k1
1853 * a_dim1], lda, &b[l1 + l1 * b_dim1], ldb, vec, &
1854 c__2, &scaloc, x, &c__2, &xnorm, &ierr);
1861 for (j = 1; j <= i__1; ++j) {
1862 dscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1867 c__[k1 + l1 * c_dim1] = x[0];
1868 c__[k1 + l2 * c_dim1] = x[2];
1869 c__[k2 + l1 * c_dim1] = x[1];
1870 c__[k2 + l2 * c_dim1] = x[3];