202 lines
5.3 KiB
C
202 lines
5.3 KiB
C
/*********************************************************************/
|
|
/* 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 "common.h"
|
|
#ifdef FUNCTION_PROFILE
|
|
#include "functable.h"
|
|
#endif
|
|
|
|
#ifdef RETURN_BY_STRUCT
|
|
#ifdef XDOUBLE
|
|
#define MYTYPE myxcomplex_t
|
|
#elif defined DOUBLE
|
|
#define MYTYPE myzcomplex_t
|
|
#else
|
|
#define MYTYPE myccomplex_t
|
|
#endif
|
|
#endif
|
|
|
|
#ifndef CBLAS
|
|
|
|
#ifdef RETURN_BY_STRUCT
|
|
MYTYPE NAME( blasint *N, FLOAT *x, blasint *INCX, FLOAT *y, blasint *INCY) {
|
|
#elif defined RETURN_BY_STACK
|
|
void NAME(FLOAT _Complex *result, blasint *N, FLOAT *x, blasint *INCX, FLOAT *y, blasint *INCY) {
|
|
#else
|
|
FLOAT _Complex NAME( blasint *N, FLOAT *x, blasint *INCX, FLOAT *y, blasint *INCY) {
|
|
#endif
|
|
|
|
BLASLONG n = *N;
|
|
BLASLONG incx = *INCX;
|
|
BLASLONG incy = *INCY;
|
|
#ifndef RETURN_BY_STACK
|
|
FLOAT _Complex ret;
|
|
#endif
|
|
#ifdef RETURN_BY_STRUCT
|
|
MYTYPE myret;
|
|
#endif
|
|
|
|
PRINT_DEBUG_NAME;
|
|
|
|
if (n <= 0) {
|
|
#ifdef RETURN_BY_STRUCT
|
|
myret.r = 0.;
|
|
myret.i = 0.;
|
|
return myret;
|
|
#elif defined RETURN_BY_STACK
|
|
*result = ZERO;
|
|
return;
|
|
#else
|
|
return ZERO;
|
|
#endif
|
|
}
|
|
|
|
IDEBUG_START;
|
|
|
|
FUNCTION_PROFILE_START();
|
|
|
|
if (incx < 0) x -= (n - 1) * incx * 2;
|
|
if (incy < 0) y -= (n - 1) * incy * 2;
|
|
|
|
#ifdef RETURN_BY_STRUCT
|
|
|
|
#ifndef CONJ
|
|
ret = DOTU_K(n, x, incx, y, incy);
|
|
#else
|
|
ret = DOTC_K(n, x, incx, y, incy);
|
|
#endif
|
|
|
|
myret.r = CREAL ret;
|
|
myret.i = CIMAG ret;
|
|
|
|
FUNCTION_PROFILE_END(4, 2 * n, 2 * n);
|
|
|
|
IDEBUG_END;
|
|
|
|
return myret;
|
|
|
|
#elif defined RETURN_BY_STACK
|
|
|
|
#ifndef CONJ
|
|
*result = DOTU_K(n, x, incx, y, incy);
|
|
#else
|
|
*result = DOTC_K(n, x, incx, y, incy);
|
|
#endif
|
|
|
|
FUNCTION_PROFILE_END(4, 2 * n, 2 * n);
|
|
|
|
IDEBUG_END;
|
|
|
|
#else
|
|
|
|
#ifndef CONJ
|
|
ret = DOTU_K(n, x, incx, y, incy);
|
|
#else
|
|
ret = DOTC_K(n, x, incx, y, incy);
|
|
#endif
|
|
|
|
FUNCTION_PROFILE_END(4, 2 * n, 2 * n);
|
|
|
|
IDEBUG_END;
|
|
|
|
return ret;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
#ifdef FORCE_USE_STACK
|
|
void CNAME(blasint n, FLOAT *x, blasint incx, FLOAT *y, blasint incy, FLOAT _Complex *result){
|
|
#else
|
|
FLOAT _Complex CNAME(blasint n, FLOAT *x, blasint incx, FLOAT *y, blasint incy){
|
|
|
|
FLOAT _Complex ret;
|
|
#endif
|
|
|
|
PRINT_DEBUG_CNAME;
|
|
|
|
if (n <= 0) {
|
|
#ifdef FORCE_USE_STACK
|
|
*result = ZERO;
|
|
return;
|
|
#else
|
|
return ZERO;
|
|
#endif
|
|
}
|
|
|
|
if (incx < 0) x -= (n - 1) * incx * 2;
|
|
if (incy < 0) y -= (n - 1) * incy * 2;
|
|
|
|
IDEBUG_START;
|
|
|
|
FUNCTION_PROFILE_START();
|
|
|
|
#ifdef FORCE_USE_STACK
|
|
|
|
#ifndef CONJ
|
|
*result = DOTU_K(n, x, incx, y, incy);
|
|
#else
|
|
*result = DOTC_K(n, x, incx, y, incy);
|
|
#endif
|
|
|
|
FUNCTION_PROFILE_END(4, 2 * n, 2 * n);
|
|
|
|
IDEBUG_END;
|
|
|
|
#else
|
|
|
|
#ifndef CONJ
|
|
ret = DOTU_K(n, x, incx, y, incy);
|
|
#else
|
|
ret = DOTC_K(n, x, incx, y, incy);
|
|
#endif
|
|
|
|
FUNCTION_PROFILE_END(4, 2 * n, 2 * n);
|
|
|
|
IDEBUG_END;
|
|
|
|
return ret;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
#endif
|