| | 1 | /*- |
| | 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. |
| | 35 | * |
| | 36 | * @(#)runetype.h 8.1 (Berkeley) 6/2/93 |
| | 37 | */ |
| | 38 | |
| | 39 | #ifndef _RUNETYPE_H_ |
| | 40 | #define _RUNETYPE_H_ |
| | 41 | |
| | 42 | #include <sys/cdefs.h> |
| | 43 | #include <machine/ansi.h> |
| | 44 | |
| | 45 | #ifndef _BSD_SIZE_T_DEFINED_ |
| | 46 | #define _BSD_SIZE_T_DEFINED_ |
| | 47 | typedef _BSD_SIZE_T_ size_t; |
| | 48 | #endif |
| | 49 | |
| | 50 | #ifndef _BSD_CT_RUNE_T_DEFINED_ |
| | 51 | #define _BSD_CT_RUNE_T_DEFINED_ |
| | 52 | typedef _BSD_CT_RUNE_T_ ct_rune_t; |
| | 53 | #endif |
| | 54 | |
| | 55 | #ifndef _BSD_RUNE_T_DEFINED_ |
| | 56 | #define _BSD_RUNE_T_DEFINED_ |
| | 57 | typedef _BSD_RUNE_T_ rune_t; |
| | 58 | #endif |
| | 59 | |
| | 60 | #ifndef __cplusplus |
| | 61 | #ifndef _BSD_WCHAR_T_DEFINED_ |
| | 62 | #define _BSD_WCHAR_T_DEFINED_ |
| | 63 | #ifdef __WCHAR_TYPE__ |
| | 64 | typedef __WCHAR_TYPE__ wchar_t; |
| | 65 | #else /* ! __WCHAR_TYPE__ */ |
| | 66 | typedef _BSD_WCHAR_T_ wchar_t; |
| | 67 | #endif /* __WCHAR_TYPE__ */ |
| | 68 | #endif /* _BSD_WCHAR_T_DEFINED_ */ |
| | 69 | #endif /* __cplusplus */ |
| | 70 | |
| | 71 | #ifndef _BSD_WINT_T_DEFINED_ |
| | 72 | #define _BSD_WINT_T_DEFINED_ |
| | 73 | typedef _BSD_WINT_T_ wint_t; |
| | 74 | #endif |
| | 75 | |
| | 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 { |
| | 83 | rune_t min; /* First rune of the range */ |
| | 84 | rune_t max; /* Last rune (inclusive) of the range */ |
| | 85 | rune_t map; /* What first maps to in maps */ |
| | 86 | unsigned long *types; /* Array of types in range */ |
| | 87 | } _RuneEntry; |
| | 88 | |
| | 89 | typedef struct { |
| | 90 | int nranges; /* Number of ranges stored */ |
| | 91 | _RuneEntry *ranges; /* Pointer to the ranges */ |
| | 92 | } _RuneRange; |
| | 93 | |
| | 94 | typedef struct { |
| | 95 | char magic[8]; /* Magic saying what version we are */ |
| | 96 | char encoding[32]; /* ASCII name of this encoding */ |
| | 97 | |
| | 98 | rune_t (*sgetrune) |
| | 99 | (const char *, size_t, char const **); |
| | 100 | int (*sputrune) |
| | 101 | (rune_t, char *, size_t, char **); |
| | 102 | rune_t invalid_rune; |
| | 103 | |
| | 104 | unsigned long runetype[_CACHED_RUNES]; |
| | 105 | rune_t maplower[_CACHED_RUNES]; |
| | 106 | rune_t mapupper[_CACHED_RUNES]; |
| | 107 | |
| | 108 | /* |
| | 109 | * The following are to deal with Runes larger than _CACHED_RUNES - 1. |
| | 110 | * Their data is actually contiguous with this structure so as to make |
| | 111 | * it easier to read/write from/to disk. |
| | 112 | */ |
| | 113 | _RuneRange runetype_ext; |
| | 114 | _RuneRange maplower_ext; |
| | 115 | _RuneRange mapupper_ext; |
| | 116 | |
| | 117 | void *variable; /* Data which depends on the encoding */ |
| | 118 | int variable_len; /* how long that data is */ |
| | 119 | } _RuneLocale; |
| | 120 | |
| | 121 | #define _RUNE_MAGIC_1 "RuneMagi" /* Indicates version 0 of RuneLocale */ |
| | 122 | |
| | 123 | __BEGIN_DECLS |
| | 124 | extern _RuneLocale _DefaultRuneLocale; |
| | 125 | extern _RuneLocale *_CurrentRuneLocale; |
| | 126 | __END_DECLS |
| | 127 | |
| | 128 | #endif /* !_RUNETYPE_H_ */ |
projects / apple / libc.git / blame_incremental