/* * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved. * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this * file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_LICENSE_HEADER_END@ */ /* * Copyright (c) 1989, 1993 * The Regents of the University of California. All rights reserved. * (c) UNIX System Laboratories, Inc. * All or some portions of this file are derived from material licensed * to the University of California by American Telephone and Telegraph * Co. or Unix System Laboratories, Inc. and are reproduced herein with * the permission of UNIX System Laboratories, Inc. * * This code is derived from software contributed to Berkeley by * Paul Borman at Krystal Technologies. * * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University 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 REGENTS 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 REGENTS 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. * * @(#)ctype.h 8.4 (Berkeley) 1/21/94 */ #ifndef _CTYPE_H_ #define _CTYPE_H_ #include <runetype.h> #define _A 0x00000100L /* Alpha */ #define _C 0x00000200L /* Control */ #define _D 0x00000400L /* Digit */ #define _G 0x00000800L /* Graph */ #define _L 0x00001000L /* Lower */ #define _P 0x00002000L /* Punct */ #define _S 0x00004000L /* Space */ #define _U 0x00008000L /* Upper */ #define _X 0x00010000L /* X digit */ #define _B 0x00020000L /* Blank */ #define _R 0x00040000L /* Print */ #define _I 0x00080000L /* Ideogram */ #define _T 0x00100000L /* Special */ #define _Q 0x00200000L /* Phonogram */ #define _CTYPE_A _A #define _CTYPE_C _C #define _CTYPE_D _D #define _CTYPE_G _G #define _CTYPE_L _L #define _CTYPE_P _P #define _CTYPE_S _S #define _CTYPE_U _U #define _CTYPE_X _X #define _CTYPE_B _B #define _CTYPE_R _R #define _CTYPE_I _I #define _CTYPE_T _T #define _CTYPE_Q _Q __BEGIN_DECLS int isalnum __P((int)); int isalpha __P((int)); int iscntrl __P((int)); int isdigit __P((int)); int isgraph __P((int)); int islower __P((int)); int isprint __P((int)); int ispunct __P((int)); int isspace __P((int)); int isupper __P((int)); int isxdigit __P((int)); int tolower __P((int)); int toupper __P((int)); #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) int digittoint __P((int)); int isascii __P((int)); int isblank __P((int)); int ishexnumber __P((int)); int isideogram __P((int)); int isnumber __P((int)); int isphonogram __P((int)); int isrune __P((int)); int isspecial __P((int)); int toascii __P((int)); #endif __END_DECLS #define isalnum(c) __istype((c), (_A|_D)) #define isalpha(c) __istype((c), _A) #define iscntrl(c) __istype((c), _C) #define isdigit(c) __isctype((c), _D) /* ANSI -- locale independent */ #define isgraph(c) __istype((c), _G) #define islower(c) __istype((c), _L) #define isprint(c) __istype((c), _R) #define ispunct(c) __istype((c), _P) #define isspace(c) __istype((c), _S) #define isupper(c) __istype((c), _U) #define isxdigit(c) __isctype((c), _X) /* ANSI -- locale independent */ #define tolower(c) __tolower(c) #define toupper(c) __toupper(c) #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE) #define digittoint(c) __maskrune((c), 0xFF) #define isascii(c) ((c & ~0x7F) == 0) #define isblank(c) __istype((c), _B) #define ishexnumber(c) __istype((c), _X) #define isideogram(c) __istype((c), _I) #define isnumber(c) __istype((c), _D) #define isphonogram(c) __istype((c), _T) #define isrune(c) __istype((c), 0xFFFFFF00L) #define isspecial(c) __istype((c), _Q) #define toascii(c) ((c) & 0x7F) #endif /* See comments in <machine/ansi.h> about _BSD_RUNE_T_. */ __BEGIN_DECLS unsigned long ___runetype __P((_BSD_CT_RUNE_T_)); _BSD_CT_RUNE_T_ ___tolower __P((_BSD_CT_RUNE_T_)); _BSD_CT_RUNE_T_ ___toupper __P((_BSD_CT_RUNE_T_)); __END_DECLS /* * _EXTERNALIZE_CTYPE_INLINES_ is defined in locale/nomacros.c to tell us * to generate code for extern versions of all our inline functions. */ #ifdef _EXTERNALIZE_CTYPE_INLINES_ #define _USE_CTYPE_INLINE_ #define static #define __inline #endif /* * Use inline functions if we are allowed to and the compiler supports them. */ #if !defined(_DONT_USE_CTYPE_INLINE_) && \ (defined(_USE_CTYPE_INLINE_) || defined(__GNUC__) || defined(__cplusplus)) static __inline int __maskrune(_BSD_CT_RUNE_T_ _c, unsigned long _f) { return ((_c < 0 || _c >= _CACHED_RUNES) ? ___runetype(_c) : _CurrentRuneLocale->runetype[_c]) & _f; } static __inline int __istype(_BSD_CT_RUNE_T_ c, unsigned long f) { return !!(__maskrune(c, f)); } static __inline _BSD_CT_RUNE_T_ __isctype(_BSD_CT_RUNE_T_ _c, unsigned long _f) { return (_c < 0 || _c >= _CACHED_RUNES) ? 0 : !!(_DefaultRuneLocale.runetype[_c] & _f); } static __inline _BSD_CT_RUNE_T_ __toupper(_BSD_CT_RUNE_T_ _c) { return (_c < 0 || _c >= _CACHED_RUNES) ? ___toupper(_c) : _CurrentRuneLocale->mapupper[_c]; } static __inline _BSD_CT_RUNE_T_ __tolower(_BSD_CT_RUNE_T_ _c) { return (_c < 0 || _c >= _CACHED_RUNES) ? ___tolower(_c) : _CurrentRuneLocale->maplower[_c]; } #else /* not using inlines */ __BEGIN_DECLS int __maskrune __P((_BSD_CT_RUNE_T_, unsigned long)); int __istype __P((_BSD_CT_RUNE_T_, unsigned long)); int __isctype __P((_BSD_CT_RUNE_T_, unsigned long)); _BSD_CT_RUNE_T_ __toupper __P((_BSD_CT_RUNE_T_)); _BSD_CT_RUNE_T_ __tolower __P((_BSD_CT_RUNE_T_)); __END_DECLS #endif /* using inlines */ #endif /* !_CTYPE_H_ */