text: /*
   *             Automatically Tuned Linear Algebra Software v3.10.0
   * Copyright (C) 2010 R. Clint Whaley
   *
   * Redistribution and use in source and binary forms, with or without
   * modification, are permitted provided that the following conditions
   * are met:
   *   1. Redistributions of source code must retain the above copyright
   *      notice, this list of conditions and the following disclaimer.
   *   2. Redistributions in binary form must reproduce the above copyright
   *      notice, this list of conditions, and the following disclaimer in the
   *      documentation and/or other materials provided with the distribution.
   *   3. The name of the ATLAS group or the names of its contributers may
   *      not be used to endorse or promote products derived from this
   *      software without specific written permission.
   *
   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
   * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
   * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE ATLAS GROUP OR ITS CONTRIBUTORS
   * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
   * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
   * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
   * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
   * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
   * POSSIBILITY OF SUCH DAMAGE.
   *
   */
  #define SREAL
  #include "atlas_misc.h"
  #ifdef ATL_USEPTHREADS
     #include "atlas_ptalias_lapack.h"
  #endif
  #include "atlas_lapack.h"
  #include "clapack.h"
  
  #define mytrans CblasTrans
  int clapack_sgels(const enum CBLAS_ORDER Order,
                    const enum CBLAS_TRANSPOSE TA,
                    ATL_CINT M, ATL_CINT N, ATL_CINT NRHS,
                    float *A, ATL_CINT lda, float *B, const int ldb)
  /*
   *  GELS solves overdetermined or underdetermined linear systems
   *  involving an M-by-N matrix A, or its conjugate-transpose, using a QR
   *  or LQ factorization of A.  It is assumed that A has full rank.
   */
  {
     int ierr = 0;
  
     if (Order != CblasRowMajor && Order != CblasColMajor)
     {
        ierr = -1;
        cblas_xerbla(1, "clapack_sgesv",
                     "Order must be %d or %d, but is set to %d.\n",
                     CblasRowMajor, CblasColMajor, Order);
     }
     if (TA != AtlasNoTrans && TA != mytrans)
     {
        ierr = -2;
        cblas_xerbla(2, "clapack_sgesv",
                     "Trans must be %d or %d, but is set to %d.\n",
                     CblasNoTrans, mytrans, TA);
     }
     if (M < 0)
     {
        ierr = -3;
        cblas_xerbla(3, "clapack_sgesv",
                     "M cannot be less than zero 0,; is set to %d.\n", N);
     }
     if (N < 0)
     {
        ierr = -4;
        cblas_xerbla(4, "clapack_sgesv",
                     "N cannot be less than zero 0,; is set to %d.\n", N);
     }
     if (NRHS < 0)
     {
        ierr = -5;
        cblas_xerbla(5, "clapack_sgesv",
                     "NRHS cannot be less than zero 0,; is set to %d.\n", NRHS);
     }
     if (lda < M || lda < 1)
     {
        ierr = -7;
        cblas_xerbla(7, "clapack_sgesv",
                     "lda must be >= MAX(M,1): lda=%d M=%d\n", lda, M);
     }
     if (ldb < Mmax(M,N) || ldb < 1)
     {
        ierr = -9;
        cblas_xerbla(9, "clapack_sgesv",
                     "ldb must be >= MAX(M,N,1): ldb=%d M=%d N=%d\n", ldb, M, N);
  
     }
     if (Order == CblasColMajor)
        ierr = ATL_sgels(TA, M, N, NRHS, A, lda, B, ldb, NULL, 0);
     else  /* row-major array */
     {
        enum CBLAS_TRANSPOSE TAr = (TA == AtlasNoTrans) ? mytrans : CblasNoTrans;
        ierr = ATL_sgels(TAr, N, M, NRHS, A, lda, B, ldb, NULL, 0);
     }
     return(ierr);
  }
  #undef mytrans
  