/*********************************************************************/

/* Copyright 2009, 2010 The University of Texas at Austin.           */

/* All rights reserved.                                              */

/*                                                                   */

/* 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.                              */

/*                                                                   */

/*    THIS  SOFTWARE IS PROVIDED  BY THE  UNIVERSITY OF  TEXAS AT    */

/*    AUSTIN  ``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  OF TEXAS AT    */

/*    AUSTIN OR 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.                                    */

/*                                                                   */

/* The views and conclusions contained in the software and           */

/* documentation are those of the authors and should not be          */

/* interpreted as representing official policies, either expressed   */

/* or implied, of The University of Texas at Austin.                 */

/*********************************************************************/

#include <stdio.h></stdio.h>

#include <ctype.h></ctype.h>

#include "common.h"

int CNAME(BLASLONG n, BLASLONG k, FLOAT alpha_r, FLOAT alpha_i,

	  FLOAT *a, BLASLONG lda,

	  FLOAT *x, BLASLONG incx, FLOAT *y, BLASLONG incy, void *buffer){

  BLASLONG i, length;

#ifndef LOWER

  BLASLONG offset;

#endif

  FLOAT *X = x;

  FLOAT *Y = y;

  FLOAT *sbmvbuffer = (FLOAT *)buffer;

  FLOAT *bufferY    = sbmvbuffer;

  FLOAT *bufferX    = sbmvbuffer;

  if (incy != 1) {

    Y = bufferY;

    bufferX    = (FLOAT *)(((BLASLONG)bufferY + n * sizeof(FLOAT) * COMPSIZE + 4095) & ~4095);

    sbmvbuffer = bufferX;

    COPY_K(n, y, incy, Y, 1);

  }

  if (incx != 1) {

    X = bufferX;

    sbmvbuffer = (FLOAT *)(((BLASLONG)bufferX + n * sizeof(FLOAT) * COMPSIZE + 4095) & ~4095);

    COPY_K(n, x, incx, X, 1);

  }

#ifndef LOWER

  offset = k;

#endif

  for (i = 0; i < n; i++) {

#ifndef LOWER

    length  = k - offset;

    AXPYU_K(length + 1, 0, 0,

	    alpha_r * X[i * 2 + 0] - alpha_i * X[i * 2 + 1], 

	    alpha_r * X[i * 2 + 1] + alpha_i * X[i * 2 + 0], 

	    a + offset * COMPSIZE, 1, Y + (i - length) * COMPSIZE, 1, NULL, 0);

    if (length > 0) {

      FLOAT _Complex result = DOTU_K(length, a + offset * COMPSIZE, 1, X + (i - length) * COMPSIZE, 1);

      Y[i * 2 + 0] += alpha_r * CREAL(result) - alpha_i * CIMAG(result);

      Y[i * 2 + 1] += alpha_r * CIMAG(result) + alpha_i * CREAL(result);

      }

    if (offset > 0) offset --;

#else

    length  = k;

    if (n - i - 1 < k) length = n - i - 1;

    AXPYU_K(length + 1, 0, 0,

	    alpha_r * X[i * 2 + 0] - alpha_i * X[i * 2 + 1], 

	    alpha_r * X[i * 2 + 1] + alpha_i * X[i * 2 + 0], 

	    a, 1, Y + i * COMPSIZE, 1, NULL, 0);

    if (length > 0) {

      FLOAT _Complex result = DOTU_K(length, a + COMPSIZE, 1, X + (i + 1) * COMPSIZE, 1);

      Y[i * 2 + 0] += alpha_r * CREAL(result) - alpha_i * CIMAG(result);

      Y[i * 2 + 1] += alpha_r * CIMAG(result) + alpha_i * CREAL(result);

      }

#endif

    a += lda * 2;

  }

  if (incy != 1) {

    COPY_K(n, Y, 1, y, incy);

  }

  return 0;

}