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 integer c_n1 = -1;
517 static integer c__2 = 2;
518 static integer c__65 = 65;
520 /* > \brief \b SORMLQ */
522 /* =========== DOCUMENTATION =========== */
524 /* Online html documentation available at */
525 /* http://www.netlib.org/lapack/explore-html/ */
528 /* > Download SORMLQ + dependencies */
529 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/sormlq.
532 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/sormlq.
535 /* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/sormlq.
543 /* SUBROUTINE SORMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, */
544 /* WORK, LWORK, INFO ) */
546 /* CHARACTER SIDE, TRANS */
547 /* INTEGER INFO, K, LDA, LDC, LWORK, M, N */
548 /* REAL A( LDA, * ), C( LDC, * ), TAU( * ), */
552 /* > \par Purpose: */
557 /* > SORMLQ overwrites the general real M-by-N matrix C with */
559 /* > SIDE = 'L' SIDE = 'R' */
560 /* > TRANS = 'N': Q * C C * Q */
561 /* > TRANS = 'T': Q**T * C C * Q**T */
563 /* > where Q is a real orthogonal matrix defined as the product of k */
564 /* > elementary reflectors */
566 /* > Q = H(k) . . . H(2) H(1) */
568 /* > as returned by SGELQF. Q is of order M if SIDE = 'L' and of order N */
569 /* > if SIDE = 'R'. */
575 /* > \param[in] SIDE */
577 /* > SIDE is CHARACTER*1 */
578 /* > = 'L': apply Q or Q**T from the Left; */
579 /* > = 'R': apply Q or Q**T from the Right. */
582 /* > \param[in] TRANS */
584 /* > TRANS is CHARACTER*1 */
585 /* > = 'N': No transpose, apply Q; */
586 /* > = 'T': Transpose, apply Q**T. */
592 /* > The number of rows of the matrix C. M >= 0. */
598 /* > The number of columns of the matrix C. N >= 0. */
604 /* > The number of elementary reflectors whose product defines */
605 /* > the matrix Q. */
606 /* > If SIDE = 'L', M >= K >= 0; */
607 /* > if SIDE = 'R', N >= K >= 0. */
612 /* > A is REAL array, dimension */
613 /* > (LDA,M) if SIDE = 'L', */
614 /* > (LDA,N) if SIDE = 'R' */
615 /* > The i-th row must contain the vector which defines the */
616 /* > elementary reflector H(i), for i = 1,2,...,k, as returned by */
617 /* > SGELQF in the first k rows of its array argument A. */
620 /* > \param[in] LDA */
622 /* > LDA is INTEGER */
623 /* > The leading dimension of the array A. LDA >= f2cmax(1,K). */
626 /* > \param[in] TAU */
628 /* > TAU is REAL array, dimension (K) */
629 /* > TAU(i) must contain the scalar factor of the elementary */
630 /* > reflector H(i), as returned by SGELQF. */
633 /* > \param[in,out] C */
635 /* > C is REAL array, dimension (LDC,N) */
636 /* > On entry, the M-by-N matrix C. */
637 /* > On exit, C is overwritten by Q*C or Q**T*C or C*Q**T or C*Q. */
640 /* > \param[in] LDC */
642 /* > LDC is INTEGER */
643 /* > The leading dimension of the array C. LDC >= f2cmax(1,M). */
646 /* > \param[out] WORK */
648 /* > WORK is REAL array, dimension (MAX(1,LWORK)) */
649 /* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
652 /* > \param[in] LWORK */
654 /* > LWORK is INTEGER */
655 /* > The dimension of the array WORK. */
656 /* > If SIDE = 'L', LWORK >= f2cmax(1,N); */
657 /* > if SIDE = 'R', LWORK >= f2cmax(1,M). */
658 /* > For good performance, LWORK should generally be larger. */
660 /* > If LWORK = -1, then a workspace query is assumed; the routine */
661 /* > only calculates the optimal size of the WORK array, returns */
662 /* > this value as the first entry of the WORK array, and no error */
663 /* > message related to LWORK is issued by XERBLA. */
666 /* > \param[out] INFO */
668 /* > INFO is INTEGER */
669 /* > = 0: successful exit */
670 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
676 /* > \author Univ. of Tennessee */
677 /* > \author Univ. of California Berkeley */
678 /* > \author Univ. of Colorado Denver */
679 /* > \author NAG Ltd. */
681 /* > \date December 2016 */
683 /* > \ingroup realOTHERcomputational */
685 /* ===================================================================== */
686 /* Subroutine */ int sormlq_(char *side, char *trans, integer *m, integer *n,
687 integer *k, real *a, integer *lda, real *tau, real *c__, integer *ldc,
688 real *work, integer *lwork, integer *info)
690 /* System generated locals */
692 integer a_dim1, a_offset, c_dim1, c_offset, i__1, i__2, i__3[2], i__4,
696 /* Local variables */
699 extern logical lsame_(char *, char *);
700 integer nbmin, iinfo, i1, i2, i3, ib, ic, jc;
701 extern /* Subroutine */ int sorml2_(char *, char *, integer *, integer *,
702 integer *, real *, integer *, real *, real *, integer *, real *,
704 integer nb, mi, ni, nq, nw;
705 extern /* Subroutine */ int slarfb_(char *, char *, char *, char *,
706 integer *, integer *, integer *, real *, integer *, real *,
707 integer *, real *, integer *, real *, integer *), xerbla_(char *, integer *, ftnlen);
708 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
709 integer *, integer *, ftnlen, ftnlen);
710 extern /* Subroutine */ int slarft_(char *, char *, integer *, integer *,
711 real *, integer *, real *, real *, integer *);
720 /* -- LAPACK computational routine (version 3.7.0) -- */
721 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
722 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
726 /* ===================================================================== */
729 /* Test the input arguments */
731 /* Parameter adjustments */
733 a_offset = 1 + a_dim1 * 1;
737 c_offset = 1 + c_dim1 * 1;
743 left = lsame_(side, "L");
744 notran = lsame_(trans, "N");
745 lquery = *lwork == -1;
747 /* NQ is the order of Q and NW is the minimum dimension of WORK */
756 if (! left && ! lsame_(side, "R")) {
758 } else if (! notran && ! lsame_(trans, "T")) {
764 } else if (*k < 0 || *k > nq) {
766 } else if (*lda < f2cmax(1,*k)) {
768 } else if (*ldc < f2cmax(1,*m)) {
770 } else if (*lwork < f2cmax(1,nw) && ! lquery) {
776 /* Compute the workspace requirements */
779 /* Writing concatenation */
780 i__3[0] = 1, a__1[0] = side;
781 i__3[1] = 1, a__1[1] = trans;
782 s_cat(ch__1, a__1, i__3, &c__2, (ftnlen)2);
783 i__1 = 64, i__2 = ilaenv_(&c__1, "SORMLQ", ch__1, m, n, k, &c_n1, (
784 ftnlen)6, (ftnlen)2);
785 nb = f2cmin(i__1,i__2);
786 lwkopt = f2cmax(1,nw) * nb + 4160;
787 work[1] = (real) lwkopt;
792 xerbla_("SORMLQ", &i__1, (ftnlen)6);
798 /* Quick return if possible */
800 if (*m == 0 || *n == 0 || *k == 0) {
807 if (nb > 1 && nb < *k) {
808 if (*lwork < nw * nb + 4160) {
809 nb = (*lwork - 4160) / ldwork;
811 /* Writing concatenation */
812 i__3[0] = 1, a__1[0] = side;
813 i__3[1] = 1, a__1[1] = trans;
814 s_cat(ch__1, a__1, i__3, &c__2, (ftnlen)2);
815 i__1 = 2, i__2 = ilaenv_(&c__2, "SORMLQ", ch__1, m, n, k, &c_n1, (
816 ftnlen)6, (ftnlen)2);
817 nbmin = f2cmax(i__1,i__2);
821 if (nb < nbmin || nb >= *k) {
823 /* Use unblocked code */
825 sorml2_(side, trans, m, n, k, &a[a_offset], lda, &tau[1], &c__[
826 c_offset], ldc, &work[1], &iinfo);
829 /* Use blocked code */
832 if (left && notran || ! left && ! notran) {
837 i1 = (*k - 1) / nb * nb + 1;
851 *(unsigned char *)transt = 'T';
853 *(unsigned char *)transt = 'N';
858 for (i__ = i1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
860 i__4 = nb, i__5 = *k - i__ + 1;
861 ib = f2cmin(i__4,i__5);
863 /* Form the triangular factor of the block reflector */
864 /* H = H(i) H(i+1) . . . H(i+ib-1) */
867 slarft_("Forward", "Rowwise", &i__4, &ib, &a[i__ + i__ * a_dim1],
868 lda, &tau[i__], &work[iwt], &c__65);
871 /* H or H**T is applied to C(i:m,1:n) */
877 /* H or H**T is applied to C(1:m,i:n) */
883 /* Apply H or H**T */
885 slarfb_(side, transt, "Forward", "Rowwise", &mi, &ni, &ib, &a[i__
886 + i__ * a_dim1], lda, &work[iwt], &c__65, &c__[ic + jc *
887 c_dim1], ldc, &work[1], &ldwork);
891 work[1] = (real) lwkopt;