mirror of
https://github.com/amd/blis.git
synced 2026-05-05 06:51:11 +00:00
766769eeb9
* Revert "restore bli_extern_defs exporting for now" This reverts commit 09fb07c350b2acee17645e8e9e1b8d829c73dca8. * Remove symbols not intended to be public * No need of def file anymore * Fix whitespace * No need of configure option * Remove export macro from definitions * Remove blas export macro from definitions
155 lines
4.5 KiB
C
155 lines
4.5 KiB
C
/*
|
|
|
|
BLIS
|
|
An object-based framework for developing high-performance BLAS-like
|
|
libraries.
|
|
|
|
Copyright (C) 2014, The University of Texas at Austin
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are
|
|
met:
|
|
- Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
- 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.
|
|
- Neither the name(s) of the copyright holder(s) nor the names of its
|
|
contributors may be used to endorse or promote products derived
|
|
from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
"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 COPYRIGHT
|
|
HOLDER 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.
|
|
|
|
*/
|
|
|
|
#include "blis.h"
|
|
|
|
#ifdef BLIS_ENABLE_BLAS
|
|
|
|
/* lsame.f -- translated by f2c (version 19991025).
|
|
You must link the resulting object file with the libraries:
|
|
-lf2c -lm (in that order)
|
|
*/
|
|
|
|
|
|
#ifdef LAPACK_ILP64
|
|
long PASTEF770(lsame)(const char *ca, const char *cb, long ca_len, long cb_len)
|
|
#else
|
|
int PASTEF770(lsame)(const char *ca, const char *cb, int ca_len, int cb_len)
|
|
#endif
|
|
{
|
|
/* System generated locals */
|
|
bla_logical ret_val;
|
|
|
|
/* Local variables */
|
|
bla_integer inta, intb, zcode;
|
|
|
|
|
|
/* -- LAPACK auxiliary routine (version 2.0) -- */
|
|
/* Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., */
|
|
/* Courant Institute, Argonne National Lab, and Rice University */
|
|
/* January 31, 1994 */
|
|
|
|
/* .. Scalar Arguments .. */
|
|
/* .. */
|
|
|
|
/* Purpose */
|
|
/* ======= */
|
|
|
|
/* LSAME returns .TRUE. if CA is the same letter as CB regardless of */
|
|
/* case. */
|
|
|
|
/* Arguments */
|
|
/* ========= */
|
|
|
|
/* CA (input) CHARACTER*1 */
|
|
/* CB (input) CHARACTER*1 */
|
|
/* CA and CB specify the single bla_characters to be compared. */
|
|
|
|
/* ===================================================================== */
|
|
|
|
/* .. Intrinsic Functions .. */
|
|
/* .. */
|
|
/* .. Local Scalars .. */
|
|
/* .. */
|
|
/* .. Executable Statements .. */
|
|
|
|
/* Test if the bla_characters are equal */
|
|
|
|
ret_val = *(unsigned char *)ca == *(unsigned char *)cb;
|
|
if (ret_val) {
|
|
return ret_val;
|
|
}
|
|
|
|
/* Now test for equivalence if both bla_characters are alphabetic. */
|
|
|
|
zcode = 'Z';
|
|
|
|
/* Use 'Z' rather than 'A' so that ASCII can be detected on Prime */
|
|
/* machines, on which ICHAR returns a value with bit 8 set. */
|
|
/* ICHAR('A') on Prime machines returns 193 which is the same as */
|
|
/* ICHAR('A') on an EBCDIC machine. */
|
|
|
|
inta = *(unsigned char *)ca;
|
|
intb = *(unsigned char *)cb;
|
|
|
|
if (zcode == 90 || zcode == 122) {
|
|
|
|
/* ASCII is assumed - ZCODE is the ASCII code of either lower or */
|
|
/* upper case 'Z'. */
|
|
|
|
if (inta >= 97 && inta <= 122) {
|
|
inta += -32;
|
|
}
|
|
if (intb >= 97 && intb <= 122) {
|
|
intb += -32;
|
|
}
|
|
|
|
} else if (zcode == 233 || zcode == 169) {
|
|
|
|
/* EBCDIC is assumed - ZCODE is the EBCDIC code of either lower or */
|
|
/* upper case 'Z'. */
|
|
|
|
if ((inta >= 129 && inta <= 137) || (inta >= 145 && inta <= 153) || (inta
|
|
>= 162 && inta <= 169)) {
|
|
inta += 64;
|
|
}
|
|
if ((intb >= 129 && intb <= 137) || (intb >= 145 && intb <= 153) || (intb
|
|
>= 162 && intb <= 169)) {
|
|
intb += 64;
|
|
}
|
|
|
|
} else if (zcode == 218 || zcode == 250) {
|
|
|
|
/* ASCII is assumed, on Prime machines - ZCODE is the ASCII code */
|
|
/* plus 128 of either lower or upper case 'Z'. */
|
|
|
|
if (inta >= 225 && inta <= 250) {
|
|
inta += -32;
|
|
}
|
|
if (intb >= 225 && intb <= 250) {
|
|
intb += -32;
|
|
}
|
|
}
|
|
ret_val = inta == intb;
|
|
|
|
/* RETURN */
|
|
|
|
/* End of LSAME */
|
|
|
|
return ret_val;
|
|
} /* lsame */
|
|
|
|
#endif
|
|
|