|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175 |
- /*********************************************************************/
- /* 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
-
- #undef MAX_K
-
- #ifdef USE_ABS
-
- #ifndef USE_MIN
-
- /* ABS & MAX */
- #ifndef COMPLEX
- #ifdef XDOUBLE
- #define MAX_K IQAMAX_K
- #elif defined(DOUBLE)
- #define MAX_K IDAMAX_K
- #else
- #define MAX_K ISAMAX_K
- #endif
- #else
- #ifdef XDOUBLE
- #define MAX_K IXAMAX_K
- #elif defined(DOUBLE)
- #define MAX_K IZAMAX_K
- #else
- #define MAX_K ICAMAX_K
- #endif
- #endif
-
- #else
-
- /* ABS & MIN */
- #ifndef COMPLEX
- #ifdef XDOUBLE
- #define MAX_K IQAMIN_K
- #elif defined(DOUBLE)
- #define MAX_K IDAMIN_K
- #else
- #define MAX_K ISAMIN_K
- #endif
- #else
- #ifdef XDOUBLE
- #define MAX_K IXAMIN_K
- #elif defined(DOUBLE)
- #define MAX_K IZAMIN_K
- #else
- #define MAX_K ICAMIN_K
- #endif
- #endif
-
- #endif
-
- #else
-
- #ifndef USE_MIN
-
- /* MAX */
- #ifdef XDOUBLE
- #define MAX_K IQMAX_K
- #elif defined(DOUBLE)
- #define MAX_K IDMAX_K
- #else
- #define MAX_K ISMAX_K
- #endif
-
- #else
-
- /* MIN */
- #ifdef XDOUBLE
- #define MAX_K IQMIN_K
- #elif defined(DOUBLE)
- #define MAX_K IDMIN_K
- #else
- #define MAX_K ISMIN_K
- #endif
-
- #endif
-
- #endif
-
- #ifndef CBLAS
-
- blasint NAME(blasint *N, FLOAT *x, blasint *INCX){
-
- BLASLONG n = *N;
- BLASLONG incx = *INCX;
- blasint ret;
-
- PRINT_DEBUG_NAME;
-
- if (n <= 0) return 0;
-
- IDEBUG_START;
-
- FUNCTION_PROFILE_START();
-
- ret = (blasint)MAX_K(n, x, incx);
-
- if(ret > n) ret=n;
-
- FUNCTION_PROFILE_END(COMPSIZE, n, 0);
-
- IDEBUG_END;
-
- return ret;
- }
-
- #else
-
- CBLAS_INDEX CNAME(blasint n, FLOAT *x, blasint incx){
-
- CBLAS_INDEX ret;
-
- PRINT_DEBUG_CNAME;
-
- if (n <= 0) return 0;
-
- IDEBUG_START;
-
- FUNCTION_PROFILE_START();
-
- ret = MAX_K(n, x, incx);
-
- if (ret > n) ret=n;
-
- if (ret) ret --;
-
- FUNCTION_PROFILE_END(COMPSIZE, n, 0);
-
- IDEBUG_END;
-
- return ret;
- }
-
- #endif
|