2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
10 * This code is derived from software contributed to Berkeley by
11 * Paul Borman at Krystal Technologies.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 * @(#)ctype.h 8.4 (Berkeley) 1/21/94
49 * XXX <runetype.h> brings massive namespace pollution (rune_t and struct
54 #define _CTYPE_A 0x00000100L /* Alpha */
55 #define _CTYPE_C 0x00000200L /* Control */
56 #define _CTYPE_D 0x00000400L /* Digit */
57 #define _CTYPE_G 0x00000800L /* Graph */
58 #define _CTYPE_L 0x00001000L /* Lower */
59 #define _CTYPE_P 0x00002000L /* Punct */
60 #define _CTYPE_S 0x00004000L /* Space */
61 #define _CTYPE_U 0x00008000L /* Upper */
62 #define _CTYPE_X 0x00010000L /* X digit */
63 #define _CTYPE_B 0x00020000L /* Blank */
64 #define _CTYPE_R 0x00040000L /* Print */
65 #define _CTYPE_I 0x00080000L /* Ideogram */
66 #define _CTYPE_T 0x00100000L /* Special */
67 #define _CTYPE_Q 0x00200000L /* Phonogram */
84 #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
98 #define isalnum(c) __istype((c), _CTYPE_A|_CTYPE_D)
99 #define isalpha(c) __istype((c), _CTYPE_A)
100 #define iscntrl(c) __istype((c), _CTYPE_C)
101 #define isdigit(c) __isctype((c), _CTYPE_D) /* ANSI -- locale independent */
102 #define isgraph(c) __istype((c), _CTYPE_G)
103 #define islower(c) __istype((c), _CTYPE_L)
104 #define isprint(c) __istype((c), _CTYPE_R)
105 #define ispunct(c) __istype((c), _CTYPE_P)
106 #define isspace(c) __istype((c), _CTYPE_S)
107 #define isupper(c) __istype((c), _CTYPE_U)
108 #define isxdigit(c) __isctype((c), _CTYPE_X) /* ANSI -- locale independent */
109 #define tolower(c) __tolower(c)
110 #define toupper(c) __toupper(c)
112 #if !defined(_ANSI_SOURCE) && !defined(_POSIX_SOURCE)
113 #define digittoint(c) __maskrune((c), 0xFF)
114 #define isascii(c) (((c) & ~0x7F) == 0)
115 #define isblank(c) __istype((c), _CTYPE_B)
116 #define ishexnumber(c) __istype((c), _CTYPE_X)
117 #define isideogram(c) __istype((c), _CTYPE_I)
118 #define isnumber(c) __istype((c), _CTYPE_D)
119 #define isphonogram(c) __istype((c), _CTYPE_Q)
120 #define isrune(c) __istype((c), 0xFFFFFF00L)
121 #define isspecial(c) __istype((c), _CTYPE_T)
122 #define toascii(c) ((c) & 0x7F)
125 /* See comments in <machine/ansi.h> about _BSD_CT_RUNE_T_. */
127 unsigned long ___runetype(_BSD_CT_RUNE_T_);
128 _BSD_CT_RUNE_T_ ___tolower(_BSD_CT_RUNE_T_);
129 _BSD_CT_RUNE_T_ ___toupper(_BSD_CT_RUNE_T_);
133 * _EXTERNALIZE_CTYPE_INLINES_ is defined in locale/nomacros.c to tell us
134 * to generate code for extern versions of all our inline functions.
136 #ifdef _EXTERNALIZE_CTYPE_INLINES_
137 #define _USE_CTYPE_INLINE_
143 * Use inline functions if we are allowed to and the compiler supports them.
145 #if !defined(_DONT_USE_CTYPE_INLINE_) && \
146 (defined(_USE_CTYPE_INLINE_) || defined(__GNUC__) || defined(__cplusplus))
148 __maskrune(_BSD_CT_RUNE_T_ _c, unsigned long _f)
150 return ((_c < 0 || _c >= _CACHED_RUNES) ? ___runetype(_c) :
151 _CurrentRuneLocale->runetype[_c]) & _f;
155 __istype(_BSD_CT_RUNE_T_ _c, unsigned long _f)
157 return (!!__maskrune(_c, _f));
161 __isctype(_BSD_CT_RUNE_T_ _c, unsigned long _f)
163 return (_c < 0 || _c >= _CACHED_RUNES) ? 0 :
164 !!(_DefaultRuneLocale.runetype[_c] & _f);
167 static __inline _BSD_CT_RUNE_T_
168 __toupper(_BSD_CT_RUNE_T_ _c)
170 return (_c < 0 || _c >= _CACHED_RUNES) ? ___toupper(_c) :
171 _CurrentRuneLocale->mapupper[_c];
174 static __inline _BSD_CT_RUNE_T_
175 __tolower(_BSD_CT_RUNE_T_ _c)
177 return (_c < 0 || _c >= _CACHED_RUNES) ? ___tolower(_c) :
178 _CurrentRuneLocale->maplower[_c];
181 #else /* not using inlines */
184 int __maskrune(_BSD_CT_RUNE_T_, unsigned long);
185 int __istype(_BSD_CT_RUNE_T_, unsigned long);
186 int __isctype(_BSD_CT_RUNE_T_, unsigned long);
187 _BSD_CT_RUNE_T_ __toupper(_BSD_CT_RUNE_T_);
188 _BSD_CT_RUNE_T_ __tolower(_BSD_CT_RUNE_T_);
190 #endif /* using inlines */
192 #endif /* !_CTYPE_H_ */