/* ---------------------------------------------------------------------
 *
 * -- Automatically Tuned Linear Algebra Software (ATLAS)
 *    (C) Copyright 2000 All Rights Reserved
 *
 * -- ATLAS routine -- Version 3.0 -- April 1, 2000
 *
 * -- Suggestions,  comments,  bugs reports should be sent to the follo-
 *    wing e-mail address: atlas@cs.utk.edu
 *
 * Author         : Antoine P. Petitet
 * University of Tennessee - Innovative Computing Laboratory
 * Knoxville TN, 37996-1301, USA.
 *
 * ---------------------------------------------------------------------
 *
 * -- Copyright notice and Licensing terms:
 *
 *  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 distri-
 *    bution.
 * 3. The name of the University,  the ATLAS group,  or the names of its
 *    contributors  may not be used to endorse or promote products deri-
 *    ved from this software without specific written permission.
 *
 * -- Disclaimer:
 *
 * 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 UNIVERSITY
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,  INDIRECT, INCIDENTAL, SPE-
 * CIAL, 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 THEO-
 * RY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT  (IN-
 * CLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * ---------------------------------------------------------------------
 */
/*
 * Include files
 */
#include "atlas_misc.h"
#include "atlas_mv.h"
#include "atlas_r1.h"
#include "atlas_level1.h"
#include "atlas_kernel2.h"
#include "atlas_reflvl2.h"
#include "atlas_lvl2.h"

void Mjoin( PATL, sbmvU )
(
   const int                  N,
   const int                  K,
   const TYPE                 * A,
   const int                  LDA,
   const TYPE                 * X,
   const SCALAR               BETA,
   TYPE                       * Y
)
{
/*
 * Purpose
 * =======
 *
 * Mjoin( PATL, sbmvU ) performs the matrix-vector operation
 *
 *    y := alpha * A * x + beta * y,
 *
 * where alpha and beta are scalars, x and y are n-element vectors and A
 * is an n by n symmetric band matrix, with k super-diagonals.
 *
 * This is a  recursive  version of the  algorithm.  For a more detailed
 * description of  the arguments of this function, see the reference im-
 * plementation in the  ATLAS/src/blas/reference directory.
 *
 * ---------------------------------------------------------------------
 */
/*
 * .. Local Variables ..
 */
#ifdef TREAL
#define    one                ATL_rone
#define    lda2               LDA
   TYPE                       beta0;
#else
   const TYPE                 * beta0, one[2] = { ATL_rone, ATL_rzero };
   const int                  lda2 = (LDA << 1);
#endif
   int                        ia, ian, jb, kl, ku, ma, mb, na, nb;
   void                       (*gbmvT)( const int, const int, const int,
                              const int, const SCALAR, const TYPE *, const int,
                              const TYPE *, const int, const SCALAR, TYPE *,
                              const int );
   void                       (*gbmvN)( const int, const int, const int,
                              const int, const SCALAR, const TYPE *, const int,
                              const TYPE *, const int, const SCALAR, TYPE *,
                              const int );
/* ..
 * .. Executable Statements ..
 *
 */
   ATL_GetPartSBMV( A, LDA, &mb, &nb );

   beta0 = BETA;

   if(      SCALAR_IS_ZERO( beta0 ) )
   {
      gbmvN = Mjoin( PATL, gbmvN_a1_x1_b0_y1 );
      gbmvT = Mjoin( PATL, gbmvT_a1_x1_b0_y1 );
   }
   else if( SCALAR_IS_ONE ( beta0 ) )
   {
      gbmvN = Mjoin( PATL, gbmvN_a1_x1_b1_y1 );
      gbmvT = Mjoin( PATL, gbmvT_a1_x1_b1_y1 );
   }
   else
   {
      gbmvN = Mjoin( PATL, gbmvN_a1_x1_bX_y1 );
      gbmvT = Mjoin( PATL, gbmvT_a1_x1_bX_y1 );
   }

   for( ian = ( ( N - 1 ) / nb ) * nb; ian >= 0; ian -= nb )
   {
      jb = N - ian; jb = Mmin( jb, nb );

      if( ian != 0 )
      {
         ia = ian - K; ia = Mmax( ia, 0 ); ma = ian - ia; na = Mmin( jb, K );
         kl = ma  - 1; kl = Mmax( kl, 0 ); ku = K - 1 - kl; ku = Mmax( ku, 0 );
         gbmvT( na, ma, kl, ku, one, A+ian*lda2, LDA, X+(ia  SHIFT), 1, beta0,
                Y+(ian SHIFT), 1 );
         gbmvN( ma, na, kl, ku, one, A+ian*lda2, LDA, X+(ian SHIFT), 1, beta0,
                Y+(ia  SHIFT), 1 );
         if( !( SCALAR_IS_ONE( beta0 ) ) )
         {
            if( jb > na )
               Mjoin( PATL, scal )( jb-na, beta0, Y+((ian+na) SHIFT), 1 );
            if( ia > 0  ) Mjoin( PATL, scal )( ia, beta0, Y, 1 );
         }
         beta0 = one;
      }
      Mjoin( PATL, refsbmvU )( jb, K, one, A+ian*lda2, LDA, X+(ian SHIFT), 1,
                               beta0, Y+(ian SHIFT), 1 );
      gbmvN = Mjoin( PATL, gbmvN_a1_x1_b1_y1 );
      gbmvT = Mjoin( PATL, gbmvT_a1_x1_b1_y1 );
      beta0 = one;
   }
/*
 * End of Mjoin( PATL, sbmvU )
 */
}
