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;
519 /* > \brief \b SGELQ */
524 /* SUBROUTINE SGELQ( M, N, A, LDA, T, TSIZE, WORK, LWORK, */
527 /* INTEGER INFO, LDA, M, N, TSIZE, LWORK */
528 /* REAL A( LDA, * ), T( * ), WORK( * ) */
531 /* > \par Purpose: */
536 /* > SGELQ computes an LQ factorization of a real M-by-N matrix A: */
538 /* > A = ( L 0 ) * Q */
542 /* > Q is a N-by-N orthogonal matrix; */
543 /* > L is a lower-triangular M-by-M matrix; */
544 /* > 0 is a M-by-(N-M) zero matrix, if M < N. */
554 /* > The number of rows of the matrix A. M >= 0. */
560 /* > The number of columns of the matrix A. N >= 0. */
563 /* > \param[in,out] A */
565 /* > A is REAL array, dimension (LDA,N) */
566 /* > On entry, the M-by-N matrix A. */
567 /* > On exit, the elements on and below the diagonal of the array */
568 /* > contain the M-by-f2cmin(M,N) lower trapezoidal matrix L */
569 /* > (L is lower triangular if M <= N); */
570 /* > the elements above the diagonal are used to store part of the */
571 /* > data structure to represent Q. */
574 /* > \param[in] LDA */
576 /* > LDA is INTEGER */
577 /* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
580 /* > \param[out] T */
582 /* > T is REAL array, dimension (MAX(5,TSIZE)) */
583 /* > On exit, if INFO = 0, T(1) returns optimal (or either minimal */
584 /* > or optimal, if query is assumed) TSIZE. See TSIZE for details. */
585 /* > Remaining T contains part of the data structure used to represent Q. */
586 /* > If one wants to apply or construct Q, then one needs to keep T */
587 /* > (in addition to A) and pass it to further subroutines. */
590 /* > \param[in] TSIZE */
592 /* > TSIZE is INTEGER */
593 /* > If TSIZE >= 5, the dimension of the array T. */
594 /* > If TSIZE = -1 or -2, then a workspace query is assumed. The routine */
595 /* > only calculates the sizes of the T and WORK arrays, returns these */
596 /* > values as the first entries of the T and WORK arrays, and no error */
597 /* > message related to T or WORK is issued by XERBLA. */
598 /* > If TSIZE = -1, the routine calculates optimal size of T for the */
599 /* > optimum performance and returns this value in T(1). */
600 /* > If TSIZE = -2, the routine calculates minimal size of T and */
601 /* > returns this value in T(1). */
604 /* > \param[out] WORK */
606 /* > (workspace) REAL array, dimension (MAX(1,LWORK)) */
607 /* > On exit, if INFO = 0, WORK(1) contains optimal (or either minimal */
608 /* > or optimal, if query was assumed) LWORK. */
609 /* > See LWORK for details. */
612 /* > \param[in] LWORK */
614 /* > LWORK is INTEGER */
615 /* > The dimension of the array WORK. */
616 /* > If LWORK = -1 or -2, then a workspace query is assumed. The routine */
617 /* > only calculates the sizes of the T and WORK arrays, returns these */
618 /* > values as the first entries of the T and WORK arrays, and no error */
619 /* > message related to T or WORK is issued by XERBLA. */
620 /* > If LWORK = -1, the routine calculates optimal size of WORK for the */
621 /* > optimal performance and returns this value in WORK(1). */
622 /* > If LWORK = -2, the routine calculates minimal size of WORK and */
623 /* > returns this value in WORK(1). */
626 /* > \param[out] INFO */
628 /* > INFO is INTEGER */
629 /* > = 0: successful exit */
630 /* > < 0: if INFO = -i, the i-th argument had an illegal value */
636 /* > \author Univ. of Tennessee */
637 /* > \author Univ. of California Berkeley */
638 /* > \author Univ. of Colorado Denver */
639 /* > \author NAG Ltd. */
641 /* > \par Further Details */
642 /* ==================== */
646 /* > The goal of the interface is to give maximum freedom to the developers for */
647 /* > creating any LQ factorization algorithm they wish. The triangular */
648 /* > (trapezoidal) L has to be stored in the lower part of A. The lower part of A */
649 /* > and the array T can be used to store any relevant information for applying or */
650 /* > constructing the Q factor. The WORK array can safely be discarded after exit. */
652 /* > Caution: One should not expect the sizes of T and WORK to be the same from one */
653 /* > LAPACK implementation to the other, or even from one execution to the other. */
654 /* > A workspace query (for T and WORK) is needed at each execution. However, */
655 /* > for a given execution, the size of T and WORK are fixed and will not change */
656 /* > from one query to the next. */
660 /* > \par Further Details particular to this LAPACK implementation: */
661 /* ============================================================== */
665 /* > These details are particular for this LAPACK implementation. Users should not */
666 /* > take them for granted. These details may change in the future, and are not likely */
667 /* > true for another LAPACK implementation. These details are relevant if one wants */
668 /* > to try to understand the code. They are not part of the interface. */
670 /* > In this version, */
672 /* > T(2): row block size (MB) */
673 /* > T(3): column block size (NB) */
674 /* > T(6:TSIZE): data structure needed for Q, computed by */
675 /* > SLASWLQ or SGELQT */
677 /* > Depending on the matrix dimensions M and N, and row and column */
678 /* > block sizes MB and NB returned by ILAENV, SGELQ will use either */
679 /* > SLASWLQ (if the matrix is short-and-wide) or SGELQT to compute */
680 /* > the LQ factorization. */
683 /* ===================================================================== */
684 /* Subroutine */ int sgelq_(integer *m, integer *n, real *a, integer *lda,
685 real *t, integer *tsize, real *work, integer *lwork, integer *info)
687 /* System generated locals */
688 integer a_dim1, a_offset, i__1, i__2;
690 /* Local variables */
692 integer lwmin, lwreq, lwopt, mb, nb, nblcks;
693 extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
694 extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
695 integer *, integer *, ftnlen, ftnlen);
696 extern /* Subroutine */ int sgelqt_(integer *, integer *, integer *, real
697 *, integer *, real *, integer *, real *, integer *);
698 logical lminws, lquery;
700 extern /* Subroutine */ int slaswlq_(integer *, integer *, integer *,
701 integer *, real *, integer *, real *, integer *, real *, integer *
705 /* -- LAPACK computational routine (version 3.9.0) -- */
706 /* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
707 /* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd. -- */
711 /* ===================================================================== */
714 /* Test the input arguments */
716 /* Parameter adjustments */
718 a_offset = 1 + a_dim1 * 1;
726 lquery = *tsize == -1 || *tsize == -2 || *lwork == -1 || *lwork == -2;
730 if (*tsize == -2 || *lwork == -2) {
739 /* Determine the block size */
741 if (f2cmin(*m,*n) > 0) {
742 mb = ilaenv_(&c__1, "SGELQ ", " ", m, n, &c__1, &c_n1, (ftnlen)6, (
744 nb = ilaenv_(&c__1, "SGELQ ", " ", m, n, &c__2, &c_n1, (ftnlen)6, (
750 if (mb > f2cmin(*m,*n) || mb < 1) {
753 if (nb > *n || nb <= *m) {
757 if (nb > *m && *n > *m) {
758 if ((*n - *m) % (nb - *m) == 0) {
759 nblcks = (*n - *m) / (nb - *m);
761 nblcks = (*n - *m) / (nb - *m) + 1;
767 /* Determine if the workspace size satisfies minimal size */
769 if (*n <= *m || nb <= *m || nb >= *n) {
770 lwmin = f2cmax(1,*n);
772 i__1 = 1, i__2 = mb * *n;
773 lwopt = f2cmax(i__1,i__2);
775 lwmin = f2cmax(1,*m);
777 i__1 = 1, i__2 = mb * *m;
778 lwopt = f2cmax(i__1,i__2);
782 i__1 = 1, i__2 = mb * *m * nblcks + 5;
783 if ((*tsize < f2cmax(i__1,i__2) || *lwork < lwopt) && *lwork >= lwmin && *
784 tsize >= mintsz && ! lquery) {
786 i__1 = 1, i__2 = mb * *m * nblcks + 5;
787 if (*tsize < f2cmax(i__1,i__2)) {
792 if (*lwork < lwopt) {
797 if (*n <= *m || nb <= *m || nb >= *n) {
799 i__1 = 1, i__2 = mb * *n;
800 lwreq = f2cmax(i__1,i__2);
803 i__1 = 1, i__2 = mb * *m;
804 lwreq = f2cmax(i__1,i__2);
811 } else if (*lda < f2cmax(1,*m)) {
813 } else /* if(complicated condition) */ {
815 i__1 = 1, i__2 = mb * *m * nblcks + 5;
816 if (*tsize < f2cmax(i__1,i__2) && ! lquery && ! lminws) {
818 } else if (*lwork < lwreq && ! lquery && ! lminws) {
825 t[1] = (real) mintsz;
827 t[1] = (real) (mb * *m * nblcks + 5);
832 work[1] = (real) lwmin;
834 work[1] = (real) lwreq;
839 xerbla_("SGELQ", &i__1, (ftnlen)5);
845 /* Quick return if possible */
847 if (f2cmin(*m,*n) == 0) {
851 /* The LQ Decomposition */
853 if (*n <= *m || nb <= *m || nb >= *n) {
854 sgelqt_(m, n, &mb, &a[a_offset], lda, &t[6], &mb, &work[1], info);
856 slaswlq_(m, n, &mb, &nb, &a[a_offset], lda, &t[6], &mb, &work[1],
860 work[1] = (real) lwreq;