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]/Cd(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 doublecomplex c_b1 = {1.,0.};
516 static integer c__1 = 1;
518 /* > \brief \b ZLARFB applies a block reflector or its conjugate-transpose to a general rectangular matrix. */
520 /* =========== DOCUMENTATION =========== */
522 /* Online html documentation available at */
523 /* http://www.netlib.org/lapack/explore-html/ */
526 /* > Download ZLARFB + dependencies */
527 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlarfb.
530 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlarfb.
533 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlarfb.
541 /* SUBROUTINE ZLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, */
542 /* T, LDT, C, LDC, WORK, LDWORK ) */
544 /* CHARACTER DIRECT, SIDE, STOREV, TRANS */
545 /* INTEGER K, LDC, LDT, LDV, LDWORK, M, N */
546 /* COMPLEX*16 C( LDC, * ), T( LDT, * ), V( LDV, * ), */
547 /* $ WORK( LDWORK, * ) */
550 /* > \par Purpose: */
555 /* > ZLARFB applies a complex block reflector H or its transpose H**H to a */
556 /* > complex M-by-N matrix C, from either the left or the right. */
562 /* > \param[in] SIDE */
564 /* > SIDE is CHARACTER*1 */
565 /* > = 'L': apply H or H**H from the Left */
566 /* > = 'R': apply H or H**H from the Right */
569 /* > \param[in] TRANS */
571 /* > TRANS is CHARACTER*1 */
572 /* > = 'N': apply H (No transpose) */
573 /* > = 'C': apply H**H (Conjugate transpose) */
576 /* > \param[in] DIRECT */
578 /* > DIRECT is CHARACTER*1 */
579 /* > Indicates how H is formed from a product of elementary */
581 /* > = 'F': H = H(1) H(2) . . . H(k) (Forward) */
582 /* > = 'B': H = H(k) . . . H(2) H(1) (Backward) */
585 /* > \param[in] STOREV */
587 /* > STOREV is CHARACTER*1 */
588 /* > Indicates how the vectors which define the elementary */
589 /* > reflectors are stored: */
590 /* > = 'C': Columnwise */
591 /* > = 'R': Rowwise */
597 /* > The number of rows of the matrix C. */
603 /* > The number of columns of the matrix C. */
609 /* > The order of the matrix T (= the number of elementary */
610 /* > reflectors whose product defines the block reflector). */
611 /* > If SIDE = 'L', M >= K >= 0; */
612 /* > if SIDE = 'R', N >= K >= 0. */
617 /* > V is COMPLEX*16 array, dimension */
618 /* > (LDV,K) if STOREV = 'C' */
619 /* > (LDV,M) if STOREV = 'R' and SIDE = 'L' */
620 /* > (LDV,N) if STOREV = 'R' and SIDE = 'R' */
621 /* > See Further Details. */
624 /* > \param[in] LDV */
626 /* > LDV is INTEGER */
627 /* > The leading dimension of the array V. */
628 /* > If STOREV = 'C' and SIDE = 'L', LDV >= f2cmax(1,M); */
629 /* > if STOREV = 'C' and SIDE = 'R', LDV >= f2cmax(1,N); */
630 /* > if STOREV = 'R', LDV >= K. */
635 /* > T is COMPLEX*16 array, dimension (LDT,K) */
636 /* > The triangular K-by-K matrix T in the representation of the */
637 /* > block reflector. */
640 /* > \param[in] LDT */
642 /* > LDT is INTEGER */
643 /* > The leading dimension of the array T. LDT >= K. */
646 /* > \param[in,out] C */
648 /* > C is COMPLEX*16 array, dimension (LDC,N) */
649 /* > On entry, the M-by-N matrix C. */
650 /* > On exit, C is overwritten by H*C or H**H*C or C*H or C*H**H. */
653 /* > \param[in] LDC */
655 /* > LDC is INTEGER */
656 /* > The leading dimension of the array C. LDC >= f2cmax(1,M). */
659 /* > \param[out] WORK */
661 /* > WORK is COMPLEX*16 array, dimension (LDWORK,K) */
664 /* > \param[in] LDWORK */
666 /* > LDWORK is INTEGER */
667 /* > The leading dimension of the array WORK. */
668 /* > If SIDE = 'L', LDWORK >= f2cmax(1,N); */
669 /* > if SIDE = 'R', LDWORK >= f2cmax(1,M). */
675 /* > \author Univ. of Tennessee */
676 /* > \author Univ. of California Berkeley */
677 /* > \author Univ. of Colorado Denver */
678 /* > \author NAG Ltd. */
680 /* > \date June 2013 */
682 /* > \ingroup complex16OTHERauxiliary */
684 /* > \par Further Details: */
685 /* ===================== */
689 /* > The shape of the matrix V and the storage of the vectors which define */
690 /* > the H(i) is best illustrated by the following example with n = 5 and */
691 /* > k = 3. The elements equal to 1 are not stored; the corresponding */
692 /* > array elements are modified but restored on exit. The rest of the */
693 /* > array is not used. */
695 /* > DIRECT = 'F' and STOREV = 'C': DIRECT = 'F' and STOREV = 'R': */
697 /* > V = ( 1 ) V = ( 1 v1 v1 v1 v1 ) */
698 /* > ( v1 1 ) ( 1 v2 v2 v2 ) */
699 /* > ( v1 v2 1 ) ( 1 v3 v3 ) */
703 /* > DIRECT = 'B' and STOREV = 'C': DIRECT = 'B' and STOREV = 'R': */
705 /* > V = ( v1 v2 v3 ) V = ( v1 v1 1 ) */
706 /* > ( v1 v2 v3 ) ( v2 v2 v2 1 ) */
707 /* > ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) */
712 /* ===================================================================== */
713 /* Subroutine */ int zlarfb_(char *side, char *trans, char *direct, char *
714 storev, integer *m, integer *n, integer *k, doublecomplex *v, integer
715 *ldv, doublecomplex *t, integer *ldt, doublecomplex *c__, integer *
716 ldc, doublecomplex *work, integer *ldwork)
718 /* System generated locals */
719 integer c_dim1, c_offset, t_dim1, t_offset, v_dim1, v_offset, work_dim1,
720 work_offset, i__1, i__2, i__3, i__4, i__5;
721 doublecomplex z__1, z__2;
723 /* Local variables */
725 extern logical lsame_(char *, char *);
726 extern /* Subroutine */ int zgemm_(char *, char *, integer *, integer *,
727 integer *, doublecomplex *, doublecomplex *, integer *,
728 doublecomplex *, integer *, doublecomplex *, doublecomplex *,
729 integer *), zcopy_(integer *, doublecomplex *,
730 integer *, doublecomplex *, integer *), ztrmm_(char *, char *,
731 char *, char *, integer *, integer *, doublecomplex *,
732 doublecomplex *, integer *, doublecomplex *, integer *), zlacgv_(integer *, doublecomplex *,
737 /* -- LAPACK auxiliary routine (version 3.7.0) -- */
738 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
739 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
743 /* ===================================================================== */
746 /* Quick return if possible */
748 /* Parameter adjustments */
750 v_offset = 1 + v_dim1 * 1;
753 t_offset = 1 + t_dim1 * 1;
756 c_offset = 1 + c_dim1 * 1;
759 work_offset = 1 + work_dim1 * 1;
763 if (*m <= 0 || *n <= 0) {
767 if (lsame_(trans, "N")) {
768 *(unsigned char *)transt = 'C';
770 *(unsigned char *)transt = 'N';
773 if (lsame_(storev, "C")) {
775 if (lsame_(direct, "F")) {
777 /* Let V = ( V1 ) (first K rows) */
779 /* where V1 is unit lower triangular. */
781 if (lsame_(side, "L")) {
783 /* Form H * C or H**H * C where C = ( C1 ) */
786 /* W := C**H * V = (C1**H * V1 + C2**H * V2) (stored in WORK) */
791 for (j = 1; j <= i__1; ++j) {
792 zcopy_(n, &c__[j + c_dim1], ldc, &work[j * work_dim1 + 1],
794 zlacgv_(n, &work[j * work_dim1 + 1], &c__1);
800 ztrmm_("Right", "Lower", "No transpose", "Unit", n, k, &c_b1,
801 &v[v_offset], ldv, &work[work_offset], ldwork);
804 /* W := W + C2**H * V2 */
807 zgemm_("Conjugate transpose", "No transpose", n, k, &i__1,
808 &c_b1, &c__[*k + 1 + c_dim1], ldc, &v[*k + 1 +
809 v_dim1], ldv, &c_b1, &work[work_offset], ldwork);
812 /* W := W * T**H or W * T */
814 ztrmm_("Right", "Upper", transt, "Non-unit", n, k, &c_b1, &t[
815 t_offset], ldt, &work[work_offset], ldwork);
817 /* C := C - V * W**H */
821 /* C2 := C2 - V2 * W**H */
824 z__1.r = -1., z__1.i = 0.;
825 zgemm_("No transpose", "Conjugate transpose", &i__1, n, k,
826 &z__1, &v[*k + 1 + v_dim1], ldv, &work[
827 work_offset], ldwork, &c_b1, &c__[*k + 1 + c_dim1]
833 ztrmm_("Right", "Lower", "Conjugate transpose", "Unit", n, k,
834 &c_b1, &v[v_offset], ldv, &work[work_offset], ldwork);
836 /* C1 := C1 - W**H */
839 for (j = 1; j <= i__1; ++j) {
841 for (i__ = 1; i__ <= i__2; ++i__) {
842 i__3 = j + i__ * c_dim1;
843 i__4 = j + i__ * c_dim1;
844 d_cnjg(&z__2, &work[i__ + j * work_dim1]);
845 z__1.r = c__[i__4].r - z__2.r, z__1.i = c__[i__4].i -
847 c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;
853 } else if (lsame_(side, "R")) {
855 /* Form C * H or C * H**H where C = ( C1 C2 ) */
857 /* W := C * V = (C1*V1 + C2*V2) (stored in WORK) */
862 for (j = 1; j <= i__1; ++j) {
863 zcopy_(m, &c__[j * c_dim1 + 1], &c__1, &work[j *
864 work_dim1 + 1], &c__1);
870 ztrmm_("Right", "Lower", "No transpose", "Unit", m, k, &c_b1,
871 &v[v_offset], ldv, &work[work_offset], ldwork);
874 /* W := W + C2 * V2 */
877 zgemm_("No transpose", "No transpose", m, k, &i__1, &c_b1,
878 &c__[(*k + 1) * c_dim1 + 1], ldc, &v[*k + 1 +
879 v_dim1], ldv, &c_b1, &work[work_offset], ldwork);
882 /* W := W * T or W * T**H */
884 ztrmm_("Right", "Upper", trans, "Non-unit", m, k, &c_b1, &t[
885 t_offset], ldt, &work[work_offset], ldwork);
887 /* C := C - W * V**H */
891 /* C2 := C2 - W * V2**H */
894 z__1.r = -1., z__1.i = 0.;
895 zgemm_("No transpose", "Conjugate transpose", m, &i__1, k,
896 &z__1, &work[work_offset], ldwork, &v[*k + 1 +
897 v_dim1], ldv, &c_b1, &c__[(*k + 1) * c_dim1 + 1],
903 ztrmm_("Right", "Lower", "Conjugate transpose", "Unit", m, k,
904 &c_b1, &v[v_offset], ldv, &work[work_offset], ldwork);
909 for (j = 1; j <= i__1; ++j) {
911 for (i__ = 1; i__ <= i__2; ++i__) {
912 i__3 = i__ + j * c_dim1;
913 i__4 = i__ + j * c_dim1;
914 i__5 = i__ + j * work_dim1;
915 z__1.r = c__[i__4].r - work[i__5].r, z__1.i = c__[
916 i__4].i - work[i__5].i;
917 c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;
927 /* ( V2 ) (last K rows) */
928 /* where V2 is unit upper triangular. */
930 if (lsame_(side, "L")) {
932 /* Form H * C or H**H * C where C = ( C1 ) */
935 /* W := C**H * V = (C1**H * V1 + C2**H * V2) (stored in WORK) */
940 for (j = 1; j <= i__1; ++j) {
941 zcopy_(n, &c__[*m - *k + j + c_dim1], ldc, &work[j *
942 work_dim1 + 1], &c__1);
943 zlacgv_(n, &work[j * work_dim1 + 1], &c__1);
949 ztrmm_("Right", "Upper", "No transpose", "Unit", n, k, &c_b1,
950 &v[*m - *k + 1 + v_dim1], ldv, &work[work_offset],
954 /* W := W + C1**H * V1 */
957 zgemm_("Conjugate transpose", "No transpose", n, k, &i__1,
958 &c_b1, &c__[c_offset], ldc, &v[v_offset], ldv, &
959 c_b1, &work[work_offset], ldwork);
962 /* W := W * T**H or W * T */
964 ztrmm_("Right", "Lower", transt, "Non-unit", n, k, &c_b1, &t[
965 t_offset], ldt, &work[work_offset], ldwork);
967 /* C := C - V * W**H */
971 /* C1 := C1 - V1 * W**H */
974 z__1.r = -1., z__1.i = 0.;
975 zgemm_("No transpose", "Conjugate transpose", &i__1, n, k,
976 &z__1, &v[v_offset], ldv, &work[work_offset],
977 ldwork, &c_b1, &c__[c_offset], ldc);
982 ztrmm_("Right", "Upper", "Conjugate transpose", "Unit", n, k,
983 &c_b1, &v[*m - *k + 1 + v_dim1], ldv, &work[
984 work_offset], ldwork);
986 /* C2 := C2 - W**H */
989 for (j = 1; j <= i__1; ++j) {
991 for (i__ = 1; i__ <= i__2; ++i__) {
992 i__3 = *m - *k + j + i__ * c_dim1;
993 i__4 = *m - *k + j + i__ * c_dim1;
994 d_cnjg(&z__2, &work[i__ + j * work_dim1]);
995 z__1.r = c__[i__4].r - z__2.r, z__1.i = c__[i__4].i -
997 c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;
1003 } else if (lsame_(side, "R")) {
1005 /* Form C * H or C * H**H where C = ( C1 C2 ) */
1007 /* W := C * V = (C1*V1 + C2*V2) (stored in WORK) */
1012 for (j = 1; j <= i__1; ++j) {
1013 zcopy_(m, &c__[(*n - *k + j) * c_dim1 + 1], &c__1, &work[
1014 j * work_dim1 + 1], &c__1);
1020 ztrmm_("Right", "Upper", "No transpose", "Unit", m, k, &c_b1,
1021 &v[*n - *k + 1 + v_dim1], ldv, &work[work_offset],
1025 /* W := W + C1 * V1 */
1028 zgemm_("No transpose", "No transpose", m, k, &i__1, &c_b1,
1029 &c__[c_offset], ldc, &v[v_offset], ldv, &c_b1, &
1030 work[work_offset], ldwork)
1034 /* W := W * T or W * T**H */
1036 ztrmm_("Right", "Lower", trans, "Non-unit", m, k, &c_b1, &t[
1037 t_offset], ldt, &work[work_offset], ldwork);
1039 /* C := C - W * V**H */
1043 /* C1 := C1 - W * V1**H */
1046 z__1.r = -1., z__1.i = 0.;
1047 zgemm_("No transpose", "Conjugate transpose", m, &i__1, k,
1048 &z__1, &work[work_offset], ldwork, &v[v_offset],
1049 ldv, &c_b1, &c__[c_offset], ldc);
1052 /* W := W * V2**H */
1054 ztrmm_("Right", "Upper", "Conjugate transpose", "Unit", m, k,
1055 &c_b1, &v[*n - *k + 1 + v_dim1], ldv, &work[
1056 work_offset], ldwork);
1061 for (j = 1; j <= i__1; ++j) {
1063 for (i__ = 1; i__ <= i__2; ++i__) {
1064 i__3 = i__ + (*n - *k + j) * c_dim1;
1065 i__4 = i__ + (*n - *k + j) * c_dim1;
1066 i__5 = i__ + j * work_dim1;
1067 z__1.r = c__[i__4].r - work[i__5].r, z__1.i = c__[
1068 i__4].i - work[i__5].i;
1069 c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;
1077 } else if (lsame_(storev, "R")) {
1079 if (lsame_(direct, "F")) {
1081 /* Let V = ( V1 V2 ) (V1: first K columns) */
1082 /* where V1 is unit upper triangular. */
1084 if (lsame_(side, "L")) {
1086 /* Form H * C or H**H * C where C = ( C1 ) */
1089 /* W := C**H * V**H = (C1**H * V1**H + C2**H * V2**H) (stored in WORK) */
1094 for (j = 1; j <= i__1; ++j) {
1095 zcopy_(n, &c__[j + c_dim1], ldc, &work[j * work_dim1 + 1],
1097 zlacgv_(n, &work[j * work_dim1 + 1], &c__1);
1101 /* W := W * V1**H */
1103 ztrmm_("Right", "Upper", "Conjugate transpose", "Unit", n, k,
1104 &c_b1, &v[v_offset], ldv, &work[work_offset], ldwork);
1107 /* W := W + C2**H * V2**H */
1110 zgemm_("Conjugate transpose", "Conjugate transpose", n, k,
1111 &i__1, &c_b1, &c__[*k + 1 + c_dim1], ldc, &v[(*k
1112 + 1) * v_dim1 + 1], ldv, &c_b1, &work[work_offset]
1116 /* W := W * T**H or W * T */
1118 ztrmm_("Right", "Upper", transt, "Non-unit", n, k, &c_b1, &t[
1119 t_offset], ldt, &work[work_offset], ldwork);
1121 /* C := C - V**H * W**H */
1125 /* C2 := C2 - V2**H * W**H */
1128 z__1.r = -1., z__1.i = 0.;
1129 zgemm_("Conjugate transpose", "Conjugate transpose", &
1130 i__1, n, k, &z__1, &v[(*k + 1) * v_dim1 + 1], ldv,
1131 &work[work_offset], ldwork, &c_b1, &c__[*k + 1 +
1137 ztrmm_("Right", "Upper", "No transpose", "Unit", n, k, &c_b1,
1138 &v[v_offset], ldv, &work[work_offset], ldwork);
1140 /* C1 := C1 - W**H */
1143 for (j = 1; j <= i__1; ++j) {
1145 for (i__ = 1; i__ <= i__2; ++i__) {
1146 i__3 = j + i__ * c_dim1;
1147 i__4 = j + i__ * c_dim1;
1148 d_cnjg(&z__2, &work[i__ + j * work_dim1]);
1149 z__1.r = c__[i__4].r - z__2.r, z__1.i = c__[i__4].i -
1151 c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;
1157 } else if (lsame_(side, "R")) {
1159 /* Form C * H or C * H**H where C = ( C1 C2 ) */
1161 /* W := C * V**H = (C1*V1**H + C2*V2**H) (stored in WORK) */
1166 for (j = 1; j <= i__1; ++j) {
1167 zcopy_(m, &c__[j * c_dim1 + 1], &c__1, &work[j *
1168 work_dim1 + 1], &c__1);
1172 /* W := W * V1**H */
1174 ztrmm_("Right", "Upper", "Conjugate transpose", "Unit", m, k,
1175 &c_b1, &v[v_offset], ldv, &work[work_offset], ldwork);
1178 /* W := W + C2 * V2**H */
1181 zgemm_("No transpose", "Conjugate transpose", m, k, &i__1,
1182 &c_b1, &c__[(*k + 1) * c_dim1 + 1], ldc, &v[(*k
1183 + 1) * v_dim1 + 1], ldv, &c_b1, &work[work_offset]
1187 /* W := W * T or W * T**H */
1189 ztrmm_("Right", "Upper", trans, "Non-unit", m, k, &c_b1, &t[
1190 t_offset], ldt, &work[work_offset], ldwork);
1192 /* C := C - W * V */
1196 /* C2 := C2 - W * V2 */
1199 z__1.r = -1., z__1.i = 0.;
1200 zgemm_("No transpose", "No transpose", m, &i__1, k, &z__1,
1201 &work[work_offset], ldwork, &v[(*k + 1) * v_dim1
1202 + 1], ldv, &c_b1, &c__[(*k + 1) * c_dim1 + 1],
1208 ztrmm_("Right", "Upper", "No transpose", "Unit", m, k, &c_b1,
1209 &v[v_offset], ldv, &work[work_offset], ldwork);
1214 for (j = 1; j <= i__1; ++j) {
1216 for (i__ = 1; i__ <= i__2; ++i__) {
1217 i__3 = i__ + j * c_dim1;
1218 i__4 = i__ + j * c_dim1;
1219 i__5 = i__ + j * work_dim1;
1220 z__1.r = c__[i__4].r - work[i__5].r, z__1.i = c__[
1221 i__4].i - work[i__5].i;
1222 c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;
1232 /* Let V = ( V1 V2 ) (V2: last K columns) */
1233 /* where V2 is unit lower triangular. */
1235 if (lsame_(side, "L")) {
1237 /* Form H * C or H**H * C where C = ( C1 ) */
1240 /* W := C**H * V**H = (C1**H * V1**H + C2**H * V2**H) (stored in WORK) */
1245 for (j = 1; j <= i__1; ++j) {
1246 zcopy_(n, &c__[*m - *k + j + c_dim1], ldc, &work[j *
1247 work_dim1 + 1], &c__1);
1248 zlacgv_(n, &work[j * work_dim1 + 1], &c__1);
1252 /* W := W * V2**H */
1254 ztrmm_("Right", "Lower", "Conjugate transpose", "Unit", n, k,
1255 &c_b1, &v[(*m - *k + 1) * v_dim1 + 1], ldv, &work[
1256 work_offset], ldwork);
1259 /* W := W + C1**H * V1**H */
1262 zgemm_("Conjugate transpose", "Conjugate transpose", n, k,
1263 &i__1, &c_b1, &c__[c_offset], ldc, &v[v_offset],
1264 ldv, &c_b1, &work[work_offset], ldwork);
1267 /* W := W * T**H or W * T */
1269 ztrmm_("Right", "Lower", transt, "Non-unit", n, k, &c_b1, &t[
1270 t_offset], ldt, &work[work_offset], ldwork);
1272 /* C := C - V**H * W**H */
1276 /* C1 := C1 - V1**H * W**H */
1279 z__1.r = -1., z__1.i = 0.;
1280 zgemm_("Conjugate transpose", "Conjugate transpose", &
1281 i__1, n, k, &z__1, &v[v_offset], ldv, &work[
1282 work_offset], ldwork, &c_b1, &c__[c_offset], ldc);
1287 ztrmm_("Right", "Lower", "No transpose", "Unit", n, k, &c_b1,
1288 &v[(*m - *k + 1) * v_dim1 + 1], ldv, &work[
1289 work_offset], ldwork);
1291 /* C2 := C2 - W**H */
1294 for (j = 1; j <= i__1; ++j) {
1296 for (i__ = 1; i__ <= i__2; ++i__) {
1297 i__3 = *m - *k + j + i__ * c_dim1;
1298 i__4 = *m - *k + j + i__ * c_dim1;
1299 d_cnjg(&z__2, &work[i__ + j * work_dim1]);
1300 z__1.r = c__[i__4].r - z__2.r, z__1.i = c__[i__4].i -
1302 c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;
1308 } else if (lsame_(side, "R")) {
1310 /* Form C * H or C * H**H where C = ( C1 C2 ) */
1312 /* W := C * V**H = (C1*V1**H + C2*V2**H) (stored in WORK) */
1317 for (j = 1; j <= i__1; ++j) {
1318 zcopy_(m, &c__[(*n - *k + j) * c_dim1 + 1], &c__1, &work[
1319 j * work_dim1 + 1], &c__1);
1323 /* W := W * V2**H */
1325 ztrmm_("Right", "Lower", "Conjugate transpose", "Unit", m, k,
1326 &c_b1, &v[(*n - *k + 1) * v_dim1 + 1], ldv, &work[
1327 work_offset], ldwork);
1330 /* W := W + C1 * V1**H */
1333 zgemm_("No transpose", "Conjugate transpose", m, k, &i__1,
1334 &c_b1, &c__[c_offset], ldc, &v[v_offset], ldv, &
1335 c_b1, &work[work_offset], ldwork);
1338 /* W := W * T or W * T**H */
1340 ztrmm_("Right", "Lower", trans, "Non-unit", m, k, &c_b1, &t[
1341 t_offset], ldt, &work[work_offset], ldwork);
1343 /* C := C - W * V */
1347 /* C1 := C1 - W * V1 */
1350 z__1.r = -1., z__1.i = 0.;
1351 zgemm_("No transpose", "No transpose", m, &i__1, k, &z__1,
1352 &work[work_offset], ldwork, &v[v_offset], ldv, &
1353 c_b1, &c__[c_offset], ldc)
1359 ztrmm_("Right", "Lower", "No transpose", "Unit", m, k, &c_b1,
1360 &v[(*n - *k + 1) * v_dim1 + 1], ldv, &work[
1361 work_offset], ldwork);
1366 for (j = 1; j <= i__1; ++j) {
1368 for (i__ = 1; i__ <= i__2; ++i__) {
1369 i__3 = i__ + (*n - *k + j) * c_dim1;
1370 i__4 = i__ + (*n - *k + j) * c_dim1;
1371 i__5 = i__ + j * work_dim1;
1372 z__1.r = c__[i__4].r - work[i__5].r, z__1.i = c__[
1373 i__4].i - work[i__5].i;
1374 c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;