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 real c_b14 = 1.f;
517 static real c_b25 = -1.f;
519 /* > \brief \b SLARFB applies a block reflector or its transpose to a general rectangular matrix. */
521 /* =========== DOCUMENTATION =========== */
523 /* Online html documentation available at */
524 /* http://www.netlib.org/lapack/explore-html/ */
527 /* > Download SLARFB + dependencies */
528 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/slarfb.
531 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/slarfb.
534 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/slarfb.
542 /* SUBROUTINE SLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, */
543 /* T, LDT, C, LDC, WORK, LDWORK ) */
545 /* CHARACTER DIRECT, SIDE, STOREV, TRANS */
546 /* INTEGER K, LDC, LDT, LDV, LDWORK, M, N */
547 /* REAL C( LDC, * ), T( LDT, * ), V( LDV, * ), */
548 /* $ WORK( LDWORK, * ) */
551 /* > \par Purpose: */
556 /* > SLARFB applies a real block reflector H or its transpose H**T to a */
557 /* > real m by n matrix C, from either the left or the right. */
563 /* > \param[in] SIDE */
565 /* > SIDE is CHARACTER*1 */
566 /* > = 'L': apply H or H**T from the Left */
567 /* > = 'R': apply H or H**T from the Right */
570 /* > \param[in] TRANS */
572 /* > TRANS is CHARACTER*1 */
573 /* > = 'N': apply H (No transpose) */
574 /* > = 'T': apply H**T (Transpose) */
577 /* > \param[in] DIRECT */
579 /* > DIRECT is CHARACTER*1 */
580 /* > Indicates how H is formed from a product of elementary */
582 /* > = 'F': H = H(1) H(2) . . . H(k) (Forward) */
583 /* > = 'B': H = H(k) . . . H(2) H(1) (Backward) */
586 /* > \param[in] STOREV */
588 /* > STOREV is CHARACTER*1 */
589 /* > Indicates how the vectors which define the elementary */
590 /* > reflectors are stored: */
591 /* > = 'C': Columnwise */
592 /* > = 'R': Rowwise */
598 /* > The number of rows of the matrix C. */
604 /* > The number of columns of the matrix C. */
610 /* > The order of the matrix T (= the number of elementary */
611 /* > reflectors whose product defines the block reflector). */
612 /* > If SIDE = 'L', M >= K >= 0; */
613 /* > if SIDE = 'R', N >= K >= 0. */
618 /* > V is REAL array, dimension */
619 /* > (LDV,K) if STOREV = 'C' */
620 /* > (LDV,M) if STOREV = 'R' and SIDE = 'L' */
621 /* > (LDV,N) if STOREV = 'R' and SIDE = 'R' */
622 /* > The matrix V. See Further Details. */
625 /* > \param[in] LDV */
627 /* > LDV is INTEGER */
628 /* > The leading dimension of the array V. */
629 /* > If STOREV = 'C' and SIDE = 'L', LDV >= f2cmax(1,M); */
630 /* > if STOREV = 'C' and SIDE = 'R', LDV >= f2cmax(1,N); */
631 /* > if STOREV = 'R', LDV >= K. */
636 /* > T is REAL array, dimension (LDT,K) */
637 /* > The triangular k by k matrix T in the representation of the */
638 /* > block reflector. */
641 /* > \param[in] LDT */
643 /* > LDT is INTEGER */
644 /* > The leading dimension of the array T. LDT >= K. */
647 /* > \param[in,out] C */
649 /* > C is REAL array, dimension (LDC,N) */
650 /* > On entry, the m by n matrix C. */
651 /* > On exit, C is overwritten by H*C or H**T*C or C*H or C*H**T. */
654 /* > \param[in] LDC */
656 /* > LDC is INTEGER */
657 /* > The leading dimension of the array C. LDC >= f2cmax(1,M). */
660 /* > \param[out] WORK */
662 /* > WORK is REAL array, dimension (LDWORK,K) */
665 /* > \param[in] LDWORK */
667 /* > LDWORK is INTEGER */
668 /* > The leading dimension of the array WORK. */
669 /* > If SIDE = 'L', LDWORK >= f2cmax(1,N); */
670 /* > if SIDE = 'R', LDWORK >= f2cmax(1,M). */
676 /* > \author Univ. of Tennessee */
677 /* > \author Univ. of California Berkeley */
678 /* > \author Univ. of Colorado Denver */
679 /* > \author NAG Ltd. */
681 /* > \date June 2013 */
683 /* > \ingroup realOTHERauxiliary */
685 /* > \par Further Details: */
686 /* ===================== */
690 /* > The shape of the matrix V and the storage of the vectors which define */
691 /* > the H(i) is best illustrated by the following example with n = 5 and */
692 /* > k = 3. The elements equal to 1 are not stored; the corresponding */
693 /* > array elements are modified but restored on exit. The rest of the */
694 /* > array is not used. */
696 /* > DIRECT = 'F' and STOREV = 'C': DIRECT = 'F' and STOREV = 'R': */
698 /* > V = ( 1 ) V = ( 1 v1 v1 v1 v1 ) */
699 /* > ( v1 1 ) ( 1 v2 v2 v2 ) */
700 /* > ( v1 v2 1 ) ( 1 v3 v3 ) */
704 /* > DIRECT = 'B' and STOREV = 'C': DIRECT = 'B' and STOREV = 'R': */
706 /* > V = ( v1 v2 v3 ) V = ( v1 v1 1 ) */
707 /* > ( v1 v2 v3 ) ( v2 v2 v2 1 ) */
708 /* > ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) */
713 /* ===================================================================== */
714 /* Subroutine */ int slarfb_(char *side, char *trans, char *direct, char *
715 storev, integer *m, integer *n, integer *k, real *v, integer *ldv,
716 real *t, integer *ldt, real *c__, integer *ldc, real *work, integer *
719 /* System generated locals */
720 integer c_dim1, c_offset, t_dim1, t_offset, v_dim1, v_offset, work_dim1,
721 work_offset, i__1, i__2;
723 /* Local variables */
725 extern logical lsame_(char *, char *);
726 extern /* Subroutine */ int sgemm_(char *, char *, integer *, integer *,
727 integer *, real *, real *, integer *, real *, integer *, real *,
728 real *, integer *), scopy_(integer *, real *,
729 integer *, real *, integer *), strmm_(char *, char *, char *,
730 char *, integer *, integer *, real *, real *, integer *, real *,
735 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
736 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
737 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
741 /* ===================================================================== */
744 /* Quick return if possible */
746 /* Parameter adjustments */
748 v_offset = 1 + v_dim1 * 1;
751 t_offset = 1 + t_dim1 * 1;
754 c_offset = 1 + c_dim1 * 1;
757 work_offset = 1 + work_dim1 * 1;
761 if (*m <= 0 || *n <= 0) {
765 if (lsame_(trans, "N")) {
766 *(unsigned char *)transt = 'T';
768 *(unsigned char *)transt = 'N';
771 if (lsame_(storev, "C")) {
773 if (lsame_(direct, "F")) {
775 /* Let V = ( V1 ) (first K rows) */
777 /* where V1 is unit lower triangular. */
779 if (lsame_(side, "L")) {
781 /* Form H * C or H**T * C where C = ( C1 ) */
784 /* W := C**T * V = (C1**T * V1 + C2**T * V2) (stored in WORK) */
789 for (j = 1; j <= i__1; ++j) {
790 scopy_(n, &c__[j + c_dim1], ldc, &work[j * work_dim1 + 1],
797 strmm_("Right", "Lower", "No transpose", "Unit", n, k, &c_b14,
798 &v[v_offset], ldv, &work[work_offset], ldwork);
801 /* W := W + C2**T * V2 */
804 sgemm_("Transpose", "No transpose", n, k, &i__1, &c_b14, &
805 c__[*k + 1 + c_dim1], ldc, &v[*k + 1 + v_dim1],
806 ldv, &c_b14, &work[work_offset], ldwork);
809 /* W := W * T**T or W * T */
811 strmm_("Right", "Upper", transt, "Non-unit", n, k, &c_b14, &t[
812 t_offset], ldt, &work[work_offset], ldwork);
814 /* C := C - V * W**T */
818 /* C2 := C2 - V2 * W**T */
821 sgemm_("No transpose", "Transpose", &i__1, n, k, &c_b25, &
822 v[*k + 1 + v_dim1], ldv, &work[work_offset],
823 ldwork, &c_b14, &c__[*k + 1 + c_dim1], ldc);
828 strmm_("Right", "Lower", "Transpose", "Unit", n, k, &c_b14, &
829 v[v_offset], ldv, &work[work_offset], ldwork);
831 /* C1 := C1 - W**T */
834 for (j = 1; j <= i__1; ++j) {
836 for (i__ = 1; i__ <= i__2; ++i__) {
837 c__[j + i__ * c_dim1] -= work[i__ + j * work_dim1];
843 } else if (lsame_(side, "R")) {
845 /* Form C * H or C * H**T where C = ( C1 C2 ) */
847 /* W := C * V = (C1*V1 + C2*V2) (stored in WORK) */
852 for (j = 1; j <= i__1; ++j) {
853 scopy_(m, &c__[j * c_dim1 + 1], &c__1, &work[j *
854 work_dim1 + 1], &c__1);
860 strmm_("Right", "Lower", "No transpose", "Unit", m, k, &c_b14,
861 &v[v_offset], ldv, &work[work_offset], ldwork);
864 /* W := W + C2 * V2 */
867 sgemm_("No transpose", "No transpose", m, k, &i__1, &
868 c_b14, &c__[(*k + 1) * c_dim1 + 1], ldc, &v[*k +
869 1 + v_dim1], ldv, &c_b14, &work[work_offset],
873 /* W := W * T or W * T**T */
875 strmm_("Right", "Upper", trans, "Non-unit", m, k, &c_b14, &t[
876 t_offset], ldt, &work[work_offset], ldwork);
878 /* C := C - W * V**T */
882 /* C2 := C2 - W * V2**T */
885 sgemm_("No transpose", "Transpose", m, &i__1, k, &c_b25, &
886 work[work_offset], ldwork, &v[*k + 1 + v_dim1],
887 ldv, &c_b14, &c__[(*k + 1) * c_dim1 + 1], ldc);
892 strmm_("Right", "Lower", "Transpose", "Unit", m, k, &c_b14, &
893 v[v_offset], ldv, &work[work_offset], ldwork);
898 for (j = 1; j <= i__1; ++j) {
900 for (i__ = 1; i__ <= i__2; ++i__) {
901 c__[i__ + j * c_dim1] -= work[i__ + j * work_dim1];
911 /* ( V2 ) (last K rows) */
912 /* where V2 is unit upper triangular. */
914 if (lsame_(side, "L")) {
916 /* Form H * C or H**T * C where C = ( C1 ) */
919 /* W := C**T * V = (C1**T * V1 + C2**T * V2) (stored in WORK) */
924 for (j = 1; j <= i__1; ++j) {
925 scopy_(n, &c__[*m - *k + j + c_dim1], ldc, &work[j *
926 work_dim1 + 1], &c__1);
932 strmm_("Right", "Upper", "No transpose", "Unit", n, k, &c_b14,
933 &v[*m - *k + 1 + v_dim1], ldv, &work[work_offset],
937 /* W := W + C1**T * V1 */
940 sgemm_("Transpose", "No transpose", n, k, &i__1, &c_b14, &
941 c__[c_offset], ldc, &v[v_offset], ldv, &c_b14, &
942 work[work_offset], ldwork);
945 /* W := W * T**T or W * T */
947 strmm_("Right", "Lower", transt, "Non-unit", n, k, &c_b14, &t[
948 t_offset], ldt, &work[work_offset], ldwork);
950 /* C := C - V * W**T */
954 /* C1 := C1 - V1 * W**T */
957 sgemm_("No transpose", "Transpose", &i__1, n, k, &c_b25, &
958 v[v_offset], ldv, &work[work_offset], ldwork, &
959 c_b14, &c__[c_offset], ldc)
965 strmm_("Right", "Upper", "Transpose", "Unit", n, k, &c_b14, &
966 v[*m - *k + 1 + v_dim1], ldv, &work[work_offset],
969 /* C2 := C2 - W**T */
972 for (j = 1; j <= i__1; ++j) {
974 for (i__ = 1; i__ <= i__2; ++i__) {
975 c__[*m - *k + j + i__ * c_dim1] -= work[i__ + j *
982 } else if (lsame_(side, "R")) {
984 /* Form C * H or C * H' where C = ( C1 C2 ) */
986 /* W := C * V = (C1*V1 + C2*V2) (stored in WORK) */
991 for (j = 1; j <= i__1; ++j) {
992 scopy_(m, &c__[(*n - *k + j) * c_dim1 + 1], &c__1, &work[
993 j * work_dim1 + 1], &c__1);
999 strmm_("Right", "Upper", "No transpose", "Unit", m, k, &c_b14,
1000 &v[*n - *k + 1 + v_dim1], ldv, &work[work_offset],
1004 /* W := W + C1 * V1 */
1007 sgemm_("No transpose", "No transpose", m, k, &i__1, &
1008 c_b14, &c__[c_offset], ldc, &v[v_offset], ldv, &
1009 c_b14, &work[work_offset], ldwork);
1012 /* W := W * T or W * T**T */
1014 strmm_("Right", "Lower", trans, "Non-unit", m, k, &c_b14, &t[
1015 t_offset], ldt, &work[work_offset], ldwork);
1017 /* C := C - W * V**T */
1021 /* C1 := C1 - W * V1**T */
1024 sgemm_("No transpose", "Transpose", m, &i__1, k, &c_b25, &
1025 work[work_offset], ldwork, &v[v_offset], ldv, &
1026 c_b14, &c__[c_offset], ldc)
1030 /* W := W * V2**T */
1032 strmm_("Right", "Upper", "Transpose", "Unit", m, k, &c_b14, &
1033 v[*n - *k + 1 + v_dim1], ldv, &work[work_offset],
1039 for (j = 1; j <= i__1; ++j) {
1041 for (i__ = 1; i__ <= i__2; ++i__) {
1042 c__[i__ + (*n - *k + j) * c_dim1] -= work[i__ + j *
1051 } else if (lsame_(storev, "R")) {
1053 if (lsame_(direct, "F")) {
1055 /* Let V = ( V1 V2 ) (V1: first K columns) */
1056 /* where V1 is unit upper triangular. */
1058 if (lsame_(side, "L")) {
1060 /* Form H * C or H**T * C where C = ( C1 ) */
1063 /* W := C**T * V**T = (C1**T * V1**T + C2**T * V2**T) (stored in WORK) */
1068 for (j = 1; j <= i__1; ++j) {
1069 scopy_(n, &c__[j + c_dim1], ldc, &work[j * work_dim1 + 1],
1074 /* W := W * V1**T */
1076 strmm_("Right", "Upper", "Transpose", "Unit", n, k, &c_b14, &
1077 v[v_offset], ldv, &work[work_offset], ldwork);
1080 /* W := W + C2**T * V2**T */
1083 sgemm_("Transpose", "Transpose", n, k, &i__1, &c_b14, &
1084 c__[*k + 1 + c_dim1], ldc, &v[(*k + 1) * v_dim1 +
1085 1], ldv, &c_b14, &work[work_offset], ldwork);
1088 /* W := W * T**T or W * T */
1090 strmm_("Right", "Upper", transt, "Non-unit", n, k, &c_b14, &t[
1091 t_offset], ldt, &work[work_offset], ldwork);
1093 /* C := C - V**T * W**T */
1097 /* C2 := C2 - V2**T * W**T */
1100 sgemm_("Transpose", "Transpose", &i__1, n, k, &c_b25, &v[(
1101 *k + 1) * v_dim1 + 1], ldv, &work[work_offset],
1102 ldwork, &c_b14, &c__[*k + 1 + c_dim1], ldc);
1107 strmm_("Right", "Upper", "No transpose", "Unit", n, k, &c_b14,
1108 &v[v_offset], ldv, &work[work_offset], ldwork);
1110 /* C1 := C1 - W**T */
1113 for (j = 1; j <= i__1; ++j) {
1115 for (i__ = 1; i__ <= i__2; ++i__) {
1116 c__[j + i__ * c_dim1] -= work[i__ + j * work_dim1];
1122 } else if (lsame_(side, "R")) {
1124 /* Form C * H or C * H**T where C = ( C1 C2 ) */
1126 /* W := C * V**T = (C1*V1**T + C2*V2**T) (stored in WORK) */
1131 for (j = 1; j <= i__1; ++j) {
1132 scopy_(m, &c__[j * c_dim1 + 1], &c__1, &work[j *
1133 work_dim1 + 1], &c__1);
1137 /* W := W * V1**T */
1139 strmm_("Right", "Upper", "Transpose", "Unit", m, k, &c_b14, &
1140 v[v_offset], ldv, &work[work_offset], ldwork);
1143 /* W := W + C2 * V2**T */
1146 sgemm_("No transpose", "Transpose", m, k, &i__1, &c_b14, &
1147 c__[(*k + 1) * c_dim1 + 1], ldc, &v[(*k + 1) *
1148 v_dim1 + 1], ldv, &c_b14, &work[work_offset],
1152 /* W := W * T or W * T**T */
1154 strmm_("Right", "Upper", trans, "Non-unit", m, k, &c_b14, &t[
1155 t_offset], ldt, &work[work_offset], ldwork);
1157 /* C := C - W * V */
1161 /* C2 := C2 - W * V2 */
1164 sgemm_("No transpose", "No transpose", m, &i__1, k, &
1165 c_b25, &work[work_offset], ldwork, &v[(*k + 1) *
1166 v_dim1 + 1], ldv, &c_b14, &c__[(*k + 1) * c_dim1
1172 strmm_("Right", "Upper", "No transpose", "Unit", m, k, &c_b14,
1173 &v[v_offset], ldv, &work[work_offset], ldwork);
1178 for (j = 1; j <= i__1; ++j) {
1180 for (i__ = 1; i__ <= i__2; ++i__) {
1181 c__[i__ + j * c_dim1] -= work[i__ + j * work_dim1];
1191 /* Let V = ( V1 V2 ) (V2: last K columns) */
1192 /* where V2 is unit lower triangular. */
1194 if (lsame_(side, "L")) {
1196 /* Form H * C or H**T * C where C = ( C1 ) */
1199 /* W := C**T * V**T = (C1**T * V1**T + C2**T * V2**T) (stored in WORK) */
1204 for (j = 1; j <= i__1; ++j) {
1205 scopy_(n, &c__[*m - *k + j + c_dim1], ldc, &work[j *
1206 work_dim1 + 1], &c__1);
1210 /* W := W * V2**T */
1212 strmm_("Right", "Lower", "Transpose", "Unit", n, k, &c_b14, &
1213 v[(*m - *k + 1) * v_dim1 + 1], ldv, &work[work_offset]
1217 /* W := W + C1**T * V1**T */
1220 sgemm_("Transpose", "Transpose", n, k, &i__1, &c_b14, &
1221 c__[c_offset], ldc, &v[v_offset], ldv, &c_b14, &
1222 work[work_offset], ldwork);
1225 /* W := W * T**T or W * T */
1227 strmm_("Right", "Lower", transt, "Non-unit", n, k, &c_b14, &t[
1228 t_offset], ldt, &work[work_offset], ldwork);
1230 /* C := C - V**T * W**T */
1234 /* C1 := C1 - V1**T * W**T */
1237 sgemm_("Transpose", "Transpose", &i__1, n, k, &c_b25, &v[
1238 v_offset], ldv, &work[work_offset], ldwork, &
1239 c_b14, &c__[c_offset], ldc);
1244 strmm_("Right", "Lower", "No transpose", "Unit", n, k, &c_b14,
1245 &v[(*m - *k + 1) * v_dim1 + 1], ldv, &work[
1246 work_offset], ldwork);
1248 /* C2 := C2 - W**T */
1251 for (j = 1; j <= i__1; ++j) {
1253 for (i__ = 1; i__ <= i__2; ++i__) {
1254 c__[*m - *k + j + i__ * c_dim1] -= work[i__ + j *
1261 } else if (lsame_(side, "R")) {
1263 /* Form C * H or C * H**T where C = ( C1 C2 ) */
1265 /* W := C * V**T = (C1*V1**T + C2*V2**T) (stored in WORK) */
1270 for (j = 1; j <= i__1; ++j) {
1271 scopy_(m, &c__[(*n - *k + j) * c_dim1 + 1], &c__1, &work[
1272 j * work_dim1 + 1], &c__1);
1276 /* W := W * V2**T */
1278 strmm_("Right", "Lower", "Transpose", "Unit", m, k, &c_b14, &
1279 v[(*n - *k + 1) * v_dim1 + 1], ldv, &work[work_offset]
1283 /* W := W + C1 * V1**T */
1286 sgemm_("No transpose", "Transpose", m, k, &i__1, &c_b14, &
1287 c__[c_offset], ldc, &v[v_offset], ldv, &c_b14, &
1288 work[work_offset], ldwork);
1291 /* W := W * T or W * T**T */
1293 strmm_("Right", "Lower", trans, "Non-unit", m, k, &c_b14, &t[
1294 t_offset], ldt, &work[work_offset], ldwork);
1296 /* C := C - W * V */
1300 /* C1 := C1 - W * V1 */
1303 sgemm_("No transpose", "No transpose", m, &i__1, k, &
1304 c_b25, &work[work_offset], ldwork, &v[v_offset],
1305 ldv, &c_b14, &c__[c_offset], ldc);
1310 strmm_("Right", "Lower", "No transpose", "Unit", m, k, &c_b14,
1311 &v[(*n - *k + 1) * v_dim1 + 1], ldv, &work[
1312 work_offset], ldwork);
1317 for (j = 1; j <= i__1; ++j) {
1319 for (i__ = 1; i__ <= i__2; ++i__) {
1320 c__[i__ + (*n - *k + j) * c_dim1] -= work[i__ + j *