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 DTFTTP copies a triangular matrix from the rectangular full packed format (TF) to the standard
514 packed format (TP). */
516 /* =========== DOCUMENTATION =========== */
518 /* Online html documentation available at */
519 /* http://www.netlib.org/lapack/explore-html/ */
522 /* > Download DTFTTP + dependencies */
523 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dtfttp.
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dtfttp.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dtfttp.
537 /* SUBROUTINE DTFTTP( TRANSR, UPLO, N, ARF, AP, INFO ) */
539 /* CHARACTER TRANSR, UPLO */
540 /* INTEGER INFO, N */
541 /* DOUBLE PRECISION AP( 0: * ), ARF( 0: * ) */
544 /* > \par Purpose: */
549 /* > DTFTTP copies a triangular matrix A from rectangular full packed */
550 /* > format (TF) to standard packed format (TP). */
556 /* > \param[in] TRANSR */
558 /* > TRANSR is CHARACTER*1 */
559 /* > = 'N': ARF is in Normal format; */
560 /* > = 'T': ARF is in Transpose format; */
563 /* > \param[in] UPLO */
565 /* > UPLO is CHARACTER*1 */
566 /* > = 'U': A is upper triangular; */
567 /* > = 'L': A is lower triangular. */
573 /* > The order of the matrix A. N >= 0. */
576 /* > \param[in] ARF */
578 /* > ARF is DOUBLE PRECISION array, dimension ( N*(N+1)/2 ), */
579 /* > On entry, the upper or lower triangular matrix A stored in */
580 /* > RFP format. For a further discussion see Notes below. */
583 /* > \param[out] AP */
585 /* > AP is DOUBLE PRECISION array, dimension ( N*(N+1)/2 ), */
586 /* > On exit, the upper or lower triangular matrix A, packed */
587 /* > columnwise in a linear array. The j-th column of A is stored */
588 /* > in the array AP as follows: */
589 /* > if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j; */
590 /* > if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n. */
593 /* > \param[out] INFO */
595 /* > INFO is INTEGER */
596 /* > = 0: successful exit */
597 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
603 /* > \author Univ. of Tennessee */
604 /* > \author Univ. of California Berkeley */
605 /* > \author Univ. of Colorado Denver */
606 /* > \author NAG Ltd. */
608 /* > \date December 2016 */
610 /* > \ingroup doubleOTHERcomputational */
612 /* > \par Further Details: */
613 /* ===================== */
617 /* > We first consider Rectangular Full Packed (RFP) Format when N is */
618 /* > even. We give an example where N = 6. */
620 /* > AP is Upper AP is Lower */
622 /* > 00 01 02 03 04 05 00 */
623 /* > 11 12 13 14 15 10 11 */
624 /* > 22 23 24 25 20 21 22 */
625 /* > 33 34 35 30 31 32 33 */
626 /* > 44 45 40 41 42 43 44 */
627 /* > 55 50 51 52 53 54 55 */
630 /* > Let TRANSR = 'N'. RFP holds AP as follows: */
631 /* > For UPLO = 'U' the upper trapezoid A(0:5,0:2) consists of the last */
632 /* > three columns of AP upper. The lower triangle A(4:6,0:2) consists of */
633 /* > the transpose of the first three columns of AP upper. */
634 /* > For UPLO = 'L' the lower trapezoid A(1:6,0:2) consists of the first */
635 /* > three columns of AP lower. The upper triangle A(0:2,0:2) consists of */
636 /* > the transpose of the last three columns of AP lower. */
637 /* > This covers the case N even and TRANSR = 'N'. */
641 /* > 03 04 05 33 43 53 */
642 /* > 13 14 15 00 44 54 */
643 /* > 23 24 25 10 11 55 */
644 /* > 33 34 35 20 21 22 */
645 /* > 00 44 45 30 31 32 */
646 /* > 01 11 55 40 41 42 */
647 /* > 02 12 22 50 51 52 */
649 /* > Now let TRANSR = 'T'. RFP A in both UPLO cases is just the */
650 /* > transpose of RFP A above. One therefore gets: */
655 /* > 03 13 23 33 00 01 02 33 00 10 20 30 40 50 */
656 /* > 04 14 24 34 44 11 12 43 44 11 21 31 41 51 */
657 /* > 05 15 25 35 45 55 22 53 54 55 22 32 42 52 */
660 /* > We then consider Rectangular Full Packed (RFP) Format when N is */
661 /* > odd. We give an example where N = 5. */
663 /* > AP is Upper AP is Lower */
665 /* > 00 01 02 03 04 00 */
666 /* > 11 12 13 14 10 11 */
667 /* > 22 23 24 20 21 22 */
668 /* > 33 34 30 31 32 33 */
669 /* > 44 40 41 42 43 44 */
672 /* > Let TRANSR = 'N'. RFP holds AP as follows: */
673 /* > For UPLO = 'U' the upper trapezoid A(0:4,0:2) consists of the last */
674 /* > three columns of AP upper. The lower triangle A(3:4,0:1) consists of */
675 /* > the transpose of the first two columns of AP upper. */
676 /* > For UPLO = 'L' the lower trapezoid A(0:4,0:2) consists of the first */
677 /* > three columns of AP lower. The upper triangle A(0:1,1:2) consists of */
678 /* > the transpose of the last two columns of AP lower. */
679 /* > This covers the case N odd and TRANSR = 'N'. */
683 /* > 02 03 04 00 33 43 */
684 /* > 12 13 14 10 11 44 */
685 /* > 22 23 24 20 21 22 */
686 /* > 00 33 34 30 31 32 */
687 /* > 01 11 44 40 41 42 */
689 /* > Now let TRANSR = 'T'. RFP A in both UPLO cases is just the */
690 /* > transpose of RFP A above. One therefore gets: */
694 /* > 02 12 22 00 01 00 10 20 30 40 50 */
695 /* > 03 13 23 33 11 33 11 21 31 41 51 */
696 /* > 04 14 24 34 44 43 44 22 32 42 52 */
699 /* ===================================================================== */
700 /* Subroutine */ int dtfttp_(char *transr, char *uplo, integer *n, doublereal
701 *arf, doublereal *ap, integer *info)
703 /* System generated locals */
704 integer i__1, i__2, i__3;
706 /* Local variables */
708 logical normaltransr;
709 extern logical lsame_(char *, char *);
711 integer n1, n2, ij, jp, js, nt;
712 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
717 /* -- LAPACK computational routine (version 3.7.0) -- */
718 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
719 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
723 /* ===================================================================== */
726 /* Test the input parameters. */
729 normaltransr = lsame_(transr, "N");
730 lower = lsame_(uplo, "L");
731 if (! normaltransr && ! lsame_(transr, "T")) {
733 } else if (! lower && ! lsame_(uplo, "U")) {
740 xerbla_("DTFTTP", &i__1, (ftnlen)6);
744 /* Quick return if possible */
759 /* Size of array ARF(0:NT-1) */
761 nt = *n * (*n + 1) / 2;
763 /* Set N1 and N2 depending on LOWER */
773 /* If N is odd, set NISODD = .TRUE. */
774 /* If N is even, set K = N/2 and NISODD = .FALSE. */
776 /* set lda of ARF^C; ARF^C is (0:(N+1)/2-1,0:N-noe) */
777 /* where noe = 0 if n is even, noe = 1 if n is odd */
788 /* ARF^C has lda rows and n+1-noe cols */
790 if (! normaltransr) {
794 /* start execution: there are eight cases */
802 /* N is odd and TRANSR = 'N' */
806 /* SRPA for LOWER, NORMAL and N is odd ( a(0:n-1,0:n1-1) ) */
807 /* T1 -> a(0,0), T2 -> a(0,1), S -> a(n1,0) */
808 /* T1 -> a(0), T2 -> a(n), S -> a(n1); lda = n */
813 for (j = 0; j <= i__1; ++j) {
815 for (i__ = j; i__ <= i__2; ++i__) {
823 for (i__ = 0; i__ <= i__1; ++i__) {
825 for (j = i__ + 1; j <= i__2; ++j) {
834 /* SRPA for UPPER, NORMAL and N is odd ( a(0:n-1,0:n2-1) */
835 /* T1 -> a(n1+1,0), T2 -> a(n1,0), S -> a(0,0) */
836 /* T1 -> a(n2), T2 -> a(n1), S -> a(0) */
840 for (j = 0; j <= i__1; ++j) {
843 for (i__ = 0; i__ <= i__2; ++i__) {
851 for (j = n1; j <= i__1; ++j) {
854 for (ij = js; ij <= i__2; ++ij) {
865 /* N is odd and TRANSR = 'T' */
869 /* SRPA for LOWER, TRANSPOSE and N is odd */
870 /* T1 -> A(0,0) , T2 -> A(1,0) , S -> A(0,n1) */
871 /* T1 -> a(0+0) , T2 -> a(1+0) , S -> a(0+n1*n1); lda=n1 */
875 for (i__ = 0; i__ <= i__1; ++i__) {
878 for (ij = i__ * (lda + 1); i__3 < 0 ? ij >= i__2 : ij <=
886 for (j = 0; j <= i__1; ++j) {
887 i__3 = js + n2 - j - 1;
888 for (ij = js; ij <= i__3; ++ij) {
897 /* SRPA for UPPER, TRANSPOSE and N is odd */
898 /* T1 -> A(0,n1+1), T2 -> A(0,n1), S -> A(0,0) */
899 /* T1 -> a(n2*n2), T2 -> a(n1*n2), S -> a(0); lda = n2 */
904 for (j = 0; j <= i__1; ++j) {
906 for (ij = js; ij <= i__3; ++ij) {
913 for (i__ = 0; i__ <= i__1; ++i__) {
914 i__3 = i__ + (n1 + i__) * lda;
916 for (ij = i__; i__2 < 0 ? ij >= i__3 : ij <= i__3; ij +=
933 /* N is even and TRANSR = 'N' */
937 /* SRPA for LOWER, NORMAL, and N is even ( a(0:n,0:k-1) ) */
938 /* T1 -> a(1,0), T2 -> a(0,0), S -> a(k+1,0) */
939 /* T1 -> a(1), T2 -> a(0), S -> a(k+1) */
944 for (j = 0; j <= i__1; ++j) {
946 for (i__ = j; i__ <= i__2; ++i__) {
954 for (i__ = 0; i__ <= i__1; ++i__) {
956 for (j = i__; j <= i__2; ++j) {
965 /* SRPA for UPPER, NORMAL, and N is even ( a(0:n,0:k-1) ) */
966 /* T1 -> a(k+1,0) , T2 -> a(k,0), S -> a(0,0) */
967 /* T1 -> a(k+1), T2 -> a(k), S -> a(0) */
971 for (j = 0; j <= i__1; ++j) {
974 for (i__ = 0; i__ <= i__2; ++i__) {
982 for (j = k; j <= i__1; ++j) {
985 for (ij = js; ij <= i__2; ++ij) {
996 /* N is even and TRANSR = 'T' */
1000 /* SRPA for LOWER, TRANSPOSE and N is even (see paper) */
1001 /* T1 -> B(0,1), T2 -> B(0,0), S -> B(0,k+1) */
1002 /* T1 -> a(0+k), T2 -> a(0+0), S -> a(0+k*(k+1)); lda=k */
1006 for (i__ = 0; i__ <= i__1; ++i__) {
1007 i__2 = (*n + 1) * lda - 1;
1009 for (ij = i__ + (i__ + 1) * lda; i__3 < 0 ? ij >= i__2 :
1010 ij <= i__2; ij += i__3) {
1017 for (j = 0; j <= i__1; ++j) {
1018 i__3 = js + k - j - 1;
1019 for (ij = js; ij <= i__3; ++ij) {
1028 /* SRPA for UPPER, TRANSPOSE and N is even (see paper) */
1029 /* T1 -> B(0,k+1), T2 -> B(0,k), S -> B(0,0) */
1030 /* T1 -> a(0+k*(k+1)), T2 -> a(0+k*k), S -> a(0+0)); lda=k */
1035 for (j = 0; j <= i__1; ++j) {
1037 for (ij = js; ij <= i__3; ++ij) {
1044 for (i__ = 0; i__ <= i__1; ++i__) {
1045 i__3 = i__ + (k + i__) * lda;
1047 for (ij = i__; i__2 < 0 ? ij >= i__3 : ij <= i__3; ij +=