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 <_bounds.h>
 43#include <_types.h>
 44
 45_LIBC_SINGLE_BY_DEFAULT()
 46
 47#if !defined(_POSIX_C_SOURCE) || defined(_DARWIN_C_SOURCE)
 48
 49#include <sys/_types/_size_t.h>
 50#include <sys/_types/_ct_rune_t.h>
 51#include <sys/_types/_rune_t.h>
 52#include <sys/_types/_wchar_t.h>
 53#include <sys/_types/_wint_t.h>
 54
 55#endif /* (!_POSIX_C_SOURCE || _DARWIN_C_SOURCE) */
 56
 57#define	_CACHED_RUNES	(1 <<8 )	/* Must be a power of 2 */
 58#define	_CRMASK		(~(_CACHED_RUNES - 1))
 59
 60/*
 61 * The lower 8 bits of runetype[] contain the digit value of the rune.
 62 */
 63typedef struct {
 64	__darwin_rune_t	__min;		/* First rune of the range */
 65	__darwin_rune_t	__max;		/* Last rune (inclusive) of the range */
 66	__darwin_rune_t	__map;		/* What first maps to in maps */
 67	__uint32_t *_LIBC_UNSAFE_INDEXABLE	__types;	/* Array of types in range */
 68} _RuneEntry;
 69
 70typedef struct {
 71	int		__nranges;	/* Number of ranges stored */
 72	_RuneEntry *_LIBC_COUNT(__nranges)	__ranges;	/* Pointer to the ranges */
 73} _RuneRange;
 74
 75typedef struct {
 76	char		__name[14];	/* CHARCLASS_NAME_MAX = 14 */
 77	__uint32_t	__mask;		/* charclass mask */
 78} _RuneCharClass;
 79
 80typedef struct {
 81	char		__magic[8];	/* Magic saying what version we are */
 82	char		__encoding[32];	/* ASCII name of this encoding */
 83
 84	__darwin_rune_t	(*__sgetrune)(const char *_LIBC_COUNT(__n) __string, __darwin_size_t __n, char const *_LIBC_UNSAFE_INDEXABLE /* NULL or within bounds of __string */ *);
 85	int		(*__sputrune)(__darwin_rune_t, char *_LIBC_COUNT(__n) __string, __darwin_size_t __n, char *_LIBC_UNSAFE_INDEXABLE /* NULL or within bounds of __string */ *);
 86	__darwin_rune_t	__invalid_rune;	/* Deprecated */
 87
 88	__uint32_t	__runetype[_CACHED_RUNES];
 89	__darwin_rune_t	__maplower[_CACHED_RUNES];
 90	__darwin_rune_t	__mapupper[_CACHED_RUNES];
 91
 92	/*
 93	 * The following are to deal with Runes larger than _CACHED_RUNES - 1.
 94	 * Their data is actually contiguous with this structure so as to make
 95	 * it easier to read/write from/to disk.
 96	 */
 97	_RuneRange	__runetype_ext;
 98	_RuneRange	__maplower_ext;
 99	_RuneRange	__mapupper_ext;
100
101	void *_LIBC_SIZE(__variable_len)	__variable;	/* Data which depends on the encoding */
102	int		__variable_len;	/* how long that data is */
103
104	/*
105	 * extra fields to deal with arbitrary character classes
106	 */
107	int		__ncharclasses;
108	_RuneCharClass *_LIBC_COUNT(__ncharclasses)	__charclasses;
109} _RuneLocale;
110
111#define	_RUNE_MAGIC_A	"RuneMagA"	/* Indicates version A of RuneLocale */
112
113__BEGIN_DECLS
114extern _RuneLocale _DefaultRuneLocale;
115extern _RuneLocale *_CurrentRuneLocale;
116__END_DECLS
117
118#endif	/* !_RUNETYPE_H_ */