| /*********************************************************************/ |
| /* 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" |
| #ifdef FUNCTION_PROFILE |
| #include "functable.h" |
| #endif |
| |
| #ifdef XDOUBLE |
| #define ERROR_NAME "QSPR2 " |
| #elif defined(DOUBLE) |
| #define ERROR_NAME "DSPR2 " |
| #else |
| #define ERROR_NAME "SSPR2 " |
| #endif |
| |
| static int (*spr2[])(BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, FLOAT *) = { |
| #ifdef XDOUBLE |
| qspr2_U, qspr2_L, |
| #elif defined(DOUBLE) |
| dspr2_U, dspr2_L, |
| #else |
| sspr2_U, sspr2_L, |
| #endif |
| }; |
| |
| #ifdef SMP |
| static int (*spr2_thread[])(BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, FLOAT *, int) = { |
| #ifdef XDOUBLE |
| qspr2_thread_U, qspr2_thread_L, |
| #elif defined(DOUBLE) |
| dspr2_thread_U, dspr2_thread_L, |
| #else |
| sspr2_thread_U, sspr2_thread_L, |
| #endif |
| }; |
| #endif |
| |
| #ifndef CBLAS |
| |
| void NAME(char *UPLO, blasint *N, FLOAT *ALPHA, |
| FLOAT *x, blasint *INCX, FLOAT *y, blasint *INCY, FLOAT *a){ |
| |
| char uplo_arg = *UPLO; |
| blasint n = *N; |
| FLOAT alpha = *ALPHA; |
| blasint incx = *INCX; |
| blasint incy = *INCY; |
| |
| blasint info; |
| int uplo; |
| FLOAT *buffer; |
| #ifdef SMP |
| int nthreads; |
| #endif |
| |
| PRINT_DEBUG_NAME; |
| |
| TOUPPER(uplo_arg); |
| uplo = -1; |
| |
| if (uplo_arg == 'U') uplo = 0; |
| if (uplo_arg == 'L') uplo = 1; |
| |
| info = 0; |
| |
| if (incy == 0) info = 7; |
| if (incx == 0) info = 5; |
| if (n < 0) info = 2; |
| if (uplo < 0) info = 1; |
| |
| if (info != 0) { |
| BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME)); |
| return; |
| } |
| |
| #else |
| |
| void CNAME(enum CBLAS_ORDER order, |
| enum CBLAS_UPLO Uplo, |
| blasint n, |
| FLOAT alpha, |
| FLOAT *x, blasint incx, |
| FLOAT *y, blasint incy, |
| FLOAT *a) { |
| |
| FLOAT *buffer; |
| int uplo; |
| blasint info; |
| #ifdef SMP |
| int nthreads; |
| #endif |
| |
| PRINT_DEBUG_CNAME; |
| |
| uplo = -1; |
| info = 0; |
| |
| if (order == CblasColMajor) { |
| if (Uplo == CblasUpper) uplo = 0; |
| if (Uplo == CblasLower) uplo = 1; |
| |
| info = -1; |
| |
| if (incy == 0) info = 7; |
| if (incx == 0) info = 5; |
| if (n < 0) info = 2; |
| if (uplo < 0) info = 1; |
| } |
| |
| if (order == CblasRowMajor) { |
| if (Uplo == CblasUpper) uplo = 1; |
| if (Uplo == CblasLower) uplo = 0; |
| |
| info = -1; |
| |
| if (incy == 0) info = 7; |
| if (incx == 0) info = 5; |
| if (n < 0) info = 2; |
| if (uplo < 0) info = 1; |
| } |
| |
| if (info >= 0) { |
| BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME)); |
| return; |
| } |
| |
| #endif |
| |
| if (n == 0) return; |
| |
| if (alpha == ZERO) return; |
| |
| if (incx == 1 && incy == 1 && n < 50) { |
| blasint i; |
| if (!uplo) { |
| for (i = 0; i < n; i++){ |
| AXPYU_K(i + 1, 0, 0, alpha * x[i], y, 1, a, 1, NULL, 0); |
| AXPYU_K(i + 1, 0, 0, alpha * y[i], x, 1, a, 1, NULL, 0); |
| a += i + 1; |
| } |
| } else { |
| for (i = 0; i < n; i++){ |
| AXPYU_K(n - i, 0, 0, alpha * x[i], y + i, 1, a, 1, NULL, 0); |
| AXPYU_K(n - i, 0, 0, alpha * y[i], x + i, 1, a, 1, NULL, 0); |
| a += n - i; |
| } |
| } |
| return; |
| } |
| |
| IDEBUG_START; |
| |
| FUNCTION_PROFILE_START(); |
| |
| if (incx < 0 ) x -= (n - 1) * incx; |
| if (incy < 0 ) y -= (n - 1) * incy; |
| |
| buffer = (FLOAT *)blas_memory_alloc(1); |
| |
| #ifdef SMP |
| nthreads = num_cpu_avail(2); |
| |
| if (nthreads == 1) { |
| #endif |
| |
| (spr2[uplo])(n, alpha, x, incx, y, incy, a, buffer); |
| |
| #ifdef SMP |
| } else { |
| |
| (spr2_thread[uplo])(n, alpha, x, incx, y, incy, a, buffer, nthreads); |
| |
| } |
| #endif |
| |
| blas_memory_free(buffer); |
| |
| FUNCTION_PROFILE_END(1, n * n / 2 + 2 * n, 2 * n * n); |
| |
| IDEBUG_END; |
| |
| return; |
| } |