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)
512 /* Table of constant values */
514 static integer c__1 = 1;
515 static logical c_false = FALSE_;
516 static integer c__2 = 2;
517 static real c_b26 = 1.f;
518 static real c_b30 = 0.f;
519 static logical c_true = TRUE_;
521 /* > \brief \b STRSYL */
523 /* =========== DOCUMENTATION =========== */
525 /* Online html documentation available at */
526 /* http://www.netlib.org/lapack/explore-html/ */
529 /* > Download STRSYL + dependencies */
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/strsyl.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/strsyl.
536 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/strsyl.
544 /* SUBROUTINE STRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, */
545 /* LDC, SCALE, INFO ) */
547 /* CHARACTER TRANA, TRANB */
548 /* INTEGER INFO, ISGN, LDA, LDB, LDC, M, N */
550 /* REAL A( LDA, * ), B( LDB, * ), C( LDC, * ) */
553 /* > \par Purpose: */
558 /* > STRSYL solves the real Sylvester matrix equation: */
560 /* > op(A)*X + X*op(B) = scale*C or */
561 /* > op(A)*X - X*op(B) = scale*C, */
563 /* > where op(A) = A or A**T, and A and B are both upper quasi- */
564 /* > triangular. A is M-by-M and B is N-by-N; the right hand side C and */
565 /* > the solution X are M-by-N; and scale is an output scale factor, set */
566 /* > <= 1 to avoid overflow in X. */
568 /* > A and B must be in Schur canonical form (as returned by SHSEQR), that */
569 /* > is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; */
570 /* > each 2-by-2 diagonal block has its diagonal elements equal and its */
571 /* > off-diagonal elements of opposite sign. */
577 /* > \param[in] TRANA */
579 /* > TRANA is CHARACTER*1 */
580 /* > Specifies the option op(A): */
581 /* > = 'N': op(A) = A (No transpose) */
582 /* > = 'T': op(A) = A**T (Transpose) */
583 /* > = 'C': op(A) = A**H (Conjugate transpose = Transpose) */
586 /* > \param[in] TRANB */
588 /* > TRANB is CHARACTER*1 */
589 /* > Specifies the option op(B): */
590 /* > = 'N': op(B) = B (No transpose) */
591 /* > = 'T': op(B) = B**T (Transpose) */
592 /* > = 'C': op(B) = B**H (Conjugate transpose = Transpose) */
595 /* > \param[in] ISGN */
597 /* > ISGN is INTEGER */
598 /* > Specifies the sign in the equation: */
599 /* > = +1: solve op(A)*X + X*op(B) = scale*C */
600 /* > = -1: solve op(A)*X - X*op(B) = scale*C */
606 /* > The order of the matrix A, and the number of rows in the */
607 /* > matrices X and C. M >= 0. */
613 /* > The order of the matrix B, and the number of columns in the */
614 /* > matrices X and C. N >= 0. */
619 /* > A is REAL array, dimension (LDA,M) */
620 /* > The upper quasi-triangular matrix A, in Schur canonical form. */
623 /* > \param[in] LDA */
625 /* > LDA is INTEGER */
626 /* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
631 /* > B is REAL array, dimension (LDB,N) */
632 /* > The upper quasi-triangular matrix B, in Schur canonical form. */
635 /* > \param[in] LDB */
637 /* > LDB is INTEGER */
638 /* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
641 /* > \param[in,out] C */
643 /* > C is REAL array, dimension (LDC,N) */
644 /* > On entry, the M-by-N right hand side matrix C. */
645 /* > On exit, C is overwritten by the solution matrix X. */
648 /* > \param[in] LDC */
650 /* > LDC is INTEGER */
651 /* > The leading dimension of the array C. LDC >= f2cmax(1,M) */
654 /* > \param[out] SCALE */
656 /* > SCALE is REAL */
657 /* > The scale factor, scale, set <= 1 to avoid overflow in X. */
660 /* > \param[out] INFO */
662 /* > INFO is INTEGER */
663 /* > = 0: successful exit */
664 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
665 /* > = 1: A and B have common or very close eigenvalues; perturbed */
666 /* > values were used to solve the equation (but the matrices */
667 /* > A and B are unchanged). */
673 /* > \author Univ. of Tennessee */
674 /* > \author Univ. of California Berkeley */
675 /* > \author Univ. of Colorado Denver */
676 /* > \author NAG Ltd. */
678 /* > \date December 2016 */
680 /* > \ingroup realSYcomputational */
682 /* ===================================================================== */
683 /* Subroutine */ int strsyl_(char *trana, char *tranb, integer *isgn, integer
684 *m, integer *n, real *a, integer *lda, real *b, integer *ldb, real *
685 c__, integer *ldc, real *scale, integer *info)
687 /* System generated locals */
688 integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
692 /* Local variables */
695 extern real sdot_(integer *, real *, integer *, real *, integer *);
698 real x[4] /* was [2][2] */;
699 extern logical lsame_(char *, char *);
700 extern /* Subroutine */ int sscal_(integer *, real *, real *, integer *);
701 integer knext, lnext, k1, k2, l1, l2;
703 extern /* Subroutine */ int slaln2_(logical *, integer *, integer *, real
704 *, real *, real *, integer *, real *, real *, real *, integer *,
705 real *, real *, real *, integer *, real *, real *, integer *);
707 extern /* Subroutine */ int slasy2_(logical *, logical *, integer *,
708 integer *, integer *, real *, integer *, real *, integer *, real *
709 , integer *, real *, real *, integer *, real *, integer *),
710 slabad_(real *, real *);
712 extern real slamch_(char *), slange_(char *, integer *, integer *,
713 real *, integer *, real *);
714 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
716 logical notrna, notrnb;
717 real smlnum, da11, vec[4] /* was [2][2] */, dum[1], eps, sgn;
720 /* -- LAPACK computational routine (version 3.7.0) -- */
721 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
722 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
726 /* ===================================================================== */
729 /* Decode and Test input parameters */
731 /* Parameter adjustments */
733 a_offset = 1 + a_dim1 * 1;
736 b_offset = 1 + b_dim1 * 1;
739 c_offset = 1 + c_dim1 * 1;
743 notrna = lsame_(trana, "N");
744 notrnb = lsame_(tranb, "N");
747 if (! notrna && ! lsame_(trana, "T") && ! lsame_(
750 } else if (! notrnb && ! lsame_(tranb, "T") && !
751 lsame_(tranb, "C")) {
753 } else if (*isgn != 1 && *isgn != -1) {
759 } else if (*lda < f2cmax(1,*m)) {
761 } else if (*ldb < f2cmax(1,*n)) {
763 } else if (*ldc < f2cmax(1,*m)) {
768 xerbla_("STRSYL", &i__1, (ftnlen)6);
772 /* Quick return if possible */
775 if (*m == 0 || *n == 0) {
779 /* Set constants to control overflow */
782 smlnum = slamch_("S");
783 bignum = 1.f / smlnum;
784 slabad_(&smlnum, &bignum);
785 smlnum = smlnum * (real) (*m * *n) / eps;
786 bignum = 1.f / smlnum;
789 r__1 = smlnum, r__2 = eps * slange_("M", m, m, &a[a_offset], lda, dum), r__1 = f2cmax(r__1,r__2), r__2 = eps * slange_("M", n, n,
790 &b[b_offset], ldb, dum);
791 smin = f2cmax(r__1,r__2);
793 sgn = (real) (*isgn);
795 if (notrna && notrnb) {
797 /* Solve A*X + ISGN*X*B = scale*C. */
799 /* The (K,L)th block of X is determined starting from */
800 /* bottom-left corner column by column by */
802 /* A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) */
806 /* R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B(J,L)]. */
809 /* Start column loop (index = L) */
810 /* L1 (L2) : column index of the first (first) row of X(K,L). */
814 for (l = 1; l <= i__1; ++l) {
822 if (b[l + 1 + l * b_dim1] != 0.f) {
833 /* Start row loop (index = K) */
834 /* K1 (K2): row index of the first (last) row of X(K,L). */
837 for (k = *m; k >= 1; --k) {
845 if (a[k + (k - 1) * a_dim1] != 0.f) {
856 if (l1 == l2 && k1 == k2) {
862 suml = sdot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
863 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
865 sumr = sdot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l1 *
867 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
870 a11 = a[k1 + k1 * a_dim1] + sgn * b[l1 + l1 * b_dim1];
878 if (da11 < 1.f && db > 1.f) {
879 if (db > bignum * da11) {
883 x[0] = vec[0] * scaloc / a11;
887 for (j = 1; j <= i__2; ++j) {
888 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
893 c__[k1 + l1 * c_dim1] = x[0];
895 } else if (l1 == l2 && k1 != k2) {
902 suml = sdot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
903 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
905 sumr = sdot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l1 *
907 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
914 suml = sdot_(&i__2, &a[k2 + f2cmin(i__3,*m) * a_dim1], lda, &
915 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
917 sumr = sdot_(&i__2, &c__[k2 + c_dim1], ldc, &b[l1 *
919 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
921 r__1 = -sgn * b[l1 + l1 * b_dim1];
922 slaln2_(&c_false, &c__2, &c__1, &smin, &c_b26, &a[k1 + k1
923 * a_dim1], lda, &c_b26, &c_b26, vec, &c__2, &r__1,
924 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
931 for (j = 1; j <= i__2; ++j) {
932 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
937 c__[k1 + l1 * c_dim1] = x[0];
938 c__[k2 + l1 * c_dim1] = x[1];
940 } else if (l1 != l2 && k1 == k2) {
947 suml = sdot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
948 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
950 sumr = sdot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l1 *
952 vec[0] = sgn * (c__[k1 + l1 * c_dim1] - (suml + sgn *
960 suml = sdot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
961 c__[f2cmin(i__4,*m) + l2 * c_dim1], &c__1);
963 sumr = sdot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l2 *
965 vec[1] = sgn * (c__[k1 + l2 * c_dim1] - (suml + sgn *
968 r__1 = -sgn * a[k1 + k1 * a_dim1];
969 slaln2_(&c_true, &c__2, &c__1, &smin, &c_b26, &b[l1 + l1 *
970 b_dim1], ldb, &c_b26, &c_b26, vec, &c__2, &r__1,
971 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
978 for (j = 1; j <= i__2; ++j) {
979 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
984 c__[k1 + l1 * c_dim1] = x[0];
985 c__[k1 + l2 * c_dim1] = x[1];
987 } else if (l1 != l2 && k1 != k2) {
994 suml = sdot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
995 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
997 sumr = sdot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l1 *
999 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1006 suml = sdot_(&i__2, &a[k1 + f2cmin(i__3,*m) * a_dim1], lda, &
1007 c__[f2cmin(i__4,*m) + l2 * c_dim1], &c__1);
1009 sumr = sdot_(&i__2, &c__[k1 + c_dim1], ldc, &b[l2 *
1010 b_dim1 + 1], &c__1);
1011 vec[2] = c__[k1 + l2 * c_dim1] - (suml + sgn * sumr);
1018 suml = sdot_(&i__2, &a[k2 + f2cmin(i__3,*m) * a_dim1], lda, &
1019 c__[f2cmin(i__4,*m) + l1 * c_dim1], &c__1);
1021 sumr = sdot_(&i__2, &c__[k2 + c_dim1], ldc, &b[l1 *
1022 b_dim1 + 1], &c__1);
1023 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1030 suml = sdot_(&i__2, &a[k2 + f2cmin(i__3,*m) * a_dim1], lda, &
1031 c__[f2cmin(i__4,*m) + l2 * c_dim1], &c__1);
1033 sumr = sdot_(&i__2, &c__[k2 + c_dim1], ldc, &b[l2 *
1034 b_dim1 + 1], &c__1);
1035 vec[3] = c__[k2 + l2 * c_dim1] - (suml + sgn * sumr);
1037 slasy2_(&c_false, &c_false, isgn, &c__2, &c__2, &a[k1 +
1038 k1 * a_dim1], lda, &b[l1 + l1 * b_dim1], ldb, vec,
1039 &c__2, &scaloc, x, &c__2, &xnorm, &ierr);
1044 if (scaloc != 1.f) {
1046 for (j = 1; j <= i__2; ++j) {
1047 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1052 c__[k1 + l1 * c_dim1] = x[0];
1053 c__[k1 + l2 * c_dim1] = x[2];
1054 c__[k2 + l1 * c_dim1] = x[1];
1055 c__[k2 + l2 * c_dim1] = x[3];
1066 } else if (! notrna && notrnb) {
1068 /* Solve A**T *X + ISGN*X*B = scale*C. */
1070 /* The (K,L)th block of X is determined starting from */
1071 /* upper-left corner column by column by */
1073 /* A(K,K)**T*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) */
1077 /* R(K,L) = SUM [A(I,K)**T*X(I,L)] +ISGN*SUM [X(K,J)*B(J,L)] */
1080 /* Start column loop (index = L) */
1081 /* L1 (L2): column index of the first (last) row of X(K,L) */
1085 for (l = 1; l <= i__1; ++l) {
1093 if (b[l + 1 + l * b_dim1] != 0.f) {
1104 /* Start row loop (index = K) */
1105 /* K1 (K2): row index of the first (last) row of X(K,L) */
1109 for (k = 1; k <= i__2; ++k) {
1117 if (a[k + 1 + k * a_dim1] != 0.f) {
1128 if (l1 == l2 && k1 == k2) {
1130 suml = sdot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1131 c_dim1 + 1], &c__1);
1133 sumr = sdot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l1 *
1134 b_dim1 + 1], &c__1);
1135 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1138 a11 = a[k1 + k1 * a_dim1] + sgn * b[l1 + l1 * b_dim1];
1146 if (da11 < 1.f && db > 1.f) {
1147 if (db > bignum * da11) {
1151 x[0] = vec[0] * scaloc / a11;
1153 if (scaloc != 1.f) {
1155 for (j = 1; j <= i__3; ++j) {
1156 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1161 c__[k1 + l1 * c_dim1] = x[0];
1163 } else if (l1 == l2 && k1 != k2) {
1166 suml = sdot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1167 c_dim1 + 1], &c__1);
1169 sumr = sdot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l1 *
1170 b_dim1 + 1], &c__1);
1171 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1174 suml = sdot_(&i__3, &a[k2 * a_dim1 + 1], &c__1, &c__[l1 *
1175 c_dim1 + 1], &c__1);
1177 sumr = sdot_(&i__3, &c__[k2 + c_dim1], ldc, &b[l1 *
1178 b_dim1 + 1], &c__1);
1179 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1181 r__1 = -sgn * b[l1 + l1 * b_dim1];
1182 slaln2_(&c_true, &c__2, &c__1, &smin, &c_b26, &a[k1 + k1 *
1183 a_dim1], lda, &c_b26, &c_b26, vec, &c__2, &r__1,
1184 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1189 if (scaloc != 1.f) {
1191 for (j = 1; j <= i__3; ++j) {
1192 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1197 c__[k1 + l1 * c_dim1] = x[0];
1198 c__[k2 + l1 * c_dim1] = x[1];
1200 } else if (l1 != l2 && k1 == k2) {
1203 suml = sdot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1204 c_dim1 + 1], &c__1);
1206 sumr = sdot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l1 *
1207 b_dim1 + 1], &c__1);
1208 vec[0] = sgn * (c__[k1 + l1 * c_dim1] - (suml + sgn *
1212 suml = sdot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l2 *
1213 c_dim1 + 1], &c__1);
1215 sumr = sdot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l2 *
1216 b_dim1 + 1], &c__1);
1217 vec[1] = sgn * (c__[k1 + l2 * c_dim1] - (suml + sgn *
1220 r__1 = -sgn * a[k1 + k1 * a_dim1];
1221 slaln2_(&c_true, &c__2, &c__1, &smin, &c_b26, &b[l1 + l1 *
1222 b_dim1], ldb, &c_b26, &c_b26, vec, &c__2, &r__1,
1223 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1228 if (scaloc != 1.f) {
1230 for (j = 1; j <= i__3; ++j) {
1231 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1236 c__[k1 + l1 * c_dim1] = x[0];
1237 c__[k1 + l2 * c_dim1] = x[1];
1239 } else if (l1 != l2 && k1 != k2) {
1242 suml = sdot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1243 c_dim1 + 1], &c__1);
1245 sumr = sdot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l1 *
1246 b_dim1 + 1], &c__1);
1247 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1250 suml = sdot_(&i__3, &a[k1 * a_dim1 + 1], &c__1, &c__[l2 *
1251 c_dim1 + 1], &c__1);
1253 sumr = sdot_(&i__3, &c__[k1 + c_dim1], ldc, &b[l2 *
1254 b_dim1 + 1], &c__1);
1255 vec[2] = c__[k1 + l2 * c_dim1] - (suml + sgn * sumr);
1258 suml = sdot_(&i__3, &a[k2 * a_dim1 + 1], &c__1, &c__[l1 *
1259 c_dim1 + 1], &c__1);
1261 sumr = sdot_(&i__3, &c__[k2 + c_dim1], ldc, &b[l1 *
1262 b_dim1 + 1], &c__1);
1263 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1266 suml = sdot_(&i__3, &a[k2 * a_dim1 + 1], &c__1, &c__[l2 *
1267 c_dim1 + 1], &c__1);
1269 sumr = sdot_(&i__3, &c__[k2 + c_dim1], ldc, &b[l2 *
1270 b_dim1 + 1], &c__1);
1271 vec[3] = c__[k2 + l2 * c_dim1] - (suml + sgn * sumr);
1273 slasy2_(&c_true, &c_false, isgn, &c__2, &c__2, &a[k1 + k1
1274 * a_dim1], lda, &b[l1 + l1 * b_dim1], ldb, vec, &
1275 c__2, &scaloc, x, &c__2, &xnorm, &ierr);
1280 if (scaloc != 1.f) {
1282 for (j = 1; j <= i__3; ++j) {
1283 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1288 c__[k1 + l1 * c_dim1] = x[0];
1289 c__[k1 + l2 * c_dim1] = x[2];
1290 c__[k2 + l1 * c_dim1] = x[1];
1291 c__[k2 + l2 * c_dim1] = x[3];
1301 } else if (! notrna && ! notrnb) {
1303 /* Solve A**T*X + ISGN*X*B**T = scale*C. */
1305 /* The (K,L)th block of X is determined starting from */
1306 /* top-right corner column by column by */
1308 /* A(K,K)**T*X(K,L) + ISGN*X(K,L)*B(L,L)**T = C(K,L) - R(K,L) */
1312 /* R(K,L) = SUM [A(I,K)**T*X(I,L)] + ISGN*SUM [X(K,J)*B(L,J)**T]. */
1315 /* Start column loop (index = L) */
1316 /* L1 (L2): column index of the first (last) row of X(K,L) */
1319 for (l = *n; l >= 1; --l) {
1327 if (b[l + (l - 1) * b_dim1] != 0.f) {
1338 /* Start row loop (index = K) */
1339 /* K1 (K2): row index of the first (last) row of X(K,L) */
1343 for (k = 1; k <= i__1; ++k) {
1351 if (a[k + 1 + k * a_dim1] != 0.f) {
1362 if (l1 == l2 && k1 == k2) {
1364 suml = sdot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1365 c_dim1 + 1], &c__1);
1371 sumr = sdot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1372 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1373 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1376 a11 = a[k1 + k1 * a_dim1] + sgn * b[l1 + l1 * b_dim1];
1384 if (da11 < 1.f && db > 1.f) {
1385 if (db > bignum * da11) {
1389 x[0] = vec[0] * scaloc / a11;
1391 if (scaloc != 1.f) {
1393 for (j = 1; j <= i__2; ++j) {
1394 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1399 c__[k1 + l1 * c_dim1] = x[0];
1401 } else if (l1 == l2 && k1 != k2) {
1404 suml = sdot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1405 c_dim1 + 1], &c__1);
1411 sumr = sdot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1412 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1413 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1416 suml = sdot_(&i__2, &a[k2 * a_dim1 + 1], &c__1, &c__[l1 *
1417 c_dim1 + 1], &c__1);
1423 sumr = sdot_(&i__2, &c__[k2 + f2cmin(i__3,*n) * c_dim1], ldc,
1424 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1425 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1427 r__1 = -sgn * b[l1 + l1 * b_dim1];
1428 slaln2_(&c_true, &c__2, &c__1, &smin, &c_b26, &a[k1 + k1 *
1429 a_dim1], lda, &c_b26, &c_b26, vec, &c__2, &r__1,
1430 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1435 if (scaloc != 1.f) {
1437 for (j = 1; j <= i__2; ++j) {
1438 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1443 c__[k1 + l1 * c_dim1] = x[0];
1444 c__[k2 + l1 * c_dim1] = x[1];
1446 } else if (l1 != l2 && k1 == k2) {
1449 suml = sdot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1450 c_dim1 + 1], &c__1);
1456 sumr = sdot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1457 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1458 vec[0] = sgn * (c__[k1 + l1 * c_dim1] - (suml + sgn *
1462 suml = sdot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l2 *
1463 c_dim1 + 1], &c__1);
1469 sumr = sdot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1470 &b[l2 + f2cmin(i__4,*n) * b_dim1], ldb);
1471 vec[1] = sgn * (c__[k1 + l2 * c_dim1] - (suml + sgn *
1474 r__1 = -sgn * a[k1 + k1 * a_dim1];
1475 slaln2_(&c_false, &c__2, &c__1, &smin, &c_b26, &b[l1 + l1
1476 * b_dim1], ldb, &c_b26, &c_b26, vec, &c__2, &r__1,
1477 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1482 if (scaloc != 1.f) {
1484 for (j = 1; j <= i__2; ++j) {
1485 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1490 c__[k1 + l1 * c_dim1] = x[0];
1491 c__[k1 + l2 * c_dim1] = x[1];
1493 } else if (l1 != l2 && k1 != k2) {
1496 suml = sdot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l1 *
1497 c_dim1 + 1], &c__1);
1503 sumr = sdot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1504 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1505 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1508 suml = sdot_(&i__2, &a[k1 * a_dim1 + 1], &c__1, &c__[l2 *
1509 c_dim1 + 1], &c__1);
1515 sumr = sdot_(&i__2, &c__[k1 + f2cmin(i__3,*n) * c_dim1], ldc,
1516 &b[l2 + f2cmin(i__4,*n) * b_dim1], ldb);
1517 vec[2] = c__[k1 + l2 * c_dim1] - (suml + sgn * sumr);
1520 suml = sdot_(&i__2, &a[k2 * a_dim1 + 1], &c__1, &c__[l1 *
1521 c_dim1 + 1], &c__1);
1527 sumr = sdot_(&i__2, &c__[k2 + f2cmin(i__3,*n) * c_dim1], ldc,
1528 &b[l1 + f2cmin(i__4,*n) * b_dim1], ldb);
1529 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1532 suml = sdot_(&i__2, &a[k2 * a_dim1 + 1], &c__1, &c__[l2 *
1533 c_dim1 + 1], &c__1);
1539 sumr = sdot_(&i__2, &c__[k2 + f2cmin(i__3,*n) * c_dim1], ldc,
1540 &b[l2 + f2cmin(i__4,*n) * b_dim1], ldb);
1541 vec[3] = c__[k2 + l2 * c_dim1] - (suml + sgn * sumr);
1543 slasy2_(&c_true, &c_true, isgn, &c__2, &c__2, &a[k1 + k1 *
1544 a_dim1], lda, &b[l1 + l1 * b_dim1], ldb, vec, &
1545 c__2, &scaloc, x, &c__2, &xnorm, &ierr);
1550 if (scaloc != 1.f) {
1552 for (j = 1; j <= i__2; ++j) {
1553 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1558 c__[k1 + l1 * c_dim1] = x[0];
1559 c__[k1 + l2 * c_dim1] = x[2];
1560 c__[k2 + l1 * c_dim1] = x[1];
1561 c__[k2 + l2 * c_dim1] = x[3];
1571 } else if (notrna && ! notrnb) {
1573 /* Solve A*X + ISGN*X*B**T = scale*C. */
1575 /* The (K,L)th block of X is determined starting from */
1576 /* bottom-right corner column by column by */
1578 /* A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L)**T = C(K,L) - R(K,L) */
1582 /* R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B(L,J)**T]. */
1585 /* Start column loop (index = L) */
1586 /* L1 (L2): column index of the first (last) row of X(K,L) */
1589 for (l = *n; l >= 1; --l) {
1597 if (b[l + (l - 1) * b_dim1] != 0.f) {
1608 /* Start row loop (index = K) */
1609 /* K1 (K2): row index of the first (last) row of X(K,L) */
1612 for (k = *m; k >= 1; --k) {
1620 if (a[k + (k - 1) * a_dim1] != 0.f) {
1631 if (l1 == l2 && k1 == k2) {
1637 suml = sdot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1638 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1644 sumr = sdot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1645 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1646 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1649 a11 = a[k1 + k1 * a_dim1] + sgn * b[l1 + l1 * b_dim1];
1657 if (da11 < 1.f && db > 1.f) {
1658 if (db > bignum * da11) {
1662 x[0] = vec[0] * scaloc / a11;
1664 if (scaloc != 1.f) {
1666 for (j = 1; j <= i__1; ++j) {
1667 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1672 c__[k1 + l1 * c_dim1] = x[0];
1674 } else if (l1 == l2 && k1 != k2) {
1681 suml = sdot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1682 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1688 sumr = sdot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1689 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1690 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1697 suml = sdot_(&i__1, &a[k2 + f2cmin(i__2,*m) * a_dim1], lda, &
1698 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1704 sumr = sdot_(&i__1, &c__[k2 + f2cmin(i__2,*n) * c_dim1], ldc,
1705 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1706 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1708 r__1 = -sgn * b[l1 + l1 * b_dim1];
1709 slaln2_(&c_false, &c__2, &c__1, &smin, &c_b26, &a[k1 + k1
1710 * a_dim1], lda, &c_b26, &c_b26, vec, &c__2, &r__1,
1711 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1716 if (scaloc != 1.f) {
1718 for (j = 1; j <= i__1; ++j) {
1719 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1724 c__[k1 + l1 * c_dim1] = x[0];
1725 c__[k2 + l1 * c_dim1] = x[1];
1727 } else if (l1 != l2 && k1 == k2) {
1734 suml = sdot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1735 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1741 sumr = sdot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1742 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1743 vec[0] = sgn * (c__[k1 + l1 * c_dim1] - (suml + sgn *
1751 suml = sdot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1752 c__[f2cmin(i__3,*m) + l2 * c_dim1], &c__1);
1758 sumr = sdot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1759 &b[l2 + f2cmin(i__3,*n) * b_dim1], ldb);
1760 vec[1] = sgn * (c__[k1 + l2 * c_dim1] - (suml + sgn *
1763 r__1 = -sgn * a[k1 + k1 * a_dim1];
1764 slaln2_(&c_false, &c__2, &c__1, &smin, &c_b26, &b[l1 + l1
1765 * b_dim1], ldb, &c_b26, &c_b26, vec, &c__2, &r__1,
1766 &c_b30, x, &c__2, &scaloc, &xnorm, &ierr);
1771 if (scaloc != 1.f) {
1773 for (j = 1; j <= i__1; ++j) {
1774 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1779 c__[k1 + l1 * c_dim1] = x[0];
1780 c__[k1 + l2 * c_dim1] = x[1];
1782 } else if (l1 != l2 && k1 != k2) {
1789 suml = sdot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1790 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1796 sumr = sdot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1797 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1798 vec[0] = c__[k1 + l1 * c_dim1] - (suml + sgn * sumr);
1805 suml = sdot_(&i__1, &a[k1 + f2cmin(i__2,*m) * a_dim1], lda, &
1806 c__[f2cmin(i__3,*m) + l2 * c_dim1], &c__1);
1812 sumr = sdot_(&i__1, &c__[k1 + f2cmin(i__2,*n) * c_dim1], ldc,
1813 &b[l2 + f2cmin(i__3,*n) * b_dim1], ldb);
1814 vec[2] = c__[k1 + l2 * c_dim1] - (suml + sgn * sumr);
1821 suml = sdot_(&i__1, &a[k2 + f2cmin(i__2,*m) * a_dim1], lda, &
1822 c__[f2cmin(i__3,*m) + l1 * c_dim1], &c__1);
1828 sumr = sdot_(&i__1, &c__[k2 + f2cmin(i__2,*n) * c_dim1], ldc,
1829 &b[l1 + f2cmin(i__3,*n) * b_dim1], ldb);
1830 vec[1] = c__[k2 + l1 * c_dim1] - (suml + sgn * sumr);
1837 suml = sdot_(&i__1, &a[k2 + f2cmin(i__2,*m) * a_dim1], lda, &
1838 c__[f2cmin(i__3,*m) + l2 * c_dim1], &c__1);
1844 sumr = sdot_(&i__1, &c__[k2 + f2cmin(i__2,*n) * c_dim1], ldc,
1845 &b[l2 + f2cmin(i__3,*n) * b_dim1], ldb);
1846 vec[3] = c__[k2 + l2 * c_dim1] - (suml + sgn * sumr);
1848 slasy2_(&c_false, &c_true, isgn, &c__2, &c__2, &a[k1 + k1
1849 * a_dim1], lda, &b[l1 + l1 * b_dim1], ldb, vec, &
1850 c__2, &scaloc, x, &c__2, &xnorm, &ierr);
1855 if (scaloc != 1.f) {
1857 for (j = 1; j <= i__1; ++j) {
1858 sscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
1863 c__[k1 + l1 * c_dim1] = x[0];
1864 c__[k1 + l2 * c_dim1] = x[2];
1865 c__[k2 + l1 * c_dim1] = x[1];
1866 c__[k2 + l2 * c_dim1] = x[3];