|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177 |
- /*********************************************************************/
- /* 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>
- #include <ctype.h>
- #include "common.h"
-
- int CNAME(BLASLONG m, FLOAT alpha_r, FLOAT alpha_i,
- FLOAT *a, FLOAT *x, BLASLONG incx, FLOAT *y, BLASLONG incy, void *buffer){
-
- BLASLONG i;
- FLOAT *X = x;
- FLOAT *Y = y;
- FLOAT *gemvbuffer = (FLOAT *)buffer;
- FLOAT *bufferY = gemvbuffer;
- FLOAT *bufferX = gemvbuffer;
- FLOAT temp[2];
-
- if (incy != 1) {
- Y = bufferY;
- bufferX = (FLOAT *)(((BLASLONG)bufferY + m * sizeof(FLOAT) * 2 + 4095) & ~4095);
- gemvbuffer = bufferX;
- COPY_K(m, y, incy, Y, 1);
- }
-
- if (incx != 1) {
- X = bufferX;
- gemvbuffer = (FLOAT *)(((BLASLONG)bufferX + m * sizeof(FLOAT) * 2 + 4095) & ~4095);
- COPY_K(m, x, incx, X, 1);
- }
-
- for (i = 0; i < m; i++) {
-
- #ifndef HEMVREV
- #ifndef LOWER
- if (i > 0) {
- FLOAT _Complex result = DOTC_K(i, a, 1, X, 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);
- }
-
- temp[0] = a[i * 2 + 0] * X[i * 2 + 0];
- temp[1] = a[i * 2 + 0] * X[i * 2 + 1];
-
- Y[i * 2 + 0] += alpha_r * temp[0] - alpha_i * temp[1];
- Y[i * 2 + 1] += alpha_r * temp[1] + alpha_i * temp[0];
-
- if (i > 0) {
- AXPYU_K(i, 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, 1, NULL, 0);
- }
-
- a += (i + 1) * 2;
-
- #else
-
- if (m - i > 1) {
- FLOAT _Complex result = DOTC_K(m - i - 1, a + (i + 1) * 2, 1, X + (i + 1) * 2, 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);
- }
-
- temp[0] = a[i * 2 + 0] * X[i * 2 + 0];
- temp[1] = a[i * 2 + 0] * X[i * 2 + 1];
-
- Y[i * 2 + 0] += alpha_r * temp[0] - alpha_i * temp[1];
- Y[i * 2 + 1] += alpha_r * temp[1] + alpha_i * temp[0];
-
- if (m - i > 1) {
- AXPYU_K(m - i - 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 + (i + 1) * 2, 1, Y + (i + 1) * 2, 1, NULL, 0);
- }
-
- a += (m - i - 1) * 2;
-
- #endif
- #else
- #ifndef LOWER
- if (i > 0) {
- FLOAT _Complex result = DOTU_K(i, a, 1, X, 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);
- }
-
- temp[0] = a[i * 2 + 0] * X[i * 2 + 0];
- temp[1] = a[i * 2 + 0] * X[i * 2 + 1];
-
- Y[i * 2 + 0] += alpha_r * temp[0] - alpha_i * temp[1];
- Y[i * 2 + 1] += alpha_r * temp[1] + alpha_i * temp[0];
-
- if (i > 0) {
- AXPYC_K(i, 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, 1, NULL, 0);
- }
-
- a += (i + 1) * 2;
-
- #else
-
- if (m - i > 1) {
- FLOAT _Complex result = DOTU_K(m - i - 1, a + (i + 1) * 2, 1, X + (i + 1) * 2, 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);
- }
-
- temp[0] = a[i * 2 + 0] * X[i * 2 + 0];
- temp[1] = a[i * 2 + 0] * X[i * 2 + 1];
-
- Y[i * 2 + 0] += alpha_r * temp[0] - alpha_i * temp[1];
- Y[i * 2 + 1] += alpha_r * temp[1] + alpha_i * temp[0];
-
- if (m - i > 1) {
- AXPYC_K(m - i - 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 + (i + 1) * 2, 1, Y + (i + 1) * 2, 1, NULL, 0);
- }
-
- a += (m - i - 1) * 2;
-
- #endif
- #endif
-
- }
-
- if (incy != 1) {
- COPY_K(m, Y, 1, y, incy);
- }
-
- return 0;
- }
-
|