1/*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
5 * Copyright (c) 1993
6 *	The Regents of the University of California.  All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * Paul Borman at Krystal Technologies.
10 *
11 * Copyright (c) 2011 The FreeBSD Foundation
12 * All rights reserved.
13 * Portions of this software were developed by David Chisnall
14 * under sponsorship from the FreeBSD Foundation.
15 *
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
18 * are met:
19 * 1. Redistributions of source code must retain the above copyright
20 *    notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 *    notice, this list of conditions and the following disclaimer in the
23 *    documentation and/or other materials provided with the distribution.
24 * 3. Neither the name of the University nor the names of its contributors
25 *    may be used to endorse or promote products derived from this software
26 *    without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 */
40
41#include <sys/cdefs.h>
42__FBSDID("$FreeBSD$");
43
44#include <errno.h>
45#include <limits.h>
46#include <runetype.h>
47#include <stddef.h>
48#include <stdio.h>
49#include <stdlib.h>
50#include <string.h>
51#include <wchar.h>
52#include "mblocal.h"
53
54static size_t	_ascii_mbrtowc(wchar_t * __restrict, const char * __restrict,
55		    size_t, mbstate_t * __restrict);
56static int	_ascii_mbsinit(const mbstate_t *);
57static size_t	_ascii_mbsnrtowcs(wchar_t * __restrict dst,
58		    const char ** __restrict src, size_t nms, size_t len,
59		    mbstate_t * __restrict ps __unused);
60static size_t	_ascii_wcrtomb(char * __restrict, wchar_t,
61		    mbstate_t * __restrict);
62static size_t	_ascii_wcsnrtombs(char * __restrict, const wchar_t ** __restrict,
63		    size_t, size_t, mbstate_t * __restrict);
64
65int
66_ascii_init(struct xlocale_ctype *l,_RuneLocale *rl)
67{
68
69	l->__mbrtowc = _ascii_mbrtowc;
70	l->__mbsinit = _ascii_mbsinit;
71	l->__mbsnrtowcs = _ascii_mbsnrtowcs;
72	l->__wcrtomb = _ascii_wcrtomb;
73	l->__wcsnrtombs = _ascii_wcsnrtombs;
74	l->runes = rl;
75	l->__mb_cur_max = 1;
76	l->__mb_sb_limit = 128;
77	return(0);
78}
79
80static int
81_ascii_mbsinit(const mbstate_t *ps __unused)
82{
83
84	/*
85	 * Encoding is not state dependent - we are always in the
86	 * initial state.
87	 */
88	return (1);
89}
90
91static size_t
92_ascii_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
93    mbstate_t * __restrict ps __unused)
94{
95
96	if (s == NULL)
97		/* Reset to initial shift state (no-op) */
98		return (0);
99	if (n == 0)
100		/* Incomplete multibyte sequence */
101		return ((size_t)-2);
102	if (*s & 0x80) {
103		errno = EILSEQ;
104		return ((size_t)-1);
105	}
106	if (pwc != NULL)
107		*pwc = (unsigned char)*s;
108	return (*s == '\0' ? 0 : 1);
109}
110
111static size_t
112_ascii_wcrtomb(char * __restrict s, wchar_t wc,
113    mbstate_t * __restrict ps __unused)
114{
115
116	if (s == NULL)
117		/* Reset to initial shift state (no-op) */
118		return (1);
119	if (wc < 0 || wc > 127) {
120		errno = EILSEQ;
121		return ((size_t)-1);
122	}
123	*s = (unsigned char)wc;
124	return (1);
125}
126
127static size_t
128_ascii_mbsnrtowcs(wchar_t * __restrict dst, const char ** __restrict src,
129    size_t nms, size_t len, mbstate_t * __restrict ps __unused)
130{
131	const char *s;
132	size_t nchr;
133
134	if (dst == NULL) {
135		for (s = *src; nms > 0 && *s != '\0'; s++, nms--) {
136			if (*s & 0x80) {
137				errno = EILSEQ;
138				return ((size_t)-1);
139			}
140		}
141		return (s - *src);
142	}
143
144	s = *src;
145	nchr = 0;
146	while (len-- > 0 && nms-- > 0) {
147		if (*s & 0x80) {
148			*src = s;
149			errno = EILSEQ;
150			return ((size_t)-1);
151		}
152		if ((*dst++ = (unsigned char)*s++) == L'\0') {
153			*src = NULL;
154			return (nchr);
155		}
156		nchr++;
157	}
158	*src = s;
159	return (nchr);
160}
161
162static size_t
163_ascii_wcsnrtombs(char * __restrict dst, const wchar_t ** __restrict src,
164    size_t nwc, size_t len, mbstate_t * __restrict ps __unused)
165{
166	const wchar_t *s;
167	size_t nchr;
168
169	if (dst == NULL) {
170		for (s = *src; nwc > 0 && *s != L'\0'; s++, nwc--) {
171			if (*s < 0 || *s > 127) {
172				errno = EILSEQ;
173				return ((size_t)-1);
174			}
175		}
176		return (s - *src);
177	}
178
179	s = *src;
180	nchr = 0;
181	while (len-- > 0 && nwc-- > 0) {
182		if (*s < 0 || *s > 127) {
183			*src = s;
184			errno = EILSEQ;
185			return ((size_t)-1);
186		}
187		if ((*dst++ = *s++) == '\0') {
188			*src = NULL;
189			return (nchr);
190		}
191		nchr++;
192	}
193	*src = s;
194	return (nchr);
195}
196
197