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