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 SSYCONVF_ROOK */
515 /* =========== DOCUMENTATION =========== */
517 /* Online html documentation available at */
518 /* http://www.netlib.org/lapack/explore-html/ */
521 /* > Download SSYCONVF_ROOK + dependencies */
522 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ssyconv
525 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ssyconv
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ssyconv
536 /* SUBROUTINE SSYCONVF_ROOK( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) */
538 /* CHARACTER UPLO, WAY */
539 /* INTEGER INFO, LDA, N */
540 /* INTEGER IPIV( * ) */
541 /* REAL A( LDA, * ), E( * ) */
544 /* > \par Purpose: */
548 /* > If parameter WAY = 'C': */
549 /* > SSYCONVF_ROOK converts the factorization output format used in */
550 /* > SSYTRF_ROOK provided on entry in parameter A into the factorization */
551 /* > output format used in SSYTRF_RK (or SSYTRF_BK) that is stored */
552 /* > on exit in parameters A and E. IPIV format for SSYTRF_ROOK and */
553 /* > SSYTRF_RK (or SSYTRF_BK) is the same and is not converted. */
555 /* > If parameter WAY = 'R': */
556 /* > SSYCONVF_ROOK performs the conversion in reverse direction, i.e. */
557 /* > converts the factorization output format used in SSYTRF_RK */
558 /* > (or SSYTRF_BK) provided on entry in parameters A and E into */
559 /* > the factorization output format used in SSYTRF_ROOK that is stored */
560 /* > on exit in parameter A. IPIV format for SSYTRF_ROOK and */
561 /* > SSYTRF_RK (or SSYTRF_BK) is the same and is not converted. */
567 /* > \param[in] UPLO */
569 /* > UPLO is CHARACTER*1 */
570 /* > Specifies whether the details of the factorization are */
571 /* > stored as an upper or lower triangular matrix A. */
572 /* > = 'U': Upper triangular */
573 /* > = 'L': Lower triangular */
576 /* > \param[in] WAY */
578 /* > WAY is CHARACTER*1 */
579 /* > = 'C': Convert */
580 /* > = 'R': Revert */
586 /* > The order of the matrix A. N >= 0. */
589 /* > \param[in,out] A */
591 /* > A is REAL array, dimension (LDA,N) */
593 /* > 1) If WAY ='C': */
595 /* > On entry, contains factorization details in format used in */
597 /* > a) all elements of the symmetric block diagonal */
598 /* > matrix D on the diagonal of A and on superdiagonal */
599 /* > (or subdiagonal) of A, and */
600 /* > b) If UPLO = 'U': multipliers used to obtain factor U */
601 /* > in the superdiagonal part of A. */
602 /* > If UPLO = 'L': multipliers used to obtain factor L */
603 /* > in the superdiagonal part of A. */
605 /* > On exit, contains factorization details in format used in */
606 /* > SSYTRF_RK or SSYTRF_BK: */
607 /* > a) ONLY diagonal elements of the symmetric block diagonal */
608 /* > matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); */
609 /* > (superdiagonal (or subdiagonal) elements of D */
610 /* > are stored on exit in array E), and */
611 /* > b) If UPLO = 'U': factor U in the superdiagonal part of A. */
612 /* > If UPLO = 'L': factor L in the subdiagonal part of A. */
614 /* > 2) If WAY = 'R': */
616 /* > On entry, contains factorization details in format used in */
617 /* > SSYTRF_RK or SSYTRF_BK: */
618 /* > a) ONLY diagonal elements of the symmetric block diagonal */
619 /* > matrix D on the diagonal of A, i.e. D(k,k) = A(k,k); */
620 /* > (superdiagonal (or subdiagonal) elements of D */
621 /* > are stored on exit in array E), and */
622 /* > b) If UPLO = 'U': factor U in the superdiagonal part of A. */
623 /* > If UPLO = 'L': factor L in the subdiagonal part of A. */
625 /* > On exit, contains factorization details in format used in */
627 /* > a) all elements of the symmetric block diagonal */
628 /* > matrix D on the diagonal of A and on superdiagonal */
629 /* > (or subdiagonal) of A, and */
630 /* > b) If UPLO = 'U': multipliers used to obtain factor U */
631 /* > in the superdiagonal part of A. */
632 /* > If UPLO = 'L': multipliers used to obtain factor L */
633 /* > in the superdiagonal part of A. */
636 /* > \param[in] LDA */
638 /* > LDA is INTEGER */
639 /* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
642 /* > \param[in,out] E */
644 /* > E is REAL array, dimension (N) */
646 /* > 1) If WAY ='C': */
648 /* > On entry, just a workspace. */
650 /* > On exit, contains the superdiagonal (or subdiagonal) */
651 /* > elements of the symmetric block diagonal matrix D */
652 /* > with 1-by-1 or 2-by-2 diagonal blocks, where */
653 /* > If UPLO = 'U': E(i) = D(i-1,i), i=2:N, E(1) is set to 0; */
654 /* > If UPLO = 'L': E(i) = D(i+1,i), i=1:N-1, E(N) is set to 0. */
656 /* > 2) If WAY = 'R': */
658 /* > On entry, contains the superdiagonal (or subdiagonal) */
659 /* > elements of the symmetric block diagonal matrix D */
660 /* > with 1-by-1 or 2-by-2 diagonal blocks, where */
661 /* > If UPLO = 'U': E(i) = D(i-1,i),i=2:N, E(1) not referenced; */
662 /* > If UPLO = 'L': E(i) = D(i+1,i),i=1:N-1, E(N) not referenced. */
664 /* > On exit, is not changed */
667 /* > \param[in] IPIV */
669 /* > IPIV is INTEGER array, dimension (N) */
670 /* > On entry, details of the interchanges and the block */
671 /* > structure of D as determined: */
672 /* > 1) by SSYTRF_ROOK, if WAY ='C'; */
673 /* > 2) by SSYTRF_RK (or SSYTRF_BK), if WAY ='R'. */
674 /* > The IPIV format is the same for all these routines. */
676 /* > On exit, is not changed. */
679 /* > \param[out] INFO */
681 /* > INFO is INTEGER */
682 /* > = 0: successful exit */
683 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
689 /* > \author Univ. of Tennessee */
690 /* > \author Univ. of California Berkeley */
691 /* > \author Univ. of Colorado Denver */
692 /* > \author NAG Ltd. */
694 /* > \date November 2017 */
696 /* > \ingroup singleSYcomputational */
698 /* > \par Contributors: */
699 /* ================== */
703 /* > November 2017, Igor Kozachenko, */
704 /* > Computer Science Division, */
705 /* > University of California, Berkeley */
708 /* ===================================================================== */
709 /* Subroutine */ int ssyconvf_rook_(char *uplo, char *way, integer *n, real *
710 a, integer *lda, real *e, integer *ipiv, integer *info)
712 /* System generated locals */
713 integer a_dim1, a_offset, i__1;
715 /* Local variables */
717 extern logical lsame_(char *, char *);
719 extern /* Subroutine */ int sswap_(integer *, real *, integer *, real *,
722 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
727 /* -- LAPACK computational routine (version 3.8.0) -- */
728 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
729 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
733 /* ===================================================================== */
737 /* Parameter adjustments */
739 a_offset = 1 + a_dim1 * 1;
746 upper = lsame_(uplo, "U");
747 convert = lsame_(way, "C");
748 if (! upper && ! lsame_(uplo, "L")) {
750 } else if (! convert && ! lsame_(way, "R")) {
754 } else if (*lda < f2cmax(1,*n)) {
759 xerbla_("SSYCONVF_ROOK", &i__1, (ftnlen)13);
763 /* Quick return if possible */
771 /* Begin A is UPPER */
775 /* Convert A (A is upper) */
780 /* Assign superdiagonal entries of D to array E and zero out */
781 /* corresponding entries in input storage A */
787 e[i__] = a[i__ - 1 + i__ * a_dim1];
789 a[i__ - 1 + i__ * a_dim1] = 0.f;
797 /* Convert PERMUTATIONS */
799 /* Apply permutations to submatrices of upper part of A */
800 /* in factorization order where i decreases from N to 1 */
806 /* 1-by-1 pivot interchange */
808 /* Swap rows i and IPIV(i) in A(1:i,N-i:N) */
814 sswap_(&i__1, &a[i__ + (i__ + 1) * a_dim1], lda, &
815 a[ip + (i__ + 1) * a_dim1], lda);
821 /* 2-by-2 pivot interchange */
823 /* Swap rows i and IPIV(i) and i-1 and IPIV(i-1) */
824 /* in A(1:i,N-i:N) */
827 ip2 = -ipiv[i__ - 1];
831 sswap_(&i__1, &a[i__ + (i__ + 1) * a_dim1], lda, &
832 a[ip + (i__ + 1) * a_dim1], lda);
834 if (ip2 != i__ - 1) {
836 sswap_(&i__1, &a[i__ - 1 + (i__ + 1) * a_dim1],
837 lda, &a[ip2 + (i__ + 1) * a_dim1], lda);
848 /* Revert A (A is upper) */
851 /* Revert PERMUTATIONS */
853 /* Apply permutations to submatrices of upper part of A */
854 /* in reverse factorization order where i increases from 1 to N */
860 /* 1-by-1 pivot interchange */
862 /* Swap rows i and IPIV(i) in A(1:i,N-i:N) */
868 sswap_(&i__1, &a[ip + (i__ + 1) * a_dim1], lda, &
869 a[i__ + (i__ + 1) * a_dim1], lda);
875 /* 2-by-2 pivot interchange */
877 /* Swap rows i-1 and IPIV(i-1) and i and IPIV(i) */
878 /* in A(1:i,N-i:N) */
882 ip2 = -ipiv[i__ - 1];
884 if (ip2 != i__ - 1) {
886 sswap_(&i__1, &a[ip2 + (i__ + 1) * a_dim1], lda, &
887 a[i__ - 1 + (i__ + 1) * a_dim1], lda);
891 sswap_(&i__1, &a[ip + (i__ + 1) * a_dim1], lda, &
892 a[i__ + (i__ + 1) * a_dim1], lda);
901 /* Assign superdiagonal entries of D from array E to */
902 /* superdiagonal entries of A. */
907 a[i__ - 1 + i__ * a_dim1] = e[i__];
919 /* Begin A is LOWER */
923 /* Convert A (A is lower) */
927 /* Assign subdiagonal entries of D to array E and zero out */
928 /* corresponding entries in input storage A */
933 if (i__ < *n && ipiv[i__] < 0) {
934 e[i__] = a[i__ + 1 + i__ * a_dim1];
936 a[i__ + 1 + i__ * a_dim1] = 0.f;
944 /* Convert PERMUTATIONS */
946 /* Apply permutations to submatrices of lower part of A */
947 /* in factorization order where i increases from 1 to N */
953 /* 1-by-1 pivot interchange */
955 /* Swap rows i and IPIV(i) in A(i:N,1:i-1) */
961 sswap_(&i__1, &a[i__ + a_dim1], lda, &a[ip +
968 /* 2-by-2 pivot interchange */
970 /* Swap rows i and IPIV(i) and i+1 and IPIV(i+1) */
971 /* in A(i:N,1:i-1) */
974 ip2 = -ipiv[i__ + 1];
978 sswap_(&i__1, &a[i__ + a_dim1], lda, &a[ip +
981 if (ip2 != i__ + 1) {
983 sswap_(&i__1, &a[i__ + 1 + a_dim1], lda, &a[ip2 +
995 /* Revert A (A is lower) */
998 /* Revert PERMUTATIONS */
1000 /* Apply permutations to submatrices of lower part of A */
1001 /* in reverse factorization order where i decreases from N to 1 */
1005 if (ipiv[i__] > 0) {
1007 /* 1-by-1 pivot interchange */
1009 /* Swap rows i and IPIV(i) in A(i:N,1:i-1) */
1015 sswap_(&i__1, &a[ip + a_dim1], lda, &a[i__ +
1022 /* 2-by-2 pivot interchange */
1024 /* Swap rows i+1 and IPIV(i+1) and i and IPIV(i) */
1025 /* in A(i:N,1:i-1) */
1029 ip2 = -ipiv[i__ + 1];
1031 if (ip2 != i__ + 1) {
1033 sswap_(&i__1, &a[ip2 + a_dim1], lda, &a[i__ + 1 +
1038 sswap_(&i__1, &a[ip + a_dim1], lda, &a[i__ +
1048 /* Assign subdiagonal entries of D from array E to */
1049 /* subgiagonal entries of A. */
1052 while(i__ <= *n - 1) {
1053 if (ipiv[i__] < 0) {
1054 a[i__ + 1 + i__ * a_dim1] = e[i__];
1062 /* End A is LOWER */
1067 /* End of SSYCONVF_ROOK */
1069 } /* ssyconvf_rook__ */