[] add metering mode to CLI

1 files changed, 4164 insertions, 0 deletions

diff --git a/contrib/libs/clapack/cgesvd.c b/contrib/libs/clapack/cgesvd.c
new file mode 100644
index 0000000000..f6b5b7ca55
--- /dev/null
+++ b/contrib/libs/clapack/cgesvd.c
@@ -0,0 +1,4164 @@
+/* cgesvd.f -- translated by f2c (version 20061008).
+   You must link the resulting object file with libf2c:
+	on Microsoft Windows system, link with libf2c.lib;
+	on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+	or, if you install libf2c.a in a standard place, with -lf2c -lm
+	-- in that order, at the end of the command line, as in
+		cc *.o -lf2c -lm
+	Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+		http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#include "f2c.h"
+#include "blaswrap.h"
+
+/* Table of constant values */
+
+static complex c_b1 = {0.f,0.f};
+static complex c_b2 = {1.f,0.f};
+static integer c__6 = 6;
+static integer c__0 = 0;
+static integer c__2 = 2;
+static integer c__1 = 1;
+static integer c_n1 = -1;
+
+/* Subroutine */ int cgesvd_(char *jobu, char *jobvt, integer *m, integer *n, 
+	complex *a, integer *lda, real *s, complex *u, integer *ldu, complex *
+	vt, integer *ldvt, complex *work, integer *lwork, real *rwork, 
+	integer *info)
+{
+    /* System generated locals */
+    address a__1[2];
+    integer a_dim1, a_offset, u_dim1, u_offset, vt_dim1, vt_offset, i__1[2], 
+	    i__2, i__3, i__4;
+    char ch__1[2];
+
+    /* Builtin functions */
+    /* Subroutine */ int s_cat(char *, char **, integer *, integer *, ftnlen);
+    double sqrt(doublereal);
+
+    /* Local variables */
+    integer i__, ie, ir, iu, blk, ncu;
+    real dum[1], eps;
+    integer nru;
+    complex cdum[1];
+    integer iscl;
+    real anrm;
+    integer ierr, itau, ncvt, nrvt;
+    extern /* Subroutine */ int cgemm_(char *, char *, integer *, integer *, 
+	    integer *, complex *, complex *, integer *, complex *, integer *, 
+	    complex *, complex *, integer *);
+    extern logical lsame_(char *, char *);
+    integer chunk, minmn, wrkbl, itaup, itauq, mnthr, iwork;
+    logical wntua, wntva, wntun, wntuo, wntvn, wntvo, wntus, wntvs;
+    extern /* Subroutine */ int cgebrd_(integer *, integer *, complex *, 
+	    integer *, real *, real *, complex *, complex *, complex *, 
+	    integer *, integer *);
+    extern doublereal clange_(char *, integer *, integer *, complex *, 
+	    integer *, real *);
+    extern /* Subroutine */ int cgelqf_(integer *, integer *, complex *, 
+	    integer *, complex *, complex *, integer *, integer *), clascl_(
+	    char *, integer *, integer *, real *, real *, integer *, integer *
+, complex *, integer *, integer *), cgeqrf_(integer *, 
+	    integer *, complex *, integer *, complex *, complex *, integer *, 
+	    integer *);
+    extern doublereal slamch_(char *);
+    extern /* Subroutine */ int clacpy_(char *, integer *, integer *, complex 
+	    *, integer *, complex *, integer *), claset_(char *, 
+	    integer *, integer *, complex *, complex *, complex *, integer *), cbdsqr_(char *, integer *, integer *, integer *, integer 
+	    *, real *, real *, complex *, integer *, complex *, integer *, 
+	    complex *, integer *, real *, integer *), xerbla_(char *, 
+	    integer *), cungbr_(char *, integer *, integer *, integer 
+	    *, complex *, integer *, complex *, complex *, integer *, integer 
+	    *);
+    real bignum;
+    extern /* Subroutine */ int slascl_(char *, integer *, integer *, real *, 
+	    real *, integer *, integer *, real *, integer *, integer *);
+    extern integer ilaenv_(integer *, char *, char *, integer *, integer *, 
+	    integer *, integer *);
+    extern /* Subroutine */ int cunmbr_(char *, char *, char *, integer *, 
+	    integer *, integer *, complex *, integer *, complex *, complex *, 
+	    integer *, complex *, integer *, integer *), cunglq_(integer *, integer *, integer *, complex *, 
+	    integer *, complex *, complex *, integer *, integer *), cungqr_(
+	    integer *, integer *, integer *, complex *, integer *, complex *, 
+	    complex *, integer *, integer *);
+    integer ldwrkr, minwrk, ldwrku, maxwrk;
+    real smlnum;
+    integer irwork;
+    logical lquery, wntuas, wntvas;
+
+
+/*  -- LAPACK driver routine (version 3.2) -- */
+/*     Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
+/*     November 2006 */
+
+/*     .. Scalar Arguments .. */
+/*     .. */
+/*     .. Array Arguments .. */
+/*     .. */
+
+/*  Purpose */
+/*  ======= */
+
+/*  CGESVD computes the singular value decomposition (SVD) of a complex */
+/*  M-by-N matrix A, optionally computing the left and/or right singular */
+/*  vectors. The SVD is written */
+
+/*       A = U * SIGMA * conjugate-transpose(V) */
+
+/*  where SIGMA is an M-by-N matrix which is zero except for its */
+/*  min(m,n) diagonal elements, U is an M-by-M unitary matrix, and */
+/*  V is an N-by-N unitary matrix.  The diagonal elements of SIGMA */
+/*  are the singular values of A; they are real and non-negative, and */
+/*  are returned in descending order.  The first min(m,n) columns of */
+/*  U and V are the left and right singular vectors of A. */
+
+/*  Note that the routine returns V**H, not V. */
+
+/*  Arguments */
+/*  ========= */
+
+/*  JOBU    (input) CHARACTER*1 */
+/*          Specifies options for computing all or part of the matrix U: */
+/*          = 'A':  all M columns of U are returned in array U: */
+/*          = 'S':  the first min(m,n) columns of U (the left singular */
+/*                  vectors) are returned in the array U; */
+/*          = 'O':  the first min(m,n) columns of U (the left singular */
+/*                  vectors) are overwritten on the array A; */
+/*          = 'N':  no columns of U (no left singular vectors) are */
+/*                  computed. */
+
+/*  JOBVT   (input) CHARACTER*1 */
+/*          Specifies options for computing all or part of the matrix */
+/*          V**H: */
+/*          = 'A':  all N rows of V**H are returned in the array VT; */
+/*          = 'S':  the first min(m,n) rows of V**H (the right singular */
+/*                  vectors) are returned in the array VT; */
+/*          = 'O':  the first min(m,n) rows of V**H (the right singular */
+/*                  vectors) are overwritten on the array A; */
+/*          = 'N':  no rows of V**H (no right singular vectors) are */
+/*                  computed. */
+
+/*          JOBVT and JOBU cannot both be 'O'. */
+
+/*  M       (input) INTEGER */
+/*          The number of rows of the input matrix A.  M >= 0. */
+
+/*  N       (input) INTEGER */
+/*          The number of columns of the input matrix A.  N >= 0. */
+
+/*  A       (input/output) COMPLEX array, dimension (LDA,N) */
+/*          On entry, the M-by-N matrix A. */
+/*          On exit, */
+/*          if JOBU = 'O',  A is overwritten with the first min(m,n) */
+/*                          columns of U (the left singular vectors, */
+/*                          stored columnwise); */
+/*          if JOBVT = 'O', A is overwritten with the first min(m,n) */
+/*                          rows of V**H (the right singular vectors, */
+/*                          stored rowwise); */
+/*          if JOBU .ne. 'O' and JOBVT .ne. 'O', the contents of A */
+/*                          are destroyed. */
+
+/*  LDA     (input) INTEGER */
+/*          The leading dimension of the array A.  LDA >= max(1,M). */
+
+/*  S       (output) REAL array, dimension (min(M,N)) */
+/*          The singular values of A, sorted so that S(i) >= S(i+1). */
+
+/*  U       (output) COMPLEX array, dimension (LDU,UCOL) */
+/*          (LDU,M) if JOBU = 'A' or (LDU,min(M,N)) if JOBU = 'S'. */
+/*          If JOBU = 'A', U contains the M-by-M unitary matrix U; */
+/*          if JOBU = 'S', U contains the first min(m,n) columns of U */
+/*          (the left singular vectors, stored columnwise); */
+/*          if JOBU = 'N' or 'O', U is not referenced. */
+
+/*  LDU     (input) INTEGER */
+/*          The leading dimension of the array U.  LDU >= 1; if */
+/*          JOBU = 'S' or 'A', LDU >= M. */
+
+/*  VT      (output) COMPLEX array, dimension (LDVT,N) */
+/*          If JOBVT = 'A', VT contains the N-by-N unitary matrix */
+/*          V**H; */
+/*          if JOBVT = 'S', VT contains the first min(m,n) rows of */
+/*          V**H (the right singular vectors, stored rowwise); */
+/*          if JOBVT = 'N' or 'O', VT is not referenced. */
+
+/*  LDVT    (input) INTEGER */
+/*          The leading dimension of the array VT.  LDVT >= 1; if */
+/*          JOBVT = 'A', LDVT >= N; if JOBVT = 'S', LDVT >= min(M,N). */
+
+/*  WORK    (workspace/output) COMPLEX array, dimension (MAX(1,LWORK)) */
+/*          On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
+
+/*  LWORK   (input) INTEGER */
+/*          The dimension of the array WORK. */
+/*          LWORK >=  MAX(1,2*MIN(M,N)+MAX(M,N)). */
+/*          For good performance, LWORK should generally be larger. */
+
+/*          If LWORK = -1, then a workspace query is assumed; the routine */
+/*          only calculates the optimal size of the WORK array, returns */
+/*          this value as the first entry of the WORK array, and no error */
+/*          message related to LWORK is issued by XERBLA. */
+
+/*  RWORK   (workspace) REAL array, dimension (5*min(M,N)) */
+/*          On exit, if INFO > 0, RWORK(1:MIN(M,N)-1) contains the */
+/*          unconverged superdiagonal elements of an upper bidiagonal */
+/*          matrix B whose diagonal is in S (not necessarily sorted). */
+/*          B satisfies A = U * B * VT, so it has the same singular */
+/*          values as A, and singular vectors related by U and VT. */
+
+/*  INFO    (output) INTEGER */
+/*          = 0:  successful exit. */
+/*          < 0:  if INFO = -i, the i-th argument had an illegal value. */
+/*          > 0:  if CBDSQR did not converge, INFO specifies how many */
+/*                superdiagonals of an intermediate bidiagonal form B */
+/*                did not converge to zero. See the description of RWORK */
+/*                above for details. */
+
+/*  ===================================================================== */
+
+/*     .. Parameters .. */
+/*     .. */
+/*     .. Local Scalars .. */
+/*     .. */
+/*     .. Local Arrays .. */
+/*     .. */
+/*     .. External Subroutines .. */
+/*     .. */
+/*     .. External Functions .. */
+/*     .. */
+/*     .. Intrinsic Functions .. */
+/*     .. */
+/*     .. Executable Statements .. */
+
+/*     Test the input arguments */
+
+    /* Parameter adjustments */
+    a_dim1 = *lda;
+    a_offset = 1 + a_dim1;
+    a -= a_offset;
+    --s;
+    u_dim1 = *ldu;
+    u_offset = 1 + u_dim1;
+    u -= u_offset;
+    vt_dim1 = *ldvt;
+    vt_offset = 1 + vt_dim1;
+    vt -= vt_offset;
+    --work;
+    --rwork;
+
+    /* Function Body */
+    *info = 0;
+    minmn = min(*m,*n);
+    wntua = lsame_(jobu, "A");
+    wntus = lsame_(jobu, "S");
+    wntuas = wntua || wntus;
+    wntuo = lsame_(jobu, "O");
+    wntun = lsame_(jobu, "N");
+    wntva = lsame_(jobvt, "A");
+    wntvs = lsame_(jobvt, "S");
+    wntvas = wntva || wntvs;
+    wntvo = lsame_(jobvt, "O");
+    wntvn = lsame_(jobvt, "N");
+    lquery = *lwork == -1;
+
+    if (! (wntua || wntus || wntuo || wntun)) {
+	*info = -1;
+    } else if (! (wntva || wntvs || wntvo || wntvn) || wntvo && wntuo) {
+	*info = -2;
+    } else if (*m < 0) {
+	*info = -3;
+    } else if (*n < 0) {
+	*info = -4;
+    } else if (*lda < max(1,*m)) {
+	*info = -6;
+    } else if (*ldu < 1 || wntuas && *ldu < *m) {
+	*info = -9;
+    } else if (*ldvt < 1 || wntva && *ldvt < *n || wntvs && *ldvt < minmn) {
+	*info = -11;
+    }
+
+/*     Compute workspace */
+/*      (Note: Comments in the code beginning "Workspace:" describe the */
+/*       minimal amount of workspace needed at that point in the code, */
+/*       as well as the preferred amount for good performance. */
+/*       CWorkspace refers to complex workspace, and RWorkspace to */
+/*       real workspace. NB refers to the optimal block size for the */
+/*       immediately following subroutine, as returned by ILAENV.) */
+
+    if (*info == 0) {
+	minwrk = 1;
+	maxwrk = 1;
+	if (*m >= *n && minmn > 0) {
+
+/*           Space needed for CBDSQR is BDSPAC = 5*N */
+
+/* Writing concatenation */
+	    i__1[0] = 1, a__1[0] = jobu;
+	    i__1[1] = 1, a__1[1] = jobvt;
+	    s_cat(ch__1, a__1, i__1, &c__2, (ftnlen)2);
+	    mnthr = ilaenv_(&c__6, "CGESVD", ch__1, m, n, &c__0, &c__0);
+	    if (*m >= mnthr) {
+		if (wntun) {
+
+/*                 Path 1 (M much larger than N, JOBU='N') */
+
+		    maxwrk = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = maxwrk, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    maxwrk = max(i__2,i__3);
+		    if (wntvo || wntvas) {
+/* Computing MAX */
+			i__2 = maxwrk, i__3 = (*n << 1) + (*n - 1) * ilaenv_(&
+				c__1, "CUNGBR", "P", n, n, n, &c_n1);
+			maxwrk = max(i__2,i__3);
+		    }
+		    minwrk = *n * 3;
+		} else if (wntuo && wntvn) {
+
+/*                 Path 2 (M much larger than N, JOBU='O', JOBVT='N') */
+
+		    wrkbl = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *n + *n * ilaenv_(&c__1, "CUNGQR", 
+			    " ", m, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = *n * *n + wrkbl, i__3 = *n * *n + *m * *n;
+		    maxwrk = max(i__2,i__3);
+		    minwrk = (*n << 1) + *m;
+		} else if (wntuo && wntvas) {
+
+/*                 Path 3 (M much larger than N, JOBU='O', JOBVT='S' or */
+/*                 'A') */
+
+		    wrkbl = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *n + *n * ilaenv_(&c__1, "CUNGQR", 
+			    " ", m, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = *n * *n + wrkbl, i__3 = *n * *n + *m * *n;
+		    maxwrk = max(i__2,i__3);
+		    minwrk = (*n << 1) + *m;
+		} else if (wntus && wntvn) {
+
+/*                 Path 4 (M much larger than N, JOBU='S', JOBVT='N') */
+
+		    wrkbl = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *n + *n * ilaenv_(&c__1, "CUNGQR", 
+			    " ", m, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = *n * *n + wrkbl;
+		    minwrk = (*n << 1) + *m;
+		} else if (wntus && wntvo) {
+
+/*                 Path 5 (M much larger than N, JOBU='S', JOBVT='O') */
+
+		    wrkbl = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *n + *n * ilaenv_(&c__1, "CUNGQR", 
+			    " ", m, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = (*n << 1) * *n + wrkbl;
+		    minwrk = (*n << 1) + *m;
+		} else if (wntus && wntvas) {
+
+/*                 Path 6 (M much larger than N, JOBU='S', JOBVT='S' or */
+/*                 'A') */
+
+		    wrkbl = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *n + *n * ilaenv_(&c__1, "CUNGQR", 
+			    " ", m, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = *n * *n + wrkbl;
+		    minwrk = (*n << 1) + *m;
+		} else if (wntua && wntvn) {
+
+/*                 Path 7 (M much larger than N, JOBU='A', JOBVT='N') */
+
+		    wrkbl = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *n + *m * ilaenv_(&c__1, "CUNGQR", 
+			    " ", m, m, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = *n * *n + wrkbl;
+		    minwrk = (*n << 1) + *m;
+		} else if (wntua && wntvo) {
+
+/*                 Path 8 (M much larger than N, JOBU='A', JOBVT='O') */
+
+		    wrkbl = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *n + *m * ilaenv_(&c__1, "CUNGQR", 
+			    " ", m, m, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = (*n << 1) * *n + wrkbl;
+		    minwrk = (*n << 1) + *m;
+		} else if (wntua && wntvas) {
+
+/*                 Path 9 (M much larger than N, JOBU='A', JOBVT='S' or */
+/*                 'A') */
+
+		    wrkbl = *n + *n * ilaenv_(&c__1, "CGEQRF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *n + *m * ilaenv_(&c__1, "CUNGQR", 
+			    " ", m, m, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", n, n, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*n << 1) + (*n - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", n, n, n, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = *n * *n + wrkbl;
+		    minwrk = (*n << 1) + *m;
+		}
+	    } else {
+
+/*              Path 10 (M at least N, but not much larger) */
+
+		maxwrk = (*n << 1) + (*m + *n) * ilaenv_(&c__1, "CGEBRD", 
+			" ", m, n, &c_n1, &c_n1);
+		if (wntus || wntuo) {
+/* Computing MAX */
+		    i__2 = maxwrk, i__3 = (*n << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", m, n, n, &c_n1);
+		    maxwrk = max(i__2,i__3);
+		}
+		if (wntua) {
+/* Computing MAX */
+		    i__2 = maxwrk, i__3 = (*n << 1) + *m * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", m, m, n, &c_n1);
+		    maxwrk = max(i__2,i__3);
+		}
+		if (! wntvn) {
+/* Computing MAX */
+		    i__2 = maxwrk, i__3 = (*n << 1) + (*n - 1) * ilaenv_(&
+			    c__1, "CUNGBR", "P", n, n, n, &c_n1);
+		    maxwrk = max(i__2,i__3);
+		}
+		minwrk = (*n << 1) + *m;
+	    }
+	} else if (minmn > 0) {
+
+/*           Space needed for CBDSQR is BDSPAC = 5*M */
+
+/* Writing concatenation */
+	    i__1[0] = 1, a__1[0] = jobu;
+	    i__1[1] = 1, a__1[1] = jobvt;
+	    s_cat(ch__1, a__1, i__1, &c__2, (ftnlen)2);
+	    mnthr = ilaenv_(&c__6, "CGESVD", ch__1, m, n, &c__0, &c__0);
+	    if (*n >= mnthr) {
+		if (wntvn) {
+
+/*                 Path 1t(N much larger than M, JOBVT='N') */
+
+		    maxwrk = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = maxwrk, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    maxwrk = max(i__2,i__3);
+		    if (wntuo || wntuas) {
+/* Computing MAX */
+			i__2 = maxwrk, i__3 = (*m << 1) + *m * ilaenv_(&c__1, 
+				"CUNGBR", "Q", m, m, m, &c_n1);
+			maxwrk = max(i__2,i__3);
+		    }
+		    minwrk = *m * 3;
+		} else if (wntvo && wntun) {
+
+/*                 Path 2t(N much larger than M, JOBU='N', JOBVT='O') */
+
+		    wrkbl = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *m + *m * ilaenv_(&c__1, "CUNGLQ", 
+			    " ", m, n, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = *m * *m + wrkbl, i__3 = *m * *m + *m * *n;
+		    maxwrk = max(i__2,i__3);
+		    minwrk = (*m << 1) + *n;
+		} else if (wntvo && wntuas) {
+
+/*                 Path 3t(N much larger than M, JOBU='S' or 'A', */
+/*                 JOBVT='O') */
+
+		    wrkbl = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *m + *m * ilaenv_(&c__1, "CUNGLQ", 
+			    " ", m, n, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + *m * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = *m * *m + wrkbl, i__3 = *m * *m + *m * *n;
+		    maxwrk = max(i__2,i__3);
+		    minwrk = (*m << 1) + *n;
+		} else if (wntvs && wntun) {
+
+/*                 Path 4t(N much larger than M, JOBU='N', JOBVT='S') */
+
+		    wrkbl = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *m + *m * ilaenv_(&c__1, "CUNGLQ", 
+			    " ", m, n, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = *m * *m + wrkbl;
+		    minwrk = (*m << 1) + *n;
+		} else if (wntvs && wntuo) {
+
+/*                 Path 5t(N much larger than M, JOBU='O', JOBVT='S') */
+
+		    wrkbl = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *m + *m * ilaenv_(&c__1, "CUNGLQ", 
+			    " ", m, n, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + *m * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = (*m << 1) * *m + wrkbl;
+		    minwrk = (*m << 1) + *n;
+		} else if (wntvs && wntuas) {
+
+/*                 Path 6t(N much larger than M, JOBU='S' or 'A', */
+/*                 JOBVT='S') */
+
+		    wrkbl = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *m + *m * ilaenv_(&c__1, "CUNGLQ", 
+			    " ", m, n, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + *m * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = *m * *m + wrkbl;
+		    minwrk = (*m << 1) + *n;
+		} else if (wntva && wntun) {
+
+/*                 Path 7t(N much larger than M, JOBU='N', JOBVT='A') */
+
+		    wrkbl = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *m + *n * ilaenv_(&c__1, "CUNGLQ", 
+			    " ", n, n, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = *m * *m + wrkbl;
+		    minwrk = (*m << 1) + *n;
+		} else if (wntva && wntuo) {
+
+/*                 Path 8t(N much larger than M, JOBU='O', JOBVT='A') */
+
+		    wrkbl = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *m + *n * ilaenv_(&c__1, "CUNGLQ", 
+			    " ", n, n, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + *m * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = (*m << 1) * *m + wrkbl;
+		    minwrk = (*m << 1) + *n;
+		} else if (wntva && wntuas) {
+
+/*                 Path 9t(N much larger than M, JOBU='S' or 'A', */
+/*                 JOBVT='A') */
+
+		    wrkbl = *m + *m * ilaenv_(&c__1, "CGELQF", " ", m, n, &
+			    c_n1, &c_n1);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *m + *n * ilaenv_(&c__1, "CUNGLQ", 
+			    " ", n, n, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m << 1) * ilaenv_(&
+			    c__1, "CGEBRD", " ", m, m, &c_n1, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&c__1, 
+			     "CUNGBR", "P", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = (*m << 1) + *m * ilaenv_(&c__1, 
+			    "CUNGBR", "Q", m, m, m, &c_n1);
+		    wrkbl = max(i__2,i__3);
+		    maxwrk = *m * *m + wrkbl;
+		    minwrk = (*m << 1) + *n;
+		}
+	    } else {
+
+/*              Path 10t(N greater than M, but not much larger) */
+
+		maxwrk = (*m << 1) + (*m + *n) * ilaenv_(&c__1, "CGEBRD", 
+			" ", m, n, &c_n1, &c_n1);
+		if (wntvs || wntvo) {
+/* Computing MAX */
+		    i__2 = maxwrk, i__3 = (*m << 1) + *m * ilaenv_(&c__1, 
+			    "CUNGBR", "P", m, n, m, &c_n1);
+		    maxwrk = max(i__2,i__3);
+		}
+		if (wntva) {
+/* Computing MAX */
+		    i__2 = maxwrk, i__3 = (*m << 1) + *n * ilaenv_(&c__1, 
+			    "CUNGBR", "P", n, n, m, &c_n1);
+		    maxwrk = max(i__2,i__3);
+		}
+		if (! wntun) {
+/* Computing MAX */
+		    i__2 = maxwrk, i__3 = (*m << 1) + (*m - 1) * ilaenv_(&
+			    c__1, "CUNGBR", "Q", m, m, m, &c_n1);
+		    maxwrk = max(i__2,i__3);
+		}
+		minwrk = (*m << 1) + *n;
+	    }
+	}
+	maxwrk = max(minwrk,maxwrk);
+	work[1].r = (real) maxwrk, work[1].i = 0.f;
+
+	if (*lwork < minwrk && ! lquery) {
+	    *info = -13;
+	}
+    }
+
+    if (*info != 0) {
+	i__2 = -(*info);
+	xerbla_("CGESVD", &i__2);
+	return 0;
+    } else if (lquery) {
+	return 0;
+    }
+
+/*     Quick return if possible */
+
+    if (*m == 0 || *n == 0) {
+	return 0;
+    }
+
+/*     Get machine constants */
+
+    eps = slamch_("P");
+    smlnum = sqrt(slamch_("S")) / eps;
+    bignum = 1.f / smlnum;
+
+/*     Scale A if max element outside range [SMLNUM,BIGNUM] */
+
+    anrm = clange_("M", m, n, &a[a_offset], lda, dum);
+    iscl = 0;
+    if (anrm > 0.f && anrm < smlnum) {
+	iscl = 1;
+	clascl_("G", &c__0, &c__0, &anrm, &smlnum, m, n, &a[a_offset], lda, &
+		ierr);
+    } else if (anrm > bignum) {
+	iscl = 1;
+	clascl_("G", &c__0, &c__0, &anrm, &bignum, m, n, &a[a_offset], lda, &
+		ierr);
+    }
+
+    if (*m >= *n) {
+
+/*        A has at least as many rows as columns. If A has sufficiently */
+/*        more rows than columns, first reduce using the QR */
+/*        decomposition (if sufficient workspace available) */
+
+	if (*m >= mnthr) {
+
+	    if (wntun) {
+
+/*              Path 1 (M much larger than N, JOBU='N') */
+/*              No left singular vectors to be computed */
+
+		itau = 1;
+		iwork = itau + *n;
+
+/*              Compute A=Q*R */
+/*              (CWorkspace: need 2*N, prefer N+N*NB) */
+/*              (RWorkspace: need 0) */
+
+		i__2 = *lwork - iwork + 1;
+		cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[iwork], &
+			i__2, &ierr);
+
+/*              Zero out below R */
+
+		i__2 = *n - 1;
+		i__3 = *n - 1;
+		claset_("L", &i__2, &i__3, &c_b1, &c_b1, &a[a_dim1 + 2], lda);
+		ie = 1;
+		itauq = 1;
+		itaup = itauq + *n;
+		iwork = itaup + *n;
+
+/*              Bidiagonalize R in A */
+/*              (CWorkspace: need 3*N, prefer 2*N+2*N*NB) */
+/*              (RWorkspace: need N) */
+
+		i__2 = *lwork - iwork + 1;
+		cgebrd_(n, n, &a[a_offset], lda, &s[1], &rwork[ie], &work[
+			itauq], &work[itaup], &work[iwork], &i__2, &ierr);
+		ncvt = 0;
+		if (wntvo || wntvas) {
+
+/*                 If right singular vectors desired, generate P'. */
+/*                 (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cungbr_("P", n, n, n, &a[a_offset], lda, &work[itaup], &
+			    work[iwork], &i__2, &ierr);
+		    ncvt = *n;
+		}
+		irwork = ie + *n;
+
+/*              Perform bidiagonal QR iteration, computing right */
+/*              singular vectors of A in A if desired */
+/*              (CWorkspace: 0) */
+/*              (RWorkspace: need BDSPAC) */
+
+		cbdsqr_("U", n, &ncvt, &c__0, &c__0, &s[1], &rwork[ie], &a[
+			a_offset], lda, cdum, &c__1, cdum, &c__1, &rwork[
+			irwork], info);
+
+/*              If right singular vectors desired in VT, copy them there */
+
+		if (wntvas) {
+		    clacpy_("F", n, n, &a[a_offset], lda, &vt[vt_offset], 
+			    ldvt);
+		}
+
+	    } else if (wntuo && wntvn) {
+
+/*              Path 2 (M much larger than N, JOBU='O', JOBVT='N') */
+/*              N left singular vectors to be overwritten on A and */
+/*              no right singular vectors to be computed */
+
+		if (*lwork >= *n * *n + *n * 3) {
+
+/*                 Sufficient workspace for a fast algorithm */
+
+		    ir = 1;
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *lda * *n;
+		    if (*lwork >= max(i__2,i__3) + *lda * *n) {
+
+/*                    WORK(IU) is LDA by N, WORK(IR) is LDA by N */
+
+			ldwrku = *lda;
+			ldwrkr = *lda;
+		    } else /* if(complicated condition) */ {
+/* Computing MAX */
+			i__2 = wrkbl, i__3 = *lda * *n;
+			if (*lwork >= max(i__2,i__3) + *n * *n) {
+
+/*                    WORK(IU) is LDA by N, WORK(IR) is N by N */
+
+			    ldwrku = *lda;
+			    ldwrkr = *n;
+			} else {
+
+/*                    WORK(IU) is LDWRKU by N, WORK(IR) is N by N */
+
+			    ldwrku = (*lwork - *n * *n) / *n;
+			    ldwrkr = *n;
+			}
+		    }
+		    itau = ir + ldwrkr * *n;
+		    iwork = itau + *n;
+
+/*                 Compute A=Q*R */
+/*                 (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[iwork]
+, &i__2, &ierr);
+
+/*                 Copy R to WORK(IR) and zero out below it */
+
+		    clacpy_("U", n, n, &a[a_offset], lda, &work[ir], &ldwrkr);
+		    i__2 = *n - 1;
+		    i__3 = *n - 1;
+		    claset_("L", &i__2, &i__3, &c_b1, &c_b1, &work[ir + 1], &
+			    ldwrkr);
+
+/*                 Generate Q in A */
+/*                 (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cungqr_(m, n, n, &a[a_offset], lda, &work[itau], &work[
+			    iwork], &i__2, &ierr);
+		    ie = 1;
+		    itauq = itau;
+		    itaup = itauq + *n;
+		    iwork = itaup + *n;
+
+/*                 Bidiagonalize R in WORK(IR) */
+/*                 (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) */
+/*                 (RWorkspace: need N) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cgebrd_(n, n, &work[ir], &ldwrkr, &s[1], &rwork[ie], &
+			    work[itauq], &work[itaup], &work[iwork], &i__2, &
+			    ierr);
+
+/*                 Generate left vectors bidiagonalizing R */
+/*                 (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) */
+/*                 (RWorkspace: need 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cungbr_("Q", n, n, n, &work[ir], &ldwrkr, &work[itauq], &
+			    work[iwork], &i__2, &ierr);
+		    irwork = ie + *n;
+
+/*                 Perform bidiagonal QR iteration, computing left */
+/*                 singular vectors of R in WORK(IR) */
+/*                 (CWorkspace: need N*N) */
+/*                 (RWorkspace: need BDSPAC) */
+
+		    cbdsqr_("U", n, &c__0, n, &c__0, &s[1], &rwork[ie], cdum, 
+			    &c__1, &work[ir], &ldwrkr, cdum, &c__1, &rwork[
+			    irwork], info);
+		    iu = itauq;
+
+/*                 Multiply Q in A by left singular vectors of R in */
+/*                 WORK(IR), storing result in WORK(IU) and copying to A */
+/*                 (CWorkspace: need N*N+N, prefer N*N+M*N) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *m;
+		    i__3 = ldwrku;
+		    for (i__ = 1; i__3 < 0 ? i__ >= i__2 : i__ <= i__2; i__ +=
+			     i__3) {
+/* Computing MIN */
+			i__4 = *m - i__ + 1;
+			chunk = min(i__4,ldwrku);
+			cgemm_("N", "N", &chunk, n, n, &c_b2, &a[i__ + a_dim1]
+, lda, &work[ir], &ldwrkr, &c_b1, &work[iu], &
+				ldwrku);
+			clacpy_("F", &chunk, n, &work[iu], &ldwrku, &a[i__ + 
+				a_dim1], lda);
+/* L10: */
+		    }
+
+		} else {
+
+/*                 Insufficient workspace for a fast algorithm */
+
+		    ie = 1;
+		    itauq = 1;
+		    itaup = itauq + *n;
+		    iwork = itaup + *n;
+
+/*                 Bidiagonalize A */
+/*                 (CWorkspace: need 2*N+M, prefer 2*N+(M+N)*NB) */
+/*                 (RWorkspace: N) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cgebrd_(m, n, &a[a_offset], lda, &s[1], &rwork[ie], &work[
+			    itauq], &work[itaup], &work[iwork], &i__3, &ierr);
+
+/*                 Generate left vectors bidiagonalizing A */
+/*                 (CWorkspace: need 3*N, prefer 2*N+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cungbr_("Q", m, n, n, &a[a_offset], lda, &work[itauq], &
+			    work[iwork], &i__3, &ierr);
+		    irwork = ie + *n;
+
+/*                 Perform bidiagonal QR iteration, computing left */
+/*                 singular vectors of A in A */
+/*                 (CWorkspace: need 0) */
+/*                 (RWorkspace: need BDSPAC) */
+
+		    cbdsqr_("U", n, &c__0, m, &c__0, &s[1], &rwork[ie], cdum, 
+			    &c__1, &a[a_offset], lda, cdum, &c__1, &rwork[
+			    irwork], info);
+
+		}
+
+	    } else if (wntuo && wntvas) {
+
+/*              Path 3 (M much larger than N, JOBU='O', JOBVT='S' or 'A') */
+/*              N left singular vectors to be overwritten on A and */
+/*              N right singular vectors to be computed in VT */
+
+		if (*lwork >= *n * *n + *n * 3) {
+
+/*                 Sufficient workspace for a fast algorithm */
+
+		    ir = 1;
+/* Computing MAX */
+		    i__3 = wrkbl, i__2 = *lda * *n;
+		    if (*lwork >= max(i__3,i__2) + *lda * *n) {
+
+/*                    WORK(IU) is LDA by N and WORK(IR) is LDA by N */
+
+			ldwrku = *lda;
+			ldwrkr = *lda;
+		    } else /* if(complicated condition) */ {
+/* Computing MAX */
+			i__3 = wrkbl, i__2 = *lda * *n;
+			if (*lwork >= max(i__3,i__2) + *n * *n) {
+
+/*                    WORK(IU) is LDA by N and WORK(IR) is N by N */
+
+			    ldwrku = *lda;
+			    ldwrkr = *n;
+			} else {
+
+/*                    WORK(IU) is LDWRKU by N and WORK(IR) is N by N */
+
+			    ldwrku = (*lwork - *n * *n) / *n;
+			    ldwrkr = *n;
+			}
+		    }
+		    itau = ir + ldwrkr * *n;
+		    iwork = itau + *n;
+
+/*                 Compute A=Q*R */
+/*                 (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[iwork]
+, &i__3, &ierr);
+
+/*                 Copy R to VT, zeroing out below it */
+
+		    clacpy_("U", n, n, &a[a_offset], lda, &vt[vt_offset], 
+			    ldvt);
+		    if (*n > 1) {
+			i__3 = *n - 1;
+			i__2 = *n - 1;
+			claset_("L", &i__3, &i__2, &c_b1, &c_b1, &vt[vt_dim1 
+				+ 2], ldvt);
+		    }
+
+/*                 Generate Q in A */
+/*                 (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cungqr_(m, n, n, &a[a_offset], lda, &work[itau], &work[
+			    iwork], &i__3, &ierr);
+		    ie = 1;
+		    itauq = itau;
+		    itaup = itauq + *n;
+		    iwork = itaup + *n;
+
+/*                 Bidiagonalize R in VT, copying result to WORK(IR) */
+/*                 (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) */
+/*                 (RWorkspace: need N) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cgebrd_(n, n, &vt[vt_offset], ldvt, &s[1], &rwork[ie], &
+			    work[itauq], &work[itaup], &work[iwork], &i__3, &
+			    ierr);
+		    clacpy_("L", n, n, &vt[vt_offset], ldvt, &work[ir], &
+			    ldwrkr);
+
+/*                 Generate left vectors bidiagonalizing R in WORK(IR) */
+/*                 (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cungbr_("Q", n, n, n, &work[ir], &ldwrkr, &work[itauq], &
+			    work[iwork], &i__3, &ierr);
+
+/*                 Generate right vectors bidiagonalizing R in VT */
+/*                 (CWorkspace: need N*N+3*N-1, prefer N*N+2*N+(N-1)*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cungbr_("P", n, n, n, &vt[vt_offset], ldvt, &work[itaup], 
+			    &work[iwork], &i__3, &ierr);
+		    irwork = ie + *n;
+
+/*                 Perform bidiagonal QR iteration, computing left */
+/*                 singular vectors of R in WORK(IR) and computing right */
+/*                 singular vectors of R in VT */
+/*                 (CWorkspace: need N*N) */
+/*                 (RWorkspace: need BDSPAC) */
+
+		    cbdsqr_("U", n, n, n, &c__0, &s[1], &rwork[ie], &vt[
+			    vt_offset], ldvt, &work[ir], &ldwrkr, cdum, &c__1, 
+			     &rwork[irwork], info);
+		    iu = itauq;
+
+/*                 Multiply Q in A by left singular vectors of R in */
+/*                 WORK(IR), storing result in WORK(IU) and copying to A */
+/*                 (CWorkspace: need N*N+N, prefer N*N+M*N) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *m;
+		    i__2 = ldwrku;
+		    for (i__ = 1; i__2 < 0 ? i__ >= i__3 : i__ <= i__3; i__ +=
+			     i__2) {
+/* Computing MIN */
+			i__4 = *m - i__ + 1;
+			chunk = min(i__4,ldwrku);
+			cgemm_("N", "N", &chunk, n, n, &c_b2, &a[i__ + a_dim1]
+, lda, &work[ir], &ldwrkr, &c_b1, &work[iu], &
+				ldwrku);
+			clacpy_("F", &chunk, n, &work[iu], &ldwrku, &a[i__ + 
+				a_dim1], lda);
+/* L20: */
+		    }
+
+		} else {
+
+/*                 Insufficient workspace for a fast algorithm */
+
+		    itau = 1;
+		    iwork = itau + *n;
+
+/*                 Compute A=Q*R */
+/*                 (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[iwork]
+, &i__2, &ierr);
+
+/*                 Copy R to VT, zeroing out below it */
+
+		    clacpy_("U", n, n, &a[a_offset], lda, &vt[vt_offset], 
+			    ldvt);
+		    if (*n > 1) {
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &vt[vt_dim1 
+				+ 2], ldvt);
+		    }
+
+/*                 Generate Q in A */
+/*                 (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cungqr_(m, n, n, &a[a_offset], lda, &work[itau], &work[
+			    iwork], &i__2, &ierr);
+		    ie = 1;
+		    itauq = itau;
+		    itaup = itauq + *n;
+		    iwork = itaup + *n;
+
+/*                 Bidiagonalize R in VT */
+/*                 (CWorkspace: need 3*N, prefer 2*N+2*N*NB) */
+/*                 (RWorkspace: N) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cgebrd_(n, n, &vt[vt_offset], ldvt, &s[1], &rwork[ie], &
+			    work[itauq], &work[itaup], &work[iwork], &i__2, &
+			    ierr);
+
+/*                 Multiply Q in A by left vectors bidiagonalizing R */
+/*                 (CWorkspace: need 2*N+M, prefer 2*N+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cunmbr_("Q", "R", "N", m, n, n, &vt[vt_offset], ldvt, &
+			    work[itauq], &a[a_offset], lda, &work[iwork], &
+			    i__2, &ierr);
+
+/*                 Generate right vectors bidiagonalizing R in VT */
+/*                 (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cungbr_("P", n, n, n, &vt[vt_offset], ldvt, &work[itaup], 
+			    &work[iwork], &i__2, &ierr);
+		    irwork = ie + *n;
+
+/*                 Perform bidiagonal QR iteration, computing left */
+/*                 singular vectors of A in A and computing right */
+/*                 singular vectors of A in VT */
+/*                 (CWorkspace: 0) */
+/*                 (RWorkspace: need BDSPAC) */
+
+		    cbdsqr_("U", n, n, m, &c__0, &s[1], &rwork[ie], &vt[
+			    vt_offset], ldvt, &a[a_offset], lda, cdum, &c__1, 
+			    &rwork[irwork], info);
+
+		}
+
+	    } else if (wntus) {
+
+		if (wntvn) {
+
+/*                 Path 4 (M much larger than N, JOBU='S', JOBVT='N') */
+/*                 N left singular vectors to be computed in U and */
+/*                 no right singular vectors to be computed */
+
+		    if (*lwork >= *n * *n + *n * 3) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			ir = 1;
+			if (*lwork >= wrkbl + *lda * *n) {
+
+/*                       WORK(IR) is LDA by N */
+
+			    ldwrkr = *lda;
+			} else {
+
+/*                       WORK(IR) is N by N */
+
+			    ldwrkr = *n;
+			}
+			itau = ir + ldwrkr * *n;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R */
+/*                    (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+
+/*                    Copy R to WORK(IR), zeroing out below it */
+
+			clacpy_("U", n, n, &a[a_offset], lda, &work[ir], &
+				ldwrkr);
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &work[ir + 1]
+, &ldwrkr);
+
+/*                    Generate Q in A */
+/*                    (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, n, n, &a[a_offset], lda, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Bidiagonalize R in WORK(IR) */
+/*                    (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &work[ir], &ldwrkr, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Generate left vectors bidiagonalizing R in WORK(IR) */
+/*                    (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", n, n, n, &work[ir], &ldwrkr, &work[itauq]
+, &work[iwork], &i__2, &ierr);
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of R in WORK(IR) */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, &c__0, n, &c__0, &s[1], &rwork[ie], 
+				cdum, &c__1, &work[ir], &ldwrkr, cdum, &c__1, 
+				&rwork[irwork], info);
+
+/*                    Multiply Q in A by left singular vectors of R in */
+/*                    WORK(IR), storing result in U */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, n, &c_b2, &a[a_offset], lda, &
+				work[ir], &ldwrkr, &c_b1, &u[u_offset], ldu);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, n, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Zero out below R in A */
+
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &a[a_dim1 + 
+				2], lda);
+
+/*                    Bidiagonalize R in A */
+/*                    (CWorkspace: need 3*N, prefer 2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &a[a_offset], lda, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply Q in U by left vectors bidiagonalizing R */
+/*                    (CWorkspace: need 2*N+M, prefer 2*N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("Q", "R", "N", m, n, n, &a[a_offset], lda, &
+				work[itauq], &u[u_offset], ldu, &work[iwork], 
+				&i__2, &ierr)
+				;
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in U */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, &c__0, m, &c__0, &s[1], &rwork[ie], 
+				cdum, &c__1, &u[u_offset], ldu, cdum, &c__1, &
+				rwork[irwork], info);
+
+		    }
+
+		} else if (wntvo) {
+
+/*                 Path 5 (M much larger than N, JOBU='S', JOBVT='O') */
+/*                 N left singular vectors to be computed in U and */
+/*                 N right singular vectors to be overwritten on A */
+
+		    if (*lwork >= (*n << 1) * *n + *n * 3) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			iu = 1;
+			if (*lwork >= wrkbl + (*lda << 1) * *n) {
+
+/*                       WORK(IU) is LDA by N and WORK(IR) is LDA by N */
+
+			    ldwrku = *lda;
+			    ir = iu + ldwrku * *n;
+			    ldwrkr = *lda;
+			} else if (*lwork >= wrkbl + (*lda + *n) * *n) {
+
+/*                       WORK(IU) is LDA by N and WORK(IR) is N by N */
+
+			    ldwrku = *lda;
+			    ir = iu + ldwrku * *n;
+			    ldwrkr = *n;
+			} else {
+
+/*                       WORK(IU) is N by N and WORK(IR) is N by N */
+
+			    ldwrku = *n;
+			    ir = iu + ldwrku * *n;
+			    ldwrkr = *n;
+			}
+			itau = ir + ldwrkr * *n;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R */
+/*                    (CWorkspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+
+/*                    Copy R to WORK(IU), zeroing out below it */
+
+			clacpy_("U", n, n, &a[a_offset], lda, &work[iu], &
+				ldwrku);
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &work[iu + 1]
+, &ldwrku);
+
+/*                    Generate Q in A */
+/*                    (CWorkspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, n, n, &a[a_offset], lda, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Bidiagonalize R in WORK(IU), copying result to */
+/*                    WORK(IR) */
+/*                    (CWorkspace: need   2*N*N+3*N, */
+/*                                 prefer 2*N*N+2*N+2*N*NB) */
+/*                    (RWorkspace: need   N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &work[iu], &ldwrku, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+			clacpy_("U", n, n, &work[iu], &ldwrku, &work[ir], &
+				ldwrkr);
+
+/*                    Generate left bidiagonalizing vectors in WORK(IU) */
+/*                    (CWorkspace: need 2*N*N+3*N, prefer 2*N*N+2*N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", n, n, n, &work[iu], &ldwrku, &work[itauq]
+, &work[iwork], &i__2, &ierr);
+
+/*                    Generate right bidiagonalizing vectors in WORK(IR) */
+/*                    (CWorkspace: need   2*N*N+3*N-1, */
+/*                                 prefer 2*N*N+2*N+(N-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", n, n, n, &work[ir], &ldwrkr, &work[itaup]
+, &work[iwork], &i__2, &ierr);
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of R in WORK(IU) and computing */
+/*                    right singular vectors of R in WORK(IR) */
+/*                    (CWorkspace: need 2*N*N) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, n, n, &c__0, &s[1], &rwork[ie], &work[
+				ir], &ldwrkr, &work[iu], &ldwrku, cdum, &c__1, 
+				 &rwork[irwork], info);
+
+/*                    Multiply Q in A by left singular vectors of R in */
+/*                    WORK(IU), storing result in U */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, n, &c_b2, &a[a_offset], lda, &
+				work[iu], &ldwrku, &c_b1, &u[u_offset], ldu);
+
+/*                    Copy right singular vectors of R to A */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: 0) */
+
+			clacpy_("F", n, n, &work[ir], &ldwrkr, &a[a_offset], 
+				lda);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, n, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Zero out below R in A */
+
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &a[a_dim1 + 
+				2], lda);
+
+/*                    Bidiagonalize R in A */
+/*                    (CWorkspace: need 3*N, prefer 2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &a[a_offset], lda, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply Q in U by left vectors bidiagonalizing R */
+/*                    (CWorkspace: need 2*N+M, prefer 2*N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("Q", "R", "N", m, n, n, &a[a_offset], lda, &
+				work[itauq], &u[u_offset], ldu, &work[iwork], 
+				&i__2, &ierr)
+				;
+
+/*                    Generate right vectors bidiagonalizing R in A */
+/*                    (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", n, n, n, &a[a_offset], lda, &work[itaup], 
+				 &work[iwork], &i__2, &ierr);
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in U and computing right */
+/*                    singular vectors of A in A */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, n, m, &c__0, &s[1], &rwork[ie], &a[
+				a_offset], lda, &u[u_offset], ldu, cdum, &
+				c__1, &rwork[irwork], info);
+
+		    }
+
+		} else if (wntvas) {
+
+/*                 Path 6 (M much larger than N, JOBU='S', JOBVT='S' */
+/*                         or 'A') */
+/*                 N left singular vectors to be computed in U and */
+/*                 N right singular vectors to be computed in VT */
+
+		    if (*lwork >= *n * *n + *n * 3) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			iu = 1;
+			if (*lwork >= wrkbl + *lda * *n) {
+
+/*                       WORK(IU) is LDA by N */
+
+			    ldwrku = *lda;
+			} else {
+
+/*                       WORK(IU) is N by N */
+
+			    ldwrku = *n;
+			}
+			itau = iu + ldwrku * *n;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R */
+/*                    (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+
+/*                    Copy R to WORK(IU), zeroing out below it */
+
+			clacpy_("U", n, n, &a[a_offset], lda, &work[iu], &
+				ldwrku);
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &work[iu + 1]
+, &ldwrku);
+
+/*                    Generate Q in A */
+/*                    (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, n, n, &a[a_offset], lda, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Bidiagonalize R in WORK(IU), copying result to VT */
+/*                    (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &work[iu], &ldwrku, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+			clacpy_("U", n, n, &work[iu], &ldwrku, &vt[vt_offset], 
+				 ldvt);
+
+/*                    Generate left bidiagonalizing vectors in WORK(IU) */
+/*                    (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", n, n, n, &work[iu], &ldwrku, &work[itauq]
+, &work[iwork], &i__2, &ierr);
+
+/*                    Generate right bidiagonalizing vectors in VT */
+/*                    (CWorkspace: need   N*N+3*N-1, */
+/*                                 prefer N*N+2*N+(N-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", n, n, n, &vt[vt_offset], ldvt, &work[
+				itaup], &work[iwork], &i__2, &ierr)
+				;
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of R in WORK(IU) and computing */
+/*                    right singular vectors of R in VT */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, n, n, &c__0, &s[1], &rwork[ie], &vt[
+				vt_offset], ldvt, &work[iu], &ldwrku, cdum, &
+				c__1, &rwork[irwork], info);
+
+/*                    Multiply Q in A by left singular vectors of R in */
+/*                    WORK(IU), storing result in U */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, n, &c_b2, &a[a_offset], lda, &
+				work[iu], &ldwrku, &c_b1, &u[u_offset], ldu);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, n, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+
+/*                    Copy R to VT, zeroing out below it */
+
+			clacpy_("U", n, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+			if (*n > 1) {
+			    i__2 = *n - 1;
+			    i__3 = *n - 1;
+			    claset_("L", &i__2, &i__3, &c_b1, &c_b1, &vt[
+				    vt_dim1 + 2], ldvt);
+			}
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Bidiagonalize R in VT */
+/*                    (CWorkspace: need 3*N, prefer 2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &vt[vt_offset], ldvt, &s[1], &rwork[ie], 
+				 &work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply Q in U by left bidiagonalizing vectors */
+/*                    in VT */
+/*                    (CWorkspace: need 2*N+M, prefer 2*N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("Q", "R", "N", m, n, n, &vt[vt_offset], ldvt, 
+				&work[itauq], &u[u_offset], ldu, &work[iwork], 
+				 &i__2, &ierr);
+
+/*                    Generate right bidiagonalizing vectors in VT */
+/*                    (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", n, n, n, &vt[vt_offset], ldvt, &work[
+				itaup], &work[iwork], &i__2, &ierr)
+				;
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in U and computing right */
+/*                    singular vectors of A in VT */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, n, m, &c__0, &s[1], &rwork[ie], &vt[
+				vt_offset], ldvt, &u[u_offset], ldu, cdum, &
+				c__1, &rwork[irwork], info);
+
+		    }
+
+		}
+
+	    } else if (wntua) {
+
+		if (wntvn) {
+
+/*                 Path 7 (M much larger than N, JOBU='A', JOBVT='N') */
+/*                 M left singular vectors to be computed in U and */
+/*                 no right singular vectors to be computed */
+
+/* Computing MAX */
+		    i__2 = *n + *m, i__3 = *n * 3;
+		    if (*lwork >= *n * *n + max(i__2,i__3)) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			ir = 1;
+			if (*lwork >= wrkbl + *lda * *n) {
+
+/*                       WORK(IR) is LDA by N */
+
+			    ldwrkr = *lda;
+			} else {
+
+/*                       WORK(IR) is N by N */
+
+			    ldwrkr = *n;
+			}
+			itau = ir + ldwrkr * *n;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Copy R to WORK(IR), zeroing out below it */
+
+			clacpy_("U", n, n, &a[a_offset], lda, &work[ir], &
+				ldwrkr);
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &work[ir + 1]
+, &ldwrkr);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need N*N+N+M, prefer N*N+N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, m, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Bidiagonalize R in WORK(IR) */
+/*                    (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &work[ir], &ldwrkr, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors in WORK(IR) */
+/*                    (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", n, n, n, &work[ir], &ldwrkr, &work[itauq]
+, &work[iwork], &i__2, &ierr);
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of R in WORK(IR) */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, &c__0, n, &c__0, &s[1], &rwork[ie], 
+				cdum, &c__1, &work[ir], &ldwrkr, cdum, &c__1, 
+				&rwork[irwork], info);
+
+/*                    Multiply Q in U by left singular vectors of R in */
+/*                    WORK(IR), storing result in A */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, n, &c_b2, &u[u_offset], ldu, &
+				work[ir], &ldwrkr, &c_b1, &a[a_offset], lda);
+
+/*                    Copy left singular vectors of A from A to U */
+
+			clacpy_("F", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need N+M, prefer N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, m, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Zero out below R in A */
+
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &a[a_dim1 + 
+				2], lda);
+
+/*                    Bidiagonalize R in A */
+/*                    (CWorkspace: need 3*N, prefer 2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &a[a_offset], lda, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply Q in U by left bidiagonalizing vectors */
+/*                    in A */
+/*                    (CWorkspace: need 2*N+M, prefer 2*N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("Q", "R", "N", m, n, n, &a[a_offset], lda, &
+				work[itauq], &u[u_offset], ldu, &work[iwork], 
+				&i__2, &ierr)
+				;
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in U */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, &c__0, m, &c__0, &s[1], &rwork[ie], 
+				cdum, &c__1, &u[u_offset], ldu, cdum, &c__1, &
+				rwork[irwork], info);
+
+		    }
+
+		} else if (wntvo) {
+
+/*                 Path 8 (M much larger than N, JOBU='A', JOBVT='O') */
+/*                 M left singular vectors to be computed in U and */
+/*                 N right singular vectors to be overwritten on A */
+
+/* Computing MAX */
+		    i__2 = *n + *m, i__3 = *n * 3;
+		    if (*lwork >= (*n << 1) * *n + max(i__2,i__3)) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			iu = 1;
+			if (*lwork >= wrkbl + (*lda << 1) * *n) {
+
+/*                       WORK(IU) is LDA by N and WORK(IR) is LDA by N */
+
+			    ldwrku = *lda;
+			    ir = iu + ldwrku * *n;
+			    ldwrkr = *lda;
+			} else if (*lwork >= wrkbl + (*lda + *n) * *n) {
+
+/*                       WORK(IU) is LDA by N and WORK(IR) is N by N */
+
+			    ldwrku = *lda;
+			    ir = iu + ldwrku * *n;
+			    ldwrkr = *n;
+			} else {
+
+/*                       WORK(IU) is N by N and WORK(IR) is N by N */
+
+			    ldwrku = *n;
+			    ir = iu + ldwrku * *n;
+			    ldwrkr = *n;
+			}
+			itau = ir + ldwrkr * *n;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need 2*N*N+N+M, prefer 2*N*N+N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, m, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+
+/*                    Copy R to WORK(IU), zeroing out below it */
+
+			clacpy_("U", n, n, &a[a_offset], lda, &work[iu], &
+				ldwrku);
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &work[iu + 1]
+, &ldwrku);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Bidiagonalize R in WORK(IU), copying result to */
+/*                    WORK(IR) */
+/*                    (CWorkspace: need   2*N*N+3*N, */
+/*                                 prefer 2*N*N+2*N+2*N*NB) */
+/*                    (RWorkspace: need   N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &work[iu], &ldwrku, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+			clacpy_("U", n, n, &work[iu], &ldwrku, &work[ir], &
+				ldwrkr);
+
+/*                    Generate left bidiagonalizing vectors in WORK(IU) */
+/*                    (CWorkspace: need 2*N*N+3*N, prefer 2*N*N+2*N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", n, n, n, &work[iu], &ldwrku, &work[itauq]
+, &work[iwork], &i__2, &ierr);
+
+/*                    Generate right bidiagonalizing vectors in WORK(IR) */
+/*                    (CWorkspace: need   2*N*N+3*N-1, */
+/*                                 prefer 2*N*N+2*N+(N-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", n, n, n, &work[ir], &ldwrkr, &work[itaup]
+, &work[iwork], &i__2, &ierr);
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of R in WORK(IU) and computing */
+/*                    right singular vectors of R in WORK(IR) */
+/*                    (CWorkspace: need 2*N*N) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, n, n, &c__0, &s[1], &rwork[ie], &work[
+				ir], &ldwrkr, &work[iu], &ldwrku, cdum, &c__1, 
+				 &rwork[irwork], info);
+
+/*                    Multiply Q in U by left singular vectors of R in */
+/*                    WORK(IU), storing result in A */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, n, &c_b2, &u[u_offset], ldu, &
+				work[iu], &ldwrku, &c_b1, &a[a_offset], lda);
+
+/*                    Copy left singular vectors of A from A to U */
+
+			clacpy_("F", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Copy right singular vectors of R from WORK(IR) to A */
+
+			clacpy_("F", n, n, &work[ir], &ldwrkr, &a[a_offset], 
+				lda);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need N+M, prefer N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, m, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Zero out below R in A */
+
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &a[a_dim1 + 
+				2], lda);
+
+/*                    Bidiagonalize R in A */
+/*                    (CWorkspace: need 3*N, prefer 2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &a[a_offset], lda, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply Q in U by left bidiagonalizing vectors */
+/*                    in A */
+/*                    (CWorkspace: need 2*N+M, prefer 2*N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("Q", "R", "N", m, n, n, &a[a_offset], lda, &
+				work[itauq], &u[u_offset], ldu, &work[iwork], 
+				&i__2, &ierr)
+				;
+
+/*                    Generate right bidiagonalizing vectors in A */
+/*                    (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", n, n, n, &a[a_offset], lda, &work[itaup], 
+				 &work[iwork], &i__2, &ierr);
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in U and computing right */
+/*                    singular vectors of A in A */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, n, m, &c__0, &s[1], &rwork[ie], &a[
+				a_offset], lda, &u[u_offset], ldu, cdum, &
+				c__1, &rwork[irwork], info);
+
+		    }
+
+		} else if (wntvas) {
+
+/*                 Path 9 (M much larger than N, JOBU='A', JOBVT='S' */
+/*                         or 'A') */
+/*                 M left singular vectors to be computed in U and */
+/*                 N right singular vectors to be computed in VT */
+
+/* Computing MAX */
+		    i__2 = *n + *m, i__3 = *n * 3;
+		    if (*lwork >= *n * *n + max(i__2,i__3)) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			iu = 1;
+			if (*lwork >= wrkbl + *lda * *n) {
+
+/*                       WORK(IU) is LDA by N */
+
+			    ldwrku = *lda;
+			} else {
+
+/*                       WORK(IU) is N by N */
+
+			    ldwrku = *n;
+			}
+			itau = iu + ldwrku * *n;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need N*N+N+M, prefer N*N+N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, m, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+
+/*                    Copy R to WORK(IU), zeroing out below it */
+
+			clacpy_("U", n, n, &a[a_offset], lda, &work[iu], &
+				ldwrku);
+			i__2 = *n - 1;
+			i__3 = *n - 1;
+			claset_("L", &i__2, &i__3, &c_b1, &c_b1, &work[iu + 1]
+, &ldwrku);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Bidiagonalize R in WORK(IU), copying result to VT */
+/*                    (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &work[iu], &ldwrku, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+			clacpy_("U", n, n, &work[iu], &ldwrku, &vt[vt_offset], 
+				 ldvt);
+
+/*                    Generate left bidiagonalizing vectors in WORK(IU) */
+/*                    (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", n, n, n, &work[iu], &ldwrku, &work[itauq]
+, &work[iwork], &i__2, &ierr);
+
+/*                    Generate right bidiagonalizing vectors in VT */
+/*                    (CWorkspace: need   N*N+3*N-1, */
+/*                                 prefer N*N+2*N+(N-1)*NB) */
+/*                    (RWorkspace: need   0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", n, n, n, &vt[vt_offset], ldvt, &work[
+				itaup], &work[iwork], &i__2, &ierr)
+				;
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of R in WORK(IU) and computing */
+/*                    right singular vectors of R in VT */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, n, n, &c__0, &s[1], &rwork[ie], &vt[
+				vt_offset], ldvt, &work[iu], &ldwrku, cdum, &
+				c__1, &rwork[irwork], info);
+
+/*                    Multiply Q in U by left singular vectors of R in */
+/*                    WORK(IU), storing result in A */
+/*                    (CWorkspace: need N*N) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, n, &c_b2, &u[u_offset], ldu, &
+				work[iu], &ldwrku, &c_b1, &a[a_offset], lda);
+
+/*                    Copy left singular vectors of A from A to U */
+
+			clacpy_("F", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *n;
+
+/*                    Compute A=Q*R, copying result to U */
+/*                    (CWorkspace: need 2*N, prefer N+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgeqrf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+
+/*                    Generate Q in U */
+/*                    (CWorkspace: need N+M, prefer N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungqr_(m, m, n, &u[u_offset], ldu, &work[itau], &
+				work[iwork], &i__2, &ierr);
+
+/*                    Copy R from A to VT, zeroing out below it */
+
+			clacpy_("U", n, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+			if (*n > 1) {
+			    i__2 = *n - 1;
+			    i__3 = *n - 1;
+			    claset_("L", &i__2, &i__3, &c_b1, &c_b1, &vt[
+				    vt_dim1 + 2], ldvt);
+			}
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *n;
+			iwork = itaup + *n;
+
+/*                    Bidiagonalize R in VT */
+/*                    (CWorkspace: need 3*N, prefer 2*N+2*N*NB) */
+/*                    (RWorkspace: need N) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(n, n, &vt[vt_offset], ldvt, &s[1], &rwork[ie], 
+				 &work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply Q in U by left bidiagonalizing vectors */
+/*                    in VT */
+/*                    (CWorkspace: need 2*N+M, prefer 2*N+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("Q", "R", "N", m, n, n, &vt[vt_offset], ldvt, 
+				&work[itauq], &u[u_offset], ldu, &work[iwork], 
+				 &i__2, &ierr);
+
+/*                    Generate right bidiagonalizing vectors in VT */
+/*                    (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", n, n, n, &vt[vt_offset], ldvt, &work[
+				itaup], &work[iwork], &i__2, &ierr)
+				;
+			irwork = ie + *n;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in U and computing right */
+/*                    singular vectors of A in VT */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", n, n, m, &c__0, &s[1], &rwork[ie], &vt[
+				vt_offset], ldvt, &u[u_offset], ldu, cdum, &
+				c__1, &rwork[irwork], info);
+
+		    }
+
+		}
+
+	    }
+
+	} else {
+
+/*           M .LT. MNTHR */
+
+/*           Path 10 (M at least N, but not much larger) */
+/*           Reduce to bidiagonal form without QR decomposition */
+
+	    ie = 1;
+	    itauq = 1;
+	    itaup = itauq + *n;
+	    iwork = itaup + *n;
+
+/*           Bidiagonalize A */
+/*           (CWorkspace: need 2*N+M, prefer 2*N+(M+N)*NB) */
+/*           (RWorkspace: need N) */
+
+	    i__2 = *lwork - iwork + 1;
+	    cgebrd_(m, n, &a[a_offset], lda, &s[1], &rwork[ie], &work[itauq], 
+		    &work[itaup], &work[iwork], &i__2, &ierr);
+	    if (wntuas) {
+
+/*              If left singular vectors desired in U, copy result to U */
+/*              and generate left bidiagonalizing vectors in U */
+/*              (CWorkspace: need 2*N+NCU, prefer 2*N+NCU*NB) */
+/*              (RWorkspace: 0) */
+
+		clacpy_("L", m, n, &a[a_offset], lda, &u[u_offset], ldu);
+		if (wntus) {
+		    ncu = *n;
+		}
+		if (wntua) {
+		    ncu = *m;
+		}
+		i__2 = *lwork - iwork + 1;
+		cungbr_("Q", m, &ncu, n, &u[u_offset], ldu, &work[itauq], &
+			work[iwork], &i__2, &ierr);
+	    }
+	    if (wntvas) {
+
+/*              If right singular vectors desired in VT, copy result to */
+/*              VT and generate right bidiagonalizing vectors in VT */
+/*              (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) */
+/*              (RWorkspace: 0) */
+
+		clacpy_("U", n, n, &a[a_offset], lda, &vt[vt_offset], ldvt);
+		i__2 = *lwork - iwork + 1;
+		cungbr_("P", n, n, n, &vt[vt_offset], ldvt, &work[itaup], &
+			work[iwork], &i__2, &ierr);
+	    }
+	    if (wntuo) {
+
+/*              If left singular vectors desired in A, generate left */
+/*              bidiagonalizing vectors in A */
+/*              (CWorkspace: need 3*N, prefer 2*N+N*NB) */
+/*              (RWorkspace: 0) */
+
+		i__2 = *lwork - iwork + 1;
+		cungbr_("Q", m, n, n, &a[a_offset], lda, &work[itauq], &work[
+			iwork], &i__2, &ierr);
+	    }
+	    if (wntvo) {
+
+/*              If right singular vectors desired in A, generate right */
+/*              bidiagonalizing vectors in A */
+/*              (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) */
+/*              (RWorkspace: 0) */
+
+		i__2 = *lwork - iwork + 1;
+		cungbr_("P", n, n, n, &a[a_offset], lda, &work[itaup], &work[
+			iwork], &i__2, &ierr);
+	    }
+	    irwork = ie + *n;
+	    if (wntuas || wntuo) {
+		nru = *m;
+	    }
+	    if (wntun) {
+		nru = 0;
+	    }
+	    if (wntvas || wntvo) {
+		ncvt = *n;
+	    }
+	    if (wntvn) {
+		ncvt = 0;
+	    }
+	    if (! wntuo && ! wntvo) {
+
+/*              Perform bidiagonal QR iteration, if desired, computing */
+/*              left singular vectors in U and computing right singular */
+/*              vectors in VT */
+/*              (CWorkspace: 0) */
+/*              (RWorkspace: need BDSPAC) */
+
+		cbdsqr_("U", n, &ncvt, &nru, &c__0, &s[1], &rwork[ie], &vt[
+			vt_offset], ldvt, &u[u_offset], ldu, cdum, &c__1, &
+			rwork[irwork], info);
+	    } else if (! wntuo && wntvo) {
+
+/*              Perform bidiagonal QR iteration, if desired, computing */
+/*              left singular vectors in U and computing right singular */
+/*              vectors in A */
+/*              (CWorkspace: 0) */
+/*              (RWorkspace: need BDSPAC) */
+
+		cbdsqr_("U", n, &ncvt, &nru, &c__0, &s[1], &rwork[ie], &a[
+			a_offset], lda, &u[u_offset], ldu, cdum, &c__1, &
+			rwork[irwork], info);
+	    } else {
+
+/*              Perform bidiagonal QR iteration, if desired, computing */
+/*              left singular vectors in A and computing right singular */
+/*              vectors in VT */
+/*              (CWorkspace: 0) */
+/*              (RWorkspace: need BDSPAC) */
+
+		cbdsqr_("U", n, &ncvt, &nru, &c__0, &s[1], &rwork[ie], &vt[
+			vt_offset], ldvt, &a[a_offset], lda, cdum, &c__1, &
+			rwork[irwork], info);
+	    }
+
+	}
+
+    } else {
+
+/*        A has more columns than rows. If A has sufficiently more */
+/*        columns than rows, first reduce using the LQ decomposition (if */
+/*        sufficient workspace available) */
+
+	if (*n >= mnthr) {
+
+	    if (wntvn) {
+
+/*              Path 1t(N much larger than M, JOBVT='N') */
+/*              No right singular vectors to be computed */
+
+		itau = 1;
+		iwork = itau + *m;
+
+/*              Compute A=L*Q */
+/*              (CWorkspace: need 2*M, prefer M+M*NB) */
+/*              (RWorkspace: 0) */
+
+		i__2 = *lwork - iwork + 1;
+		cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[iwork], &
+			i__2, &ierr);
+
+/*              Zero out above L */
+
+		i__2 = *m - 1;
+		i__3 = *m - 1;
+		claset_("U", &i__2, &i__3, &c_b1, &c_b1, &a[(a_dim1 << 1) + 1]
+, lda);
+		ie = 1;
+		itauq = 1;
+		itaup = itauq + *m;
+		iwork = itaup + *m;
+
+/*              Bidiagonalize L in A */
+/*              (CWorkspace: need 3*M, prefer 2*M+2*M*NB) */
+/*              (RWorkspace: need M) */
+
+		i__2 = *lwork - iwork + 1;
+		cgebrd_(m, m, &a[a_offset], lda, &s[1], &rwork[ie], &work[
+			itauq], &work[itaup], &work[iwork], &i__2, &ierr);
+		if (wntuo || wntuas) {
+
+/*                 If left singular vectors desired, generate Q */
+/*                 (CWorkspace: need 3*M, prefer 2*M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cungbr_("Q", m, m, m, &a[a_offset], lda, &work[itauq], &
+			    work[iwork], &i__2, &ierr);
+		}
+		irwork = ie + *m;
+		nru = 0;
+		if (wntuo || wntuas) {
+		    nru = *m;
+		}
+
+/*              Perform bidiagonal QR iteration, computing left singular */
+/*              vectors of A in A if desired */
+/*              (CWorkspace: 0) */
+/*              (RWorkspace: need BDSPAC) */
+
+		cbdsqr_("U", m, &c__0, &nru, &c__0, &s[1], &rwork[ie], cdum, &
+			c__1, &a[a_offset], lda, cdum, &c__1, &rwork[irwork], 
+			info);
+
+/*              If left singular vectors desired in U, copy them there */
+
+		if (wntuas) {
+		    clacpy_("F", m, m, &a[a_offset], lda, &u[u_offset], ldu);
+		}
+
+	    } else if (wntvo && wntun) {
+
+/*              Path 2t(N much larger than M, JOBU='N', JOBVT='O') */
+/*              M right singular vectors to be overwritten on A and */
+/*              no left singular vectors to be computed */
+
+		if (*lwork >= *m * *m + *m * 3) {
+
+/*                 Sufficient workspace for a fast algorithm */
+
+		    ir = 1;
+/* Computing MAX */
+		    i__2 = wrkbl, i__3 = *lda * *n;
+		    if (*lwork >= max(i__2,i__3) + *lda * *m) {
+
+/*                    WORK(IU) is LDA by N and WORK(IR) is LDA by M */
+
+			ldwrku = *lda;
+			chunk = *n;
+			ldwrkr = *lda;
+		    } else /* if(complicated condition) */ {
+/* Computing MAX */
+			i__2 = wrkbl, i__3 = *lda * *n;
+			if (*lwork >= max(i__2,i__3) + *m * *m) {
+
+/*                    WORK(IU) is LDA by N and WORK(IR) is M by M */
+
+			    ldwrku = *lda;
+			    chunk = *n;
+			    ldwrkr = *m;
+			} else {
+
+/*                    WORK(IU) is M by CHUNK and WORK(IR) is M by M */
+
+			    ldwrku = *m;
+			    chunk = (*lwork - *m * *m) / *m;
+			    ldwrkr = *m;
+			}
+		    }
+		    itau = ir + ldwrkr * *m;
+		    iwork = itau + *m;
+
+/*                 Compute A=L*Q */
+/*                 (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[iwork]
+, &i__2, &ierr);
+
+/*                 Copy L to WORK(IR) and zero out above it */
+
+		    clacpy_("L", m, m, &a[a_offset], lda, &work[ir], &ldwrkr);
+		    i__2 = *m - 1;
+		    i__3 = *m - 1;
+		    claset_("U", &i__2, &i__3, &c_b1, &c_b1, &work[ir + 
+			    ldwrkr], &ldwrkr);
+
+/*                 Generate Q in A */
+/*                 (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cunglq_(m, n, m, &a[a_offset], lda, &work[itau], &work[
+			    iwork], &i__2, &ierr);
+		    ie = 1;
+		    itauq = itau;
+		    itaup = itauq + *m;
+		    iwork = itaup + *m;
+
+/*                 Bidiagonalize L in WORK(IR) */
+/*                 (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) */
+/*                 (RWorkspace: need M) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cgebrd_(m, m, &work[ir], &ldwrkr, &s[1], &rwork[ie], &
+			    work[itauq], &work[itaup], &work[iwork], &i__2, &
+			    ierr);
+
+/*                 Generate right vectors bidiagonalizing L */
+/*                 (CWorkspace: need M*M+3*M-1, prefer M*M+2*M+(M-1)*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cungbr_("P", m, m, m, &work[ir], &ldwrkr, &work[itaup], &
+			    work[iwork], &i__2, &ierr);
+		    irwork = ie + *m;
+
+/*                 Perform bidiagonal QR iteration, computing right */
+/*                 singular vectors of L in WORK(IR) */
+/*                 (CWorkspace: need M*M) */
+/*                 (RWorkspace: need BDSPAC) */
+
+		    cbdsqr_("U", m, m, &c__0, &c__0, &s[1], &rwork[ie], &work[
+			    ir], &ldwrkr, cdum, &c__1, cdum, &c__1, &rwork[
+			    irwork], info);
+		    iu = itauq;
+
+/*                 Multiply right singular vectors of L in WORK(IR) by Q */
+/*                 in A, storing result in WORK(IU) and copying to A */
+/*                 (CWorkspace: need M*M+M, prefer M*M+M*N) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *n;
+		    i__3 = chunk;
+		    for (i__ = 1; i__3 < 0 ? i__ >= i__2 : i__ <= i__2; i__ +=
+			     i__3) {
+/* Computing MIN */
+			i__4 = *n - i__ + 1;
+			blk = min(i__4,chunk);
+			cgemm_("N", "N", m, &blk, m, &c_b2, &work[ir], &
+				ldwrkr, &a[i__ * a_dim1 + 1], lda, &c_b1, &
+				work[iu], &ldwrku);
+			clacpy_("F", m, &blk, &work[iu], &ldwrku, &a[i__ * 
+				a_dim1 + 1], lda);
+/* L30: */
+		    }
+
+		} else {
+
+/*                 Insufficient workspace for a fast algorithm */
+
+		    ie = 1;
+		    itauq = 1;
+		    itaup = itauq + *m;
+		    iwork = itaup + *m;
+
+/*                 Bidiagonalize A */
+/*                 (CWorkspace: need 2*M+N, prefer 2*M+(M+N)*NB) */
+/*                 (RWorkspace: need M) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cgebrd_(m, n, &a[a_offset], lda, &s[1], &rwork[ie], &work[
+			    itauq], &work[itaup], &work[iwork], &i__3, &ierr);
+
+/*                 Generate right vectors bidiagonalizing A */
+/*                 (CWorkspace: need 3*M, prefer 2*M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cungbr_("P", m, n, m, &a[a_offset], lda, &work[itaup], &
+			    work[iwork], &i__3, &ierr);
+		    irwork = ie + *m;
+
+/*                 Perform bidiagonal QR iteration, computing right */
+/*                 singular vectors of A in A */
+/*                 (CWorkspace: 0) */
+/*                 (RWorkspace: need BDSPAC) */
+
+		    cbdsqr_("L", m, n, &c__0, &c__0, &s[1], &rwork[ie], &a[
+			    a_offset], lda, cdum, &c__1, cdum, &c__1, &rwork[
+			    irwork], info);
+
+		}
+
+	    } else if (wntvo && wntuas) {
+
+/*              Path 3t(N much larger than M, JOBU='S' or 'A', JOBVT='O') */
+/*              M right singular vectors to be overwritten on A and */
+/*              M left singular vectors to be computed in U */
+
+		if (*lwork >= *m * *m + *m * 3) {
+
+/*                 Sufficient workspace for a fast algorithm */
+
+		    ir = 1;
+/* Computing MAX */
+		    i__3 = wrkbl, i__2 = *lda * *n;
+		    if (*lwork >= max(i__3,i__2) + *lda * *m) {
+
+/*                    WORK(IU) is LDA by N and WORK(IR) is LDA by M */
+
+			ldwrku = *lda;
+			chunk = *n;
+			ldwrkr = *lda;
+		    } else /* if(complicated condition) */ {
+/* Computing MAX */
+			i__3 = wrkbl, i__2 = *lda * *n;
+			if (*lwork >= max(i__3,i__2) + *m * *m) {
+
+/*                    WORK(IU) is LDA by N and WORK(IR) is M by M */
+
+			    ldwrku = *lda;
+			    chunk = *n;
+			    ldwrkr = *m;
+			} else {
+
+/*                    WORK(IU) is M by CHUNK and WORK(IR) is M by M */
+
+			    ldwrku = *m;
+			    chunk = (*lwork - *m * *m) / *m;
+			    ldwrkr = *m;
+			}
+		    }
+		    itau = ir + ldwrkr * *m;
+		    iwork = itau + *m;
+
+/*                 Compute A=L*Q */
+/*                 (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[iwork]
+, &i__3, &ierr);
+
+/*                 Copy L to U, zeroing about above it */
+
+		    clacpy_("L", m, m, &a[a_offset], lda, &u[u_offset], ldu);
+		    i__3 = *m - 1;
+		    i__2 = *m - 1;
+		    claset_("U", &i__3, &i__2, &c_b1, &c_b1, &u[(u_dim1 << 1) 
+			    + 1], ldu);
+
+/*                 Generate Q in A */
+/*                 (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cunglq_(m, n, m, &a[a_offset], lda, &work[itau], &work[
+			    iwork], &i__3, &ierr);
+		    ie = 1;
+		    itauq = itau;
+		    itaup = itauq + *m;
+		    iwork = itaup + *m;
+
+/*                 Bidiagonalize L in U, copying result to WORK(IR) */
+/*                 (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) */
+/*                 (RWorkspace: need M) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cgebrd_(m, m, &u[u_offset], ldu, &s[1], &rwork[ie], &work[
+			    itauq], &work[itaup], &work[iwork], &i__3, &ierr);
+		    clacpy_("U", m, m, &u[u_offset], ldu, &work[ir], &ldwrkr);
+
+/*                 Generate right vectors bidiagonalizing L in WORK(IR) */
+/*                 (CWorkspace: need M*M+3*M-1, prefer M*M+2*M+(M-1)*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cungbr_("P", m, m, m, &work[ir], &ldwrkr, &work[itaup], &
+			    work[iwork], &i__3, &ierr);
+
+/*                 Generate left vectors bidiagonalizing L in U */
+/*                 (CWorkspace: need M*M+3*M, prefer M*M+2*M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *lwork - iwork + 1;
+		    cungbr_("Q", m, m, m, &u[u_offset], ldu, &work[itauq], &
+			    work[iwork], &i__3, &ierr);
+		    irwork = ie + *m;
+
+/*                 Perform bidiagonal QR iteration, computing left */
+/*                 singular vectors of L in U, and computing right */
+/*                 singular vectors of L in WORK(IR) */
+/*                 (CWorkspace: need M*M) */
+/*                 (RWorkspace: need BDSPAC) */
+
+		    cbdsqr_("U", m, m, m, &c__0, &s[1], &rwork[ie], &work[ir], 
+			     &ldwrkr, &u[u_offset], ldu, cdum, &c__1, &rwork[
+			    irwork], info);
+		    iu = itauq;
+
+/*                 Multiply right singular vectors of L in WORK(IR) by Q */
+/*                 in A, storing result in WORK(IU) and copying to A */
+/*                 (CWorkspace: need M*M+M, prefer M*M+M*N)) */
+/*                 (RWorkspace: 0) */
+
+		    i__3 = *n;
+		    i__2 = chunk;
+		    for (i__ = 1; i__2 < 0 ? i__ >= i__3 : i__ <= i__3; i__ +=
+			     i__2) {
+/* Computing MIN */
+			i__4 = *n - i__ + 1;
+			blk = min(i__4,chunk);
+			cgemm_("N", "N", m, &blk, m, &c_b2, &work[ir], &
+				ldwrkr, &a[i__ * a_dim1 + 1], lda, &c_b1, &
+				work[iu], &ldwrku);
+			clacpy_("F", m, &blk, &work[iu], &ldwrku, &a[i__ * 
+				a_dim1 + 1], lda);
+/* L40: */
+		    }
+
+		} else {
+
+/*                 Insufficient workspace for a fast algorithm */
+
+		    itau = 1;
+		    iwork = itau + *m;
+
+/*                 Compute A=L*Q */
+/*                 (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[iwork]
+, &i__2, &ierr);
+
+/*                 Copy L to U, zeroing out above it */
+
+		    clacpy_("L", m, m, &a[a_offset], lda, &u[u_offset], ldu);
+		    i__2 = *m - 1;
+		    i__3 = *m - 1;
+		    claset_("U", &i__2, &i__3, &c_b1, &c_b1, &u[(u_dim1 << 1) 
+			    + 1], ldu);
+
+/*                 Generate Q in A */
+/*                 (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cunglq_(m, n, m, &a[a_offset], lda, &work[itau], &work[
+			    iwork], &i__2, &ierr);
+		    ie = 1;
+		    itauq = itau;
+		    itaup = itauq + *m;
+		    iwork = itaup + *m;
+
+/*                 Bidiagonalize L in U */
+/*                 (CWorkspace: need 3*M, prefer 2*M+2*M*NB) */
+/*                 (RWorkspace: need M) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cgebrd_(m, m, &u[u_offset], ldu, &s[1], &rwork[ie], &work[
+			    itauq], &work[itaup], &work[iwork], &i__2, &ierr);
+
+/*                 Multiply right vectors bidiagonalizing L by Q in A */
+/*                 (CWorkspace: need 2*M+N, prefer 2*M+N*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cunmbr_("P", "L", "C", m, n, m, &u[u_offset], ldu, &work[
+			    itaup], &a[a_offset], lda, &work[iwork], &i__2, &
+			    ierr);
+
+/*                 Generate left vectors bidiagonalizing L in U */
+/*                 (CWorkspace: need 3*M, prefer 2*M+M*NB) */
+/*                 (RWorkspace: 0) */
+
+		    i__2 = *lwork - iwork + 1;
+		    cungbr_("Q", m, m, m, &u[u_offset], ldu, &work[itauq], &
+			    work[iwork], &i__2, &ierr);
+		    irwork = ie + *m;
+
+/*                 Perform bidiagonal QR iteration, computing left */
+/*                 singular vectors of A in U and computing right */
+/*                 singular vectors of A in A */
+/*                 (CWorkspace: 0) */
+/*                 (RWorkspace: need BDSPAC) */
+
+		    cbdsqr_("U", m, n, m, &c__0, &s[1], &rwork[ie], &a[
+			    a_offset], lda, &u[u_offset], ldu, cdum, &c__1, &
+			    rwork[irwork], info);
+
+		}
+
+	    } else if (wntvs) {
+
+		if (wntun) {
+
+/*                 Path 4t(N much larger than M, JOBU='N', JOBVT='S') */
+/*                 M right singular vectors to be computed in VT and */
+/*                 no left singular vectors to be computed */
+
+		    if (*lwork >= *m * *m + *m * 3) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			ir = 1;
+			if (*lwork >= wrkbl + *lda * *m) {
+
+/*                       WORK(IR) is LDA by M */
+
+			    ldwrkr = *lda;
+			} else {
+
+/*                       WORK(IR) is M by M */
+
+			    ldwrkr = *m;
+			}
+			itau = ir + ldwrkr * *m;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q */
+/*                    (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+
+/*                    Copy L to WORK(IR), zeroing out above it */
+
+			clacpy_("L", m, m, &a[a_offset], lda, &work[ir], &
+				ldwrkr);
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &work[ir + 
+				ldwrkr], &ldwrkr);
+
+/*                    Generate Q in A */
+/*                    (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(m, n, m, &a[a_offset], lda, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Bidiagonalize L in WORK(IR) */
+/*                    (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &work[ir], &ldwrkr, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Generate right vectors bidiagonalizing L in */
+/*                    WORK(IR) */
+/*                    (CWorkspace: need M*M+3*M, prefer M*M+2*M+(M-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", m, m, m, &work[ir], &ldwrkr, &work[itaup]
+, &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing right */
+/*                    singular vectors of L in WORK(IR) */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, m, &c__0, &c__0, &s[1], &rwork[ie], &
+				work[ir], &ldwrkr, cdum, &c__1, cdum, &c__1, &
+				rwork[irwork], info);
+
+/*                    Multiply right singular vectors of L in WORK(IR) by */
+/*                    Q in A, storing result in VT */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, m, &c_b2, &work[ir], &ldwrkr, &
+				a[a_offset], lda, &c_b1, &vt[vt_offset], ldvt);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+
+/*                    Copy result to VT */
+
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(m, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Zero out above L in A */
+
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &a[(a_dim1 <<
+				 1) + 1], lda);
+
+/*                    Bidiagonalize L in A */
+/*                    (CWorkspace: need 3*M, prefer 2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &a[a_offset], lda, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply right vectors bidiagonalizing L by Q in VT */
+/*                    (CWorkspace: need 2*M+N, prefer 2*M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("P", "L", "C", m, n, m, &a[a_offset], lda, &
+				work[itaup], &vt[vt_offset], ldvt, &work[
+				iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing right */
+/*                    singular vectors of A in VT */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, n, &c__0, &c__0, &s[1], &rwork[ie], &
+				vt[vt_offset], ldvt, cdum, &c__1, cdum, &c__1, 
+				 &rwork[irwork], info);
+
+		    }
+
+		} else if (wntuo) {
+
+/*                 Path 5t(N much larger than M, JOBU='O', JOBVT='S') */
+/*                 M right singular vectors to be computed in VT and */
+/*                 M left singular vectors to be overwritten on A */
+
+		    if (*lwork >= (*m << 1) * *m + *m * 3) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			iu = 1;
+			if (*lwork >= wrkbl + (*lda << 1) * *m) {
+
+/*                       WORK(IU) is LDA by M and WORK(IR) is LDA by M */
+
+			    ldwrku = *lda;
+			    ir = iu + ldwrku * *m;
+			    ldwrkr = *lda;
+			} else if (*lwork >= wrkbl + (*lda + *m) * *m) {
+
+/*                       WORK(IU) is LDA by M and WORK(IR) is M by M */
+
+			    ldwrku = *lda;
+			    ir = iu + ldwrku * *m;
+			    ldwrkr = *m;
+			} else {
+
+/*                       WORK(IU) is M by M and WORK(IR) is M by M */
+
+			    ldwrku = *m;
+			    ir = iu + ldwrku * *m;
+			    ldwrkr = *m;
+			}
+			itau = ir + ldwrkr * *m;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q */
+/*                    (CWorkspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+
+/*                    Copy L to WORK(IU), zeroing out below it */
+
+			clacpy_("L", m, m, &a[a_offset], lda, &work[iu], &
+				ldwrku);
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &work[iu + 
+				ldwrku], &ldwrku);
+
+/*                    Generate Q in A */
+/*                    (CWorkspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(m, n, m, &a[a_offset], lda, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Bidiagonalize L in WORK(IU), copying result to */
+/*                    WORK(IR) */
+/*                    (CWorkspace: need   2*M*M+3*M, */
+/*                                 prefer 2*M*M+2*M+2*M*NB) */
+/*                    (RWorkspace: need   M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &work[iu], &ldwrku, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+			clacpy_("L", m, m, &work[iu], &ldwrku, &work[ir], &
+				ldwrkr);
+
+/*                    Generate right bidiagonalizing vectors in WORK(IU) */
+/*                    (CWorkspace: need   2*M*M+3*M-1, */
+/*                                 prefer 2*M*M+2*M+(M-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", m, m, m, &work[iu], &ldwrku, &work[itaup]
+, &work[iwork], &i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors in WORK(IR) */
+/*                    (CWorkspace: need 2*M*M+3*M, prefer 2*M*M+2*M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", m, m, m, &work[ir], &ldwrkr, &work[itauq]
+, &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of L in WORK(IR) and computing */
+/*                    right singular vectors of L in WORK(IU) */
+/*                    (CWorkspace: need 2*M*M) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, m, m, &c__0, &s[1], &rwork[ie], &work[
+				iu], &ldwrku, &work[ir], &ldwrkr, cdum, &c__1, 
+				 &rwork[irwork], info);
+
+/*                    Multiply right singular vectors of L in WORK(IU) by */
+/*                    Q in A, storing result in VT */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, m, &c_b2, &work[iu], &ldwrku, &
+				a[a_offset], lda, &c_b1, &vt[vt_offset], ldvt);
+
+/*                    Copy left singular vectors of L to A */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: 0) */
+
+			clacpy_("F", m, m, &work[ir], &ldwrkr, &a[a_offset], 
+				lda);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q, copying result to VT */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(m, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Zero out above L in A */
+
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &a[(a_dim1 <<
+				 1) + 1], lda);
+
+/*                    Bidiagonalize L in A */
+/*                    (CWorkspace: need 3*M, prefer 2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &a[a_offset], lda, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply right vectors bidiagonalizing L by Q in VT */
+/*                    (CWorkspace: need 2*M+N, prefer 2*M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("P", "L", "C", m, n, m, &a[a_offset], lda, &
+				work[itaup], &vt[vt_offset], ldvt, &work[
+				iwork], &i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors of L in A */
+/*                    (CWorkspace: need 3*M, prefer 2*M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", m, m, m, &a[a_offset], lda, &work[itauq], 
+				 &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in A and computing right */
+/*                    singular vectors of A in VT */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, n, m, &c__0, &s[1], &rwork[ie], &vt[
+				vt_offset], ldvt, &a[a_offset], lda, cdum, &
+				c__1, &rwork[irwork], info);
+
+		    }
+
+		} else if (wntuas) {
+
+/*                 Path 6t(N much larger than M, JOBU='S' or 'A', */
+/*                         JOBVT='S') */
+/*                 M right singular vectors to be computed in VT and */
+/*                 M left singular vectors to be computed in U */
+
+		    if (*lwork >= *m * *m + *m * 3) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			iu = 1;
+			if (*lwork >= wrkbl + *lda * *m) {
+
+/*                       WORK(IU) is LDA by N */
+
+			    ldwrku = *lda;
+			} else {
+
+/*                       WORK(IU) is LDA by M */
+
+			    ldwrku = *m;
+			}
+			itau = iu + ldwrku * *m;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q */
+/*                    (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+
+/*                    Copy L to WORK(IU), zeroing out above it */
+
+			clacpy_("L", m, m, &a[a_offset], lda, &work[iu], &
+				ldwrku);
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &work[iu + 
+				ldwrku], &ldwrku);
+
+/*                    Generate Q in A */
+/*                    (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(m, n, m, &a[a_offset], lda, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Bidiagonalize L in WORK(IU), copying result to U */
+/*                    (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &work[iu], &ldwrku, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+			clacpy_("L", m, m, &work[iu], &ldwrku, &u[u_offset], 
+				ldu);
+
+/*                    Generate right bidiagonalizing vectors in WORK(IU) */
+/*                    (CWorkspace: need   M*M+3*M-1, */
+/*                                 prefer M*M+2*M+(M-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", m, m, m, &work[iu], &ldwrku, &work[itaup]
+, &work[iwork], &i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors in U */
+/*                    (CWorkspace: need M*M+3*M, prefer M*M+2*M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", m, m, m, &u[u_offset], ldu, &work[itauq], 
+				 &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of L in U and computing right */
+/*                    singular vectors of L in WORK(IU) */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, m, m, &c__0, &s[1], &rwork[ie], &work[
+				iu], &ldwrku, &u[u_offset], ldu, cdum, &c__1, 
+				&rwork[irwork], info);
+
+/*                    Multiply right singular vectors of L in WORK(IU) by */
+/*                    Q in A, storing result in VT */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, m, &c_b2, &work[iu], &ldwrku, &
+				a[a_offset], lda, &c_b1, &vt[vt_offset], ldvt);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q, copying result to VT */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(m, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+
+/*                    Copy L to U, zeroing out above it */
+
+			clacpy_("L", m, m, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &u[(u_dim1 <<
+				 1) + 1], ldu);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Bidiagonalize L in U */
+/*                    (CWorkspace: need 3*M, prefer 2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &u[u_offset], ldu, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply right bidiagonalizing vectors in U by Q */
+/*                    in VT */
+/*                    (CWorkspace: need 2*M+N, prefer 2*M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("P", "L", "C", m, n, m, &u[u_offset], ldu, &
+				work[itaup], &vt[vt_offset], ldvt, &work[
+				iwork], &i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors in U */
+/*                    (CWorkspace: need 3*M, prefer 2*M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", m, m, m, &u[u_offset], ldu, &work[itauq], 
+				 &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in U and computing right */
+/*                    singular vectors of A in VT */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, n, m, &c__0, &s[1], &rwork[ie], &vt[
+				vt_offset], ldvt, &u[u_offset], ldu, cdum, &
+				c__1, &rwork[irwork], info);
+
+		    }
+
+		}
+
+	    } else if (wntva) {
+
+		if (wntun) {
+
+/*                 Path 7t(N much larger than M, JOBU='N', JOBVT='A') */
+/*                 N right singular vectors to be computed in VT and */
+/*                 no left singular vectors to be computed */
+
+/* Computing MAX */
+		    i__2 = *n + *m, i__3 = *m * 3;
+		    if (*lwork >= *m * *m + max(i__2,i__3)) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			ir = 1;
+			if (*lwork >= wrkbl + *lda * *m) {
+
+/*                       WORK(IR) is LDA by M */
+
+			    ldwrkr = *lda;
+			} else {
+
+/*                       WORK(IR) is M by M */
+
+			    ldwrkr = *m;
+			}
+			itau = ir + ldwrkr * *m;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q, copying result to VT */
+/*                    (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Copy L to WORK(IR), zeroing out above it */
+
+			clacpy_("L", m, m, &a[a_offset], lda, &work[ir], &
+				ldwrkr);
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &work[ir + 
+				ldwrkr], &ldwrkr);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need M*M+M+N, prefer M*M+M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(n, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Bidiagonalize L in WORK(IR) */
+/*                    (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &work[ir], &ldwrkr, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Generate right bidiagonalizing vectors in WORK(IR) */
+/*                    (CWorkspace: need   M*M+3*M-1, */
+/*                                 prefer M*M+2*M+(M-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", m, m, m, &work[ir], &ldwrkr, &work[itaup]
+, &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing right */
+/*                    singular vectors of L in WORK(IR) */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, m, &c__0, &c__0, &s[1], &rwork[ie], &
+				work[ir], &ldwrkr, cdum, &c__1, cdum, &c__1, &
+				rwork[irwork], info);
+
+/*                    Multiply right singular vectors of L in WORK(IR) by */
+/*                    Q in VT, storing result in A */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, m, &c_b2, &work[ir], &ldwrkr, &
+				vt[vt_offset], ldvt, &c_b1, &a[a_offset], lda);
+
+/*                    Copy right singular vectors of A from A to VT */
+
+			clacpy_("F", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q, copying result to VT */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need M+N, prefer M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(n, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Zero out above L in A */
+
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &a[(a_dim1 <<
+				 1) + 1], lda);
+
+/*                    Bidiagonalize L in A */
+/*                    (CWorkspace: need 3*M, prefer 2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &a[a_offset], lda, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply right bidiagonalizing vectors in A by Q */
+/*                    in VT */
+/*                    (CWorkspace: need 2*M+N, prefer 2*M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("P", "L", "C", m, n, m, &a[a_offset], lda, &
+				work[itaup], &vt[vt_offset], ldvt, &work[
+				iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing right */
+/*                    singular vectors of A in VT */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, n, &c__0, &c__0, &s[1], &rwork[ie], &
+				vt[vt_offset], ldvt, cdum, &c__1, cdum, &c__1, 
+				 &rwork[irwork], info);
+
+		    }
+
+		} else if (wntuo) {
+
+/*                 Path 8t(N much larger than M, JOBU='O', JOBVT='A') */
+/*                 N right singular vectors to be computed in VT and */
+/*                 M left singular vectors to be overwritten on A */
+
+/* Computing MAX */
+		    i__2 = *n + *m, i__3 = *m * 3;
+		    if (*lwork >= (*m << 1) * *m + max(i__2,i__3)) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			iu = 1;
+			if (*lwork >= wrkbl + (*lda << 1) * *m) {
+
+/*                       WORK(IU) is LDA by M and WORK(IR) is LDA by M */
+
+			    ldwrku = *lda;
+			    ir = iu + ldwrku * *m;
+			    ldwrkr = *lda;
+			} else if (*lwork >= wrkbl + (*lda + *m) * *m) {
+
+/*                       WORK(IU) is LDA by M and WORK(IR) is M by M */
+
+			    ldwrku = *lda;
+			    ir = iu + ldwrku * *m;
+			    ldwrkr = *m;
+			} else {
+
+/*                       WORK(IU) is M by M and WORK(IR) is M by M */
+
+			    ldwrku = *m;
+			    ir = iu + ldwrku * *m;
+			    ldwrkr = *m;
+			}
+			itau = ir + ldwrkr * *m;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q, copying result to VT */
+/*                    (CWorkspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need 2*M*M+M+N, prefer 2*M*M+M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(n, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+
+/*                    Copy L to WORK(IU), zeroing out above it */
+
+			clacpy_("L", m, m, &a[a_offset], lda, &work[iu], &
+				ldwrku);
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &work[iu + 
+				ldwrku], &ldwrku);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Bidiagonalize L in WORK(IU), copying result to */
+/*                    WORK(IR) */
+/*                    (CWorkspace: need   2*M*M+3*M, */
+/*                                 prefer 2*M*M+2*M+2*M*NB) */
+/*                    (RWorkspace: need   M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &work[iu], &ldwrku, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+			clacpy_("L", m, m, &work[iu], &ldwrku, &work[ir], &
+				ldwrkr);
+
+/*                    Generate right bidiagonalizing vectors in WORK(IU) */
+/*                    (CWorkspace: need   2*M*M+3*M-1, */
+/*                                 prefer 2*M*M+2*M+(M-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", m, m, m, &work[iu], &ldwrku, &work[itaup]
+, &work[iwork], &i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors in WORK(IR) */
+/*                    (CWorkspace: need 2*M*M+3*M, prefer 2*M*M+2*M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", m, m, m, &work[ir], &ldwrkr, &work[itauq]
+, &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of L in WORK(IR) and computing */
+/*                    right singular vectors of L in WORK(IU) */
+/*                    (CWorkspace: need 2*M*M) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, m, m, &c__0, &s[1], &rwork[ie], &work[
+				iu], &ldwrku, &work[ir], &ldwrkr, cdum, &c__1, 
+				 &rwork[irwork], info);
+
+/*                    Multiply right singular vectors of L in WORK(IU) by */
+/*                    Q in VT, storing result in A */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, m, &c_b2, &work[iu], &ldwrku, &
+				vt[vt_offset], ldvt, &c_b1, &a[a_offset], lda);
+
+/*                    Copy right singular vectors of A from A to VT */
+
+			clacpy_("F", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Copy left singular vectors of A from WORK(IR) to A */
+
+			clacpy_("F", m, m, &work[ir], &ldwrkr, &a[a_offset], 
+				lda);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q, copying result to VT */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need M+N, prefer M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(n, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Zero out above L in A */
+
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &a[(a_dim1 <<
+				 1) + 1], lda);
+
+/*                    Bidiagonalize L in A */
+/*                    (CWorkspace: need 3*M, prefer 2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &a[a_offset], lda, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply right bidiagonalizing vectors in A by Q */
+/*                    in VT */
+/*                    (CWorkspace: need 2*M+N, prefer 2*M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("P", "L", "C", m, n, m, &a[a_offset], lda, &
+				work[itaup], &vt[vt_offset], ldvt, &work[
+				iwork], &i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors in A */
+/*                    (CWorkspace: need 3*M, prefer 2*M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", m, m, m, &a[a_offset], lda, &work[itauq], 
+				 &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in A and computing right */
+/*                    singular vectors of A in VT */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, n, m, &c__0, &s[1], &rwork[ie], &vt[
+				vt_offset], ldvt, &a[a_offset], lda, cdum, &
+				c__1, &rwork[irwork], info);
+
+		    }
+
+		} else if (wntuas) {
+
+/*                 Path 9t(N much larger than M, JOBU='S' or 'A', */
+/*                         JOBVT='A') */
+/*                 N right singular vectors to be computed in VT and */
+/*                 M left singular vectors to be computed in U */
+
+/* Computing MAX */
+		    i__2 = *n + *m, i__3 = *m * 3;
+		    if (*lwork >= *m * *m + max(i__2,i__3)) {
+
+/*                    Sufficient workspace for a fast algorithm */
+
+			iu = 1;
+			if (*lwork >= wrkbl + *lda * *m) {
+
+/*                       WORK(IU) is LDA by M */
+
+			    ldwrku = *lda;
+			} else {
+
+/*                       WORK(IU) is M by M */
+
+			    ldwrku = *m;
+			}
+			itau = iu + ldwrku * *m;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q, copying result to VT */
+/*                    (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need M*M+M+N, prefer M*M+M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(n, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+
+/*                    Copy L to WORK(IU), zeroing out above it */
+
+			clacpy_("L", m, m, &a[a_offset], lda, &work[iu], &
+				ldwrku);
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &work[iu + 
+				ldwrku], &ldwrku);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Bidiagonalize L in WORK(IU), copying result to U */
+/*                    (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &work[iu], &ldwrku, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+			clacpy_("L", m, m, &work[iu], &ldwrku, &u[u_offset], 
+				ldu);
+
+/*                    Generate right bidiagonalizing vectors in WORK(IU) */
+/*                    (CWorkspace: need M*M+3*M, prefer M*M+2*M+(M-1)*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("P", m, m, m, &work[iu], &ldwrku, &work[itaup]
+, &work[iwork], &i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors in U */
+/*                    (CWorkspace: need M*M+3*M, prefer M*M+2*M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", m, m, m, &u[u_offset], ldu, &work[itauq], 
+				 &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of L in U and computing right */
+/*                    singular vectors of L in WORK(IU) */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, m, m, &c__0, &s[1], &rwork[ie], &work[
+				iu], &ldwrku, &u[u_offset], ldu, cdum, &c__1, 
+				&rwork[irwork], info);
+
+/*                    Multiply right singular vectors of L in WORK(IU) by */
+/*                    Q in VT, storing result in A */
+/*                    (CWorkspace: need M*M) */
+/*                    (RWorkspace: 0) */
+
+			cgemm_("N", "N", m, n, m, &c_b2, &work[iu], &ldwrku, &
+				vt[vt_offset], ldvt, &c_b1, &a[a_offset], lda);
+
+/*                    Copy right singular vectors of A from A to VT */
+
+			clacpy_("F", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+		    } else {
+
+/*                    Insufficient workspace for a fast algorithm */
+
+			itau = 1;
+			iwork = itau + *m;
+
+/*                    Compute A=L*Q, copying result to VT */
+/*                    (CWorkspace: need 2*M, prefer M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cgelqf_(m, n, &a[a_offset], lda, &work[itau], &work[
+				iwork], &i__2, &ierr);
+			clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], 
+				ldvt);
+
+/*                    Generate Q in VT */
+/*                    (CWorkspace: need M+N, prefer M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunglq_(n, n, m, &vt[vt_offset], ldvt, &work[itau], &
+				work[iwork], &i__2, &ierr);
+
+/*                    Copy L to U, zeroing out above it */
+
+			clacpy_("L", m, m, &a[a_offset], lda, &u[u_offset], 
+				ldu);
+			i__2 = *m - 1;
+			i__3 = *m - 1;
+			claset_("U", &i__2, &i__3, &c_b1, &c_b1, &u[(u_dim1 <<
+				 1) + 1], ldu);
+			ie = 1;
+			itauq = itau;
+			itaup = itauq + *m;
+			iwork = itaup + *m;
+
+/*                    Bidiagonalize L in U */
+/*                    (CWorkspace: need 3*M, prefer 2*M+2*M*NB) */
+/*                    (RWorkspace: need M) */
+
+			i__2 = *lwork - iwork + 1;
+			cgebrd_(m, m, &u[u_offset], ldu, &s[1], &rwork[ie], &
+				work[itauq], &work[itaup], &work[iwork], &
+				i__2, &ierr);
+
+/*                    Multiply right bidiagonalizing vectors in U by Q */
+/*                    in VT */
+/*                    (CWorkspace: need 2*M+N, prefer 2*M+N*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cunmbr_("P", "L", "C", m, n, m, &u[u_offset], ldu, &
+				work[itaup], &vt[vt_offset], ldvt, &work[
+				iwork], &i__2, &ierr);
+
+/*                    Generate left bidiagonalizing vectors in U */
+/*                    (CWorkspace: need 3*M, prefer 2*M+M*NB) */
+/*                    (RWorkspace: 0) */
+
+			i__2 = *lwork - iwork + 1;
+			cungbr_("Q", m, m, m, &u[u_offset], ldu, &work[itauq], 
+				 &work[iwork], &i__2, &ierr);
+			irwork = ie + *m;
+
+/*                    Perform bidiagonal QR iteration, computing left */
+/*                    singular vectors of A in U and computing right */
+/*                    singular vectors of A in VT */
+/*                    (CWorkspace: 0) */
+/*                    (RWorkspace: need BDSPAC) */
+
+			cbdsqr_("U", m, n, m, &c__0, &s[1], &rwork[ie], &vt[
+				vt_offset], ldvt, &u[u_offset], ldu, cdum, &
+				c__1, &rwork[irwork], info);
+
+		    }
+
+		}
+
+	    }
+
+	} else {
+
+/*           N .LT. MNTHR */
+
+/*           Path 10t(N greater than M, but not much larger) */
+/*           Reduce to bidiagonal form without LQ decomposition */
+
+	    ie = 1;
+	    itauq = 1;
+	    itaup = itauq + *m;
+	    iwork = itaup + *m;
+
+/*           Bidiagonalize A */
+/*           (CWorkspace: need 2*M+N, prefer 2*M+(M+N)*NB) */
+/*           (RWorkspace: M) */
+
+	    i__2 = *lwork - iwork + 1;
+	    cgebrd_(m, n, &a[a_offset], lda, &s[1], &rwork[ie], &work[itauq], 
+		    &work[itaup], &work[iwork], &i__2, &ierr);
+	    if (wntuas) {
+
+/*              If left singular vectors desired in U, copy result to U */
+/*              and generate left bidiagonalizing vectors in U */
+/*              (CWorkspace: need 3*M-1, prefer 2*M+(M-1)*NB) */
+/*              (RWorkspace: 0) */
+
+		clacpy_("L", m, m, &a[a_offset], lda, &u[u_offset], ldu);
+		i__2 = *lwork - iwork + 1;
+		cungbr_("Q", m, m, n, &u[u_offset], ldu, &work[itauq], &work[
+			iwork], &i__2, &ierr);
+	    }
+	    if (wntvas) {
+
+/*              If right singular vectors desired in VT, copy result to */
+/*              VT and generate right bidiagonalizing vectors in VT */
+/*              (CWorkspace: need 2*M+NRVT, prefer 2*M+NRVT*NB) */
+/*              (RWorkspace: 0) */
+
+		clacpy_("U", m, n, &a[a_offset], lda, &vt[vt_offset], ldvt);
+		if (wntva) {
+		    nrvt = *n;
+		}
+		if (wntvs) {
+		    nrvt = *m;
+		}
+		i__2 = *lwork - iwork + 1;
+		cungbr_("P", &nrvt, n, m, &vt[vt_offset], ldvt, &work[itaup], 
+			&work[iwork], &i__2, &ierr);
+	    }
+	    if (wntuo) {
+
+/*              If left singular vectors desired in A, generate left */
+/*              bidiagonalizing vectors in A */
+/*              (CWorkspace: need 3*M-1, prefer 2*M+(M-1)*NB) */
+/*              (RWorkspace: 0) */
+
+		i__2 = *lwork - iwork + 1;
+		cungbr_("Q", m, m, n, &a[a_offset], lda, &work[itauq], &work[
+			iwork], &i__2, &ierr);
+	    }
+	    if (wntvo) {
+
+/*              If right singular vectors desired in A, generate right */
+/*              bidiagonalizing vectors in A */
+/*              (CWorkspace: need 3*M, prefer 2*M+M*NB) */
+/*              (RWorkspace: 0) */
+
+		i__2 = *lwork - iwork + 1;
+		cungbr_("P", m, n, m, &a[a_offset], lda, &work[itaup], &work[
+			iwork], &i__2, &ierr);
+	    }
+	    irwork = ie + *m;
+	    if (wntuas || wntuo) {
+		nru = *m;
+	    }
+	    if (wntun) {
+		nru = 0;
+	    }
+	    if (wntvas || wntvo) {
+		ncvt = *n;
+	    }
+	    if (wntvn) {
+		ncvt = 0;
+	    }
+	    if (! wntuo && ! wntvo) {
+
+/*              Perform bidiagonal QR iteration, if desired, computing */
+/*              left singular vectors in U and computing right singular */
+/*              vectors in VT */
+/*              (CWorkspace: 0) */
+/*              (RWorkspace: need BDSPAC) */
+
+		cbdsqr_("L", m, &ncvt, &nru, &c__0, &s[1], &rwork[ie], &vt[
+			vt_offset], ldvt, &u[u_offset], ldu, cdum, &c__1, &
+			rwork[irwork], info);
+	    } else if (! wntuo && wntvo) {
+
+/*              Perform bidiagonal QR iteration, if desired, computing */
+/*              left singular vectors in U and computing right singular */
+/*              vectors in A */
+/*              (CWorkspace: 0) */
+/*              (RWorkspace: need BDSPAC) */
+
+		cbdsqr_("L", m, &ncvt, &nru, &c__0, &s[1], &rwork[ie], &a[
+			a_offset], lda, &u[u_offset], ldu, cdum, &c__1, &
+			rwork[irwork], info);
+	    } else {
+
+/*              Perform bidiagonal QR iteration, if desired, computing */
+/*              left singular vectors in A and computing right singular */
+/*              vectors in VT */
+/*              (CWorkspace: 0) */
+/*              (RWorkspace: need BDSPAC) */
+
+		cbdsqr_("L", m, &ncvt, &nru, &c__0, &s[1], &rwork[ie], &vt[
+			vt_offset], ldvt, &a[a_offset], lda, cdum, &c__1, &
+			rwork[irwork], info);
+	    }
+
+	}
+
+    }
+
+/*     Undo scaling if necessary */
+
+    if (iscl == 1) {
+	if (anrm > bignum) {
+	    slascl_("G", &c__0, &c__0, &bignum, &anrm, &minmn, &c__1, &s[1], &
+		    minmn, &ierr);
+	}
+	if (*info != 0 && anrm > bignum) {
+	    i__2 = minmn - 1;
+	    slascl_("G", &c__0, &c__0, &bignum, &anrm, &i__2, &c__1, &rwork[
+		    ie], &minmn, &ierr);
+	}
+	if (anrm < smlnum) {
+	    slascl_("G", &c__0, &c__0, &smlnum, &anrm, &minmn, &c__1, &s[1], &
+		    minmn, &ierr);
+	}
+	if (*info != 0 && anrm < smlnum) {
+	    i__2 = minmn - 1;
+	    slascl_("G", &c__0, &c__0, &smlnum, &anrm, &i__2, &c__1, &rwork[
+		    ie], &minmn, &ierr);
+	}
+    }
+
+/*     Return optimal workspace in WORK(1) */
+
+    work[1].r = (real) maxwrk, work[1].i = 0.f;
+
+    return 0;
+
+/*     End of CGESVD */
+
+} /* cgesvd_ */