]>
Commit | Line | Data |
---|---|---|
5b2abdfb | 1 | /*- |
e9ce8d39 A |
2 | * Copyright (c) 1993 |
3 | * The Regents of the University of California. All rights reserved. | |
4 | * | |
5 | * This code is derived from software contributed to Berkeley by | |
6 | * Paul Borman at Krystal Technologies. | |
7 | * | |
8 | * Redistribution and use in source and binary forms, with or without | |
9 | * modification, are permitted provided that the following conditions | |
10 | * are met: | |
11 | * 1. Redistributions of source code must retain the above copyright | |
12 | * notice, this list of conditions and the following disclaimer. | |
13 | * 2. Redistributions in binary form must reproduce the above copyright | |
14 | * notice, this list of conditions and the following disclaimer in the | |
15 | * documentation and/or other materials provided with the distribution. | |
16 | * 3. All advertising materials mentioning features or use of this software | |
17 | * must display the following acknowledgement: | |
18 | * This product includes software developed by the University of | |
19 | * California, Berkeley and its contributors. | |
20 | * 4. Neither the name of the University nor the names of its contributors | |
21 | * may be used to endorse or promote products derived from this software | |
22 | * without specific prior written permission. | |
23 | * | |
24 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
25 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
28 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
29 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
30 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
31 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
32 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
33 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
34 | * SUCH DAMAGE. | |
5b2abdfb A |
35 | * |
36 | * @(#)runetype.h 8.1 (Berkeley) 6/2/93 | |
e9ce8d39 A |
37 | */ |
38 | ||
5b2abdfb A |
39 | #ifndef _RUNETYPE_H_ |
40 | #define _RUNETYPE_H_ | |
41 | ||
42 | #include <sys/cdefs.h> | |
59e0d9fe | 43 | #include <_types.h> |
5b2abdfb | 44 | |
3d9156a7 A |
45 | #ifndef _POSIX_C_SOURCE |
46 | ||
47 | #ifndef _SIZE_T | |
48 | #define _SIZE_T | |
49 | typedef __darwin_size_t size_t; | |
5b2abdfb A |
50 | #endif |
51 | ||
3d9156a7 A |
52 | #ifndef _CT_RUNE_T |
53 | #define _CT_RUNE_T | |
54 | typedef __darwin_ct_rune_t ct_rune_t; | |
9385eb3d A |
55 | #endif |
56 | ||
3d9156a7 A |
57 | #ifndef _RUNE_T |
58 | #define _RUNE_T | |
59 | typedef __darwin_rune_t rune_t; | |
9385eb3d A |
60 | #endif |
61 | ||
62 | #ifndef __cplusplus | |
3d9156a7 A |
63 | #ifndef _WCHAR_T |
64 | #define _WCHAR_T | |
65 | typedef __darwin_wchar_t wchar_t; | |
66 | #endif /* _WCHAR_T */ | |
9385eb3d A |
67 | #endif /* __cplusplus */ |
68 | ||
3d9156a7 A |
69 | #ifndef _WINT_T |
70 | #define _WINT_T | |
71 | typedef __darwin_wint_t wint_t; | |
5b2abdfb A |
72 | #endif |
73 | ||
3d9156a7 A |
74 | #endif /* !_POSIX_C_SOURCE */ |
75 | ||
5b2abdfb A |
76 | #define _CACHED_RUNES (1 <<8 ) /* Must be a power of 2 */ |
77 | #define _CRMASK (~(_CACHED_RUNES - 1)) | |
78 | ||
79 | /* | |
80 | * The lower 8 bits of runetype[] contain the digit value of the rune. | |
81 | */ | |
82 | typedef struct { | |
3d9156a7 A |
83 | __darwin_rune_t __min; /* First rune of the range */ |
84 | __darwin_rune_t __max; /* Last rune (inclusive) of the range */ | |
85 | __darwin_rune_t __map; /* What first maps to in maps */ | |
86 | __uint32_t *__types; /* Array of types in range */ | |
5b2abdfb A |
87 | } _RuneEntry; |
88 | ||
89 | typedef struct { | |
3d9156a7 A |
90 | int __nranges; /* Number of ranges stored */ |
91 | _RuneEntry *__ranges; /* Pointer to the ranges */ | |
5b2abdfb A |
92 | } _RuneRange; |
93 | ||
94 | typedef struct { | |
3d9156a7 A |
95 | char __magic[8]; /* Magic saying what version we are */ |
96 | char __encoding[32]; /* ASCII name of this encoding */ | |
5b2abdfb | 97 | |
3d9156a7 A |
98 | __darwin_rune_t (*__sgetrune)(const char *, __darwin_size_t, char const **); |
99 | int (*__sputrune)(__darwin_rune_t, char *, __darwin_size_t, char **); | |
100 | __darwin_rune_t __invalid_rune; | |
5b2abdfb | 101 | |
3d9156a7 A |
102 | __uint32_t __runetype[_CACHED_RUNES]; |
103 | __darwin_rune_t __maplower[_CACHED_RUNES]; | |
104 | __darwin_rune_t __mapupper[_CACHED_RUNES]; | |
5b2abdfb A |
105 | |
106 | /* | |
107 | * The following are to deal with Runes larger than _CACHED_RUNES - 1. | |
108 | * Their data is actually contiguous with this structure so as to make | |
109 | * it easier to read/write from/to disk. | |
110 | */ | |
3d9156a7 A |
111 | _RuneRange __runetype_ext; |
112 | _RuneRange __maplower_ext; | |
113 | _RuneRange __mapupper_ext; | |
5b2abdfb | 114 | |
3d9156a7 A |
115 | void *__variable; /* Data which depends on the encoding */ |
116 | int __variable_len; /* how long that data is */ | |
5b2abdfb A |
117 | } _RuneLocale; |
118 | ||
119 | #define _RUNE_MAGIC_1 "RuneMagi" /* Indicates version 0 of RuneLocale */ | |
120 | ||
9385eb3d | 121 | __BEGIN_DECLS |
5b2abdfb A |
122 | extern _RuneLocale _DefaultRuneLocale; |
123 | extern _RuneLocale *_CurrentRuneLocale; | |
9385eb3d | 124 | __END_DECLS |
e9ce8d39 | 125 | |
5b2abdfb | 126 | #endif /* !_RUNETYPE_H_ */ |