134 lines
3.7 KiB
C
134 lines
3.7 KiB
C
/*BHEADER**********************************************************************
|
|
* Copyright (c) 2006 The Regents of the University of California.
|
|
* Produced at the Lawrence Livermore National Laboratory.
|
|
* Written by the HYPRE team. UCRL-CODE-222953.
|
|
* All rights reserved.
|
|
*
|
|
* This file is part of HYPRE (see http://www.llnl.gov/CASC/hypre/).
|
|
* Please see the COPYRIGHT_and_LICENSE file for the copyright notice,
|
|
* disclaimer, contact information and the GNU Lesser General Public License.
|
|
*
|
|
* HYPRE is free software; you can redistribute it and/or modify it under the
|
|
* terms of the GNU General Public License (as published by the Free Software
|
|
* Foundation) version 2.1 dated February 1999.
|
|
*
|
|
* HYPRE is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
* WARRANTY; without even the IMPLIED WARRANTY OF MERCHANTABILITY or FITNESS
|
|
* FOR A PARTICULAR PURPOSE. See the terms and conditions of the GNU General
|
|
* Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*
|
|
* $Revision$
|
|
***********************************************************************EHEADER*/
|
|
|
|
|
|
|
|
#include "../blas/hypre_blas.h"
|
|
#include "hypre_lapack.h"
|
|
#include "f2c.h"
|
|
|
|
logical lsame_(char *ca, char *cb)
|
|
{
|
|
/* -- LAPACK auxiliary routine (version 3.0) --
|
|
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
|
|
Courant Institute, Argonne National Lab, and Rice University
|
|
September 30, 1994
|
|
|
|
|
|
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 characters to be compared.
|
|
|
|
=====================================================================
|
|
|
|
|
|
|
|
Test if the characters are equal */
|
|
/* System generated locals */
|
|
logical ret_val;
|
|
/* Local variables */
|
|
static integer inta, intb, zcode;
|
|
|
|
|
|
ret_val = *(unsigned char *)ca == *(unsigned char *)cb;
|
|
if (ret_val) {
|
|
return ret_val;
|
|
}
|
|
|
|
/* Now test for equivalence if both 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 o
|
|
r
|
|
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 cod
|
|
e
|
|
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_ */
|
|
|