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 doublereal c_b10 = 1.;
517 /* > \brief \b DORM22 multiplies a general matrix by a banded orthogonal matrix. */
519 /* =========== DOCUMENTATION =========== */
521 /* Online html documentation available at */
522 /* http://www.netlib.org/lapack/explore-html/ */
525 /* > Download DORM22 + dependencies */
526 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dorm22.
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dorm22.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dorm22.
540 /* SUBROUTINE DORM22( SIDE, TRANS, M, N, N1, N2, Q, LDQ, C, LDC, */
541 /* $ WORK, LWORK, INFO ) */
543 /* CHARACTER SIDE, TRANS */
544 /* INTEGER M, N, N1, N2, LDQ, LDC, LWORK, INFO */
545 /* DOUBLE PRECISION Q( LDQ, * ), C( LDC, * ), WORK( * ) */
553 /* > DORM22 overwrites the general real M-by-N matrix C with */
555 /* > SIDE = 'L' SIDE = 'R' */
556 /* > TRANS = 'N': Q * C C * Q */
557 /* > TRANS = 'T': Q**T * C C * Q**T */
559 /* > where Q is a real orthogonal matrix of order NQ, with NQ = M if */
560 /* > SIDE = 'L' and NQ = N if SIDE = 'R'. */
561 /* > The orthogonal matrix Q processes a 2-by-2 block structure */
567 /* > where Q12 is an N1-by-N1 lower triangular matrix and Q21 is an */
568 /* > N2-by-N2 upper triangular matrix. */
574 /* > \param[in] SIDE */
576 /* > SIDE is CHARACTER*1 */
577 /* > = 'L': apply Q or Q**T from the Left; */
578 /* > = 'R': apply Q or Q**T from the Right. */
581 /* > \param[in] TRANS */
583 /* > TRANS is CHARACTER*1 */
584 /* > = 'N': apply Q (No transpose); */
585 /* > = 'C': apply Q**T (Conjugate transpose). */
591 /* > The number of rows of the matrix C. M >= 0. */
597 /* > The number of columns of the matrix C. N >= 0. */
600 /* > \param[in] N1 */
601 /* > \param[in] N2 */
603 /* > N1 is INTEGER */
604 /* > N2 is INTEGER */
605 /* > The dimension of Q12 and Q21, respectively. N1, N2 >= 0. */
606 /* > The following requirement must be satisfied: */
607 /* > N1 + N2 = M if SIDE = 'L' and N1 + N2 = N if SIDE = 'R'. */
612 /* > Q is DOUBLE PRECISION array, dimension */
613 /* > (LDQ,M) if SIDE = 'L' */
614 /* > (LDQ,N) if SIDE = 'R' */
617 /* > \param[in] LDQ */
619 /* > LDQ is INTEGER */
620 /* > The leading dimension of the array Q. */
621 /* > LDQ >= f2cmax(1,M) if SIDE = 'L'; LDQ >= f2cmax(1,N) if SIDE = 'R'. */
624 /* > \param[in,out] C */
626 /* > C is DOUBLE PRECISION array, dimension (LDC,N) */
627 /* > On entry, the M-by-N matrix C. */
628 /* > On exit, C is overwritten by Q*C or Q**T*C or C*Q**T or C*Q. */
631 /* > \param[in] LDC */
633 /* > LDC is INTEGER */
634 /* > The leading dimension of the array C. LDC >= f2cmax(1,M). */
637 /* > \param[out] WORK */
639 /* > WORK is DOUBLE PRECISION array, dimension (MAX(1,LWORK)) */
640 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
643 /* > \param[in] LWORK */
645 /* > LWORK is INTEGER */
646 /* > The dimension of the array WORK. */
647 /* > If SIDE = 'L', LWORK >= f2cmax(1,N); */
648 /* > if SIDE = 'R', LWORK >= f2cmax(1,M). */
649 /* > For optimum performance LWORK >= M*N. */
651 /* > If LWORK = -1, then a workspace query is assumed; the routine */
652 /* > only calculates the optimal size of the WORK array, returns */
653 /* > this value as the first entry of the WORK array, and no error */
654 /* > message related to LWORK is issued by XERBLA. */
657 /* > \param[out] INFO */
659 /* > INFO is INTEGER */
660 /* > = 0: successful exit */
661 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
668 /* > \author Univ. of Tennessee */
669 /* > \author Univ. of California Berkeley */
670 /* > \author Univ. of Colorado Denver */
671 /* > \author NAG Ltd. */
673 /* > \date January 2015 */
675 /* > \ingroup complexOTHERcomputational */
677 /* ===================================================================== */
678 /* Subroutine */ int dorm22_(char *side, char *trans, integer *m, integer *n,
679 integer *n1, integer *n2, doublereal *q, integer *ldq, doublereal *
680 c__, integer *ldc, doublereal *work, integer *lwork, integer *info)
682 /* System generated locals */
683 integer q_dim1, q_offset, c_dim1, c_offset, i__1, i__2, i__3, i__4;
685 /* Local variables */
688 extern /* Subroutine */ int dgemm_(char *, char *, integer *, integer *,
689 integer *, doublereal *, doublereal *, integer *, doublereal *,
690 integer *, doublereal *, doublereal *, integer *);
691 extern logical lsame_(char *, char *);
692 extern /* Subroutine */ int dtrmm_(char *, char *, char *, char *,
693 integer *, integer *, doublereal *, doublereal *, integer *,
694 doublereal *, integer *);
696 extern /* Subroutine */ int dlacpy_(char *, integer *, integer *,
697 doublereal *, integer *, doublereal *, integer *),
698 xerbla_(char *, integer *, ftnlen);
700 integer ldwork, lwkopt;
705 /* -- LAPACK computational routine (version 3.7.1) -- */
706 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
707 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
712 /* ===================================================================== */
716 /* Test the input arguments */
718 /* Parameter adjustments */
720 q_offset = 1 + q_dim1 * 1;
723 c_offset = 1 + c_dim1 * 1;
729 left = lsame_(side, "L");
730 notran = lsame_(trans, "N");
731 lquery = *lwork == -1;
733 /* NQ is the order of Q; */
734 /* NW is the minimum dimension of WORK. */
742 if (*n1 == 0 || *n2 == 0) {
745 if (! left && ! lsame_(side, "R")) {
747 } else if (! lsame_(trans, "N") && ! lsame_(trans,
754 } else if (*n1 < 0 || *n1 + *n2 != nq) {
756 } else if (*n2 < 0) {
758 } else if (*ldq < f2cmax(1,nq)) {
760 } else if (*ldc < f2cmax(1,*m)) {
762 } else if (*lwork < nw && ! lquery) {
768 work[1] = (doublereal) lwkopt;
773 xerbla_("DORM22", &i__1, (ftnlen)6);
779 /* Quick return if possible */
781 if (*m == 0 || *n == 0) {
786 /* Degenerate cases (N1 = 0 or N2 = 0) are handled using DTRMM. */
789 dtrmm_(side, "Upper", trans, "Non-Unit", m, n, &c_b10, &q[q_offset],
790 ldq, &c__[c_offset], ldc);
793 } else if (*n2 == 0) {
794 dtrmm_(side, "Lower", trans, "Non-Unit", m, n, &c_b10, &q[q_offset],
795 ldq, &c__[c_offset], ldc);
800 /* Compute the largest chunk size available from the workspace. */
803 i__1 = 1, i__2 = f2cmin(*lwork,lwkopt) / nq;
804 nb = f2cmax(i__1,i__2);
810 for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
812 i__3 = nb, i__4 = *n - i__ + 1;
813 len = f2cmin(i__3,i__4);
816 /* Multiply bottom part of C by Q12. */
818 dlacpy_("All", n1, &len, &c__[*n2 + 1 + i__ * c_dim1], ldc, &
820 dtrmm_("Left", "Lower", "No Transpose", "Non-Unit", n1, &len,
821 &c_b10, &q[(*n2 + 1) * q_dim1 + 1], ldq, &work[1], &
824 /* Multiply top part of C by Q11. */
826 dgemm_("No Transpose", "No Transpose", n1, &len, n2, &c_b10, &
827 q[q_offset], ldq, &c__[i__ * c_dim1 + 1], ldc, &c_b10,
830 /* Multiply top part of C by Q21. */
832 dlacpy_("All", n2, &len, &c__[i__ * c_dim1 + 1], ldc, &work[*
834 dtrmm_("Left", "Upper", "No Transpose", "Non-Unit", n2, &len,
835 &c_b10, &q[*n1 + 1 + q_dim1], ldq, &work[*n1 + 1], &
838 /* Multiply bottom part of C by Q22. */
840 dgemm_("No Transpose", "No Transpose", n2, &len, n1, &c_b10, &
841 q[*n1 + 1 + (*n2 + 1) * q_dim1], ldq, &c__[*n2 + 1 +
842 i__ * c_dim1], ldc, &c_b10, &work[*n1 + 1], &ldwork);
844 /* Copy everything back. */
846 dlacpy_("All", m, &len, &work[1], &ldwork, &c__[i__ * c_dim1
852 for (i__ = 1; i__1 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__1) {
854 i__3 = nb, i__4 = *n - i__ + 1;
855 len = f2cmin(i__3,i__4);
858 /* Multiply bottom part of C by Q21**T. */
860 dlacpy_("All", n2, &len, &c__[*n1 + 1 + i__ * c_dim1], ldc, &
862 dtrmm_("Left", "Upper", "Transpose", "Non-Unit", n2, &len, &
863 c_b10, &q[*n1 + 1 + q_dim1], ldq, &work[1], &ldwork);
865 /* Multiply top part of C by Q11**T. */
867 dgemm_("Transpose", "No Transpose", n2, &len, n1, &c_b10, &q[
868 q_offset], ldq, &c__[i__ * c_dim1 + 1], ldc, &c_b10, &
871 /* Multiply top part of C by Q12**T. */
873 dlacpy_("All", n1, &len, &c__[i__ * c_dim1 + 1], ldc, &work[*
875 dtrmm_("Left", "Lower", "Transpose", "Non-Unit", n1, &len, &
876 c_b10, &q[(*n2 + 1) * q_dim1 + 1], ldq, &work[*n2 + 1]
880 /* Multiply bottom part of C by Q22**T. */
882 dgemm_("Transpose", "No Transpose", n1, &len, n2, &c_b10, &q[*
883 n1 + 1 + (*n2 + 1) * q_dim1], ldq, &c__[*n1 + 1 + i__
884 * c_dim1], ldc, &c_b10, &work[*n2 + 1], &ldwork);
886 /* Copy everything back. */
888 dlacpy_("All", m, &len, &work[1], &ldwork, &c__[i__ * c_dim1
896 for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
898 i__3 = nb, i__4 = *m - i__ + 1;
899 len = f2cmin(i__3,i__4);
902 /* Multiply right part of C by Q21. */
904 dlacpy_("All", &len, n2, &c__[i__ + (*n1 + 1) * c_dim1], ldc,
906 dtrmm_("Right", "Upper", "No Transpose", "Non-Unit", &len, n2,
907 &c_b10, &q[*n1 + 1 + q_dim1], ldq, &work[1], &ldwork);
909 /* Multiply left part of C by Q11. */
911 dgemm_("No Transpose", "No Transpose", &len, n2, n1, &c_b10, &
912 c__[i__ + c_dim1], ldc, &q[q_offset], ldq, &c_b10, &
915 /* Multiply left part of C by Q12. */
917 dlacpy_("All", &len, n1, &c__[i__ + c_dim1], ldc, &work[*n2 *
918 ldwork + 1], &ldwork);
919 dtrmm_("Right", "Lower", "No Transpose", "Non-Unit", &len, n1,
920 &c_b10, &q[(*n2 + 1) * q_dim1 + 1], ldq, &work[*n2 *
921 ldwork + 1], &ldwork);
923 /* Multiply right part of C by Q22. */
925 dgemm_("No Transpose", "No Transpose", &len, n1, n2, &c_b10, &
926 c__[i__ + (*n1 + 1) * c_dim1], ldc, &q[*n1 + 1 + (*n2
927 + 1) * q_dim1], ldq, &c_b10, &work[*n2 * ldwork + 1],
930 /* Copy everything back. */
932 dlacpy_("All", &len, n, &work[1], &ldwork, &c__[i__ + c_dim1],
938 for (i__ = 1; i__1 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__1) {
940 i__3 = nb, i__4 = *m - i__ + 1;
941 len = f2cmin(i__3,i__4);
944 /* Multiply right part of C by Q12**T. */
946 dlacpy_("All", &len, n1, &c__[i__ + (*n2 + 1) * c_dim1], ldc,
948 dtrmm_("Right", "Lower", "Transpose", "Non-Unit", &len, n1, &
949 c_b10, &q[(*n2 + 1) * q_dim1 + 1], ldq, &work[1], &
952 /* Multiply left part of C by Q11**T. */
954 dgemm_("No Transpose", "Transpose", &len, n1, n2, &c_b10, &
955 c__[i__ + c_dim1], ldc, &q[q_offset], ldq, &c_b10, &
958 /* Multiply left part of C by Q21**T. */
960 dlacpy_("All", &len, n2, &c__[i__ + c_dim1], ldc, &work[*n1 *
961 ldwork + 1], &ldwork);
962 dtrmm_("Right", "Upper", "Transpose", "Non-Unit", &len, n2, &
963 c_b10, &q[*n1 + 1 + q_dim1], ldq, &work[*n1 * ldwork
966 /* Multiply right part of C by Q22**T. */
968 dgemm_("No Transpose", "Transpose", &len, n2, n1, &c_b10, &
969 c__[i__ + (*n2 + 1) * c_dim1], ldc, &q[*n1 + 1 + (*n2
970 + 1) * q_dim1], ldq, &c_b10, &work[*n1 * ldwork + 1],
973 /* Copy everything back. */
975 dlacpy_("All", &len, n, &work[1], &ldwork, &c__[i__ + c_dim1],
981 work[1] = (doublereal) lwkopt;