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 * 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 #include <errno.h> 43 #include <limits.h> 44 #include <runetype.h> 45 #include <stddef.h> 46 #include <stdio.h> 47 #include <stdlib.h> 48 #include <string.h> 49 #include <wchar.h> 50 #include "mblocal.h" 51 52 static size_t _ascii_mbrtowc(wchar_t * __restrict, const char * __restrict, 53 size_t, mbstate_t * __restrict); 54 static int _ascii_mbsinit(const mbstate_t *); 55 static size_t _ascii_mbsnrtowcs(wchar_t * __restrict dst, 56 const char ** __restrict src, size_t nms, size_t len, 57 mbstate_t * __restrict ps __unused); 58 static size_t _ascii_wcrtomb(char * __restrict, wchar_t, 59 mbstate_t * __restrict); 60 static size_t _ascii_wcsnrtombs(char * __restrict, const wchar_t ** __restrict, 61 size_t, size_t, mbstate_t * __restrict); 62 63 int 64 _ascii_init(struct xlocale_ctype *l,_RuneLocale *rl) 65 { 66 67 l->__mbrtowc = _ascii_mbrtowc; 68 l->__mbsinit = _ascii_mbsinit; 69 l->__mbsnrtowcs = _ascii_mbsnrtowcs; 70 l->__wcrtomb = _ascii_wcrtomb; 71 l->__wcsnrtombs = _ascii_wcsnrtombs; 72 l->runes = rl; 73 l->__mb_cur_max = 1; 74 l->__mb_sb_limit = 128; 75 return(0); 76 } 77 78 static int 79 _ascii_mbsinit(const mbstate_t *ps __unused) 80 { 81 82 /* 83 * Encoding is not state dependent - we are always in the 84 * initial state. 85 */ 86 return (1); 87 } 88 89 static size_t 90 _ascii_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n, 91 mbstate_t * __restrict ps __unused) 92 { 93 94 if (s == NULL) 95 /* Reset to initial shift state (no-op) */ 96 return (0); 97 if (n == 0) 98 /* Incomplete multibyte sequence */ 99 return ((size_t)-2); 100 if (*s & 0x80) { 101 errno = EILSEQ; 102 return ((size_t)-1); 103 } 104 if (pwc != NULL) 105 *pwc = (unsigned char)*s; 106 return (*s == '\0' ? 0 : 1); 107 } 108 109 static size_t 110 _ascii_wcrtomb(char * __restrict s, wchar_t wc, 111 mbstate_t * __restrict ps __unused) 112 { 113 114 if (s == NULL) 115 /* Reset to initial shift state (no-op) */ 116 return (1); 117 if (wc < 0 || wc > 127) { 118 errno = EILSEQ; 119 return ((size_t)-1); 120 } 121 *s = (unsigned char)wc; 122 return (1); 123 } 124 125 static size_t 126 _ascii_mbsnrtowcs(wchar_t * __restrict dst, const char ** __restrict src, 127 size_t nms, size_t len, mbstate_t * __restrict ps __unused) 128 { 129 const char *s; 130 size_t nchr; 131 132 if (dst == NULL) { 133 for (s = *src; nms > 0 && *s != '\0'; s++, nms--) { 134 if (*s & 0x80) { 135 errno = EILSEQ; 136 return ((size_t)-1); 137 } 138 } 139 return (s - *src); 140 } 141 142 s = *src; 143 nchr = 0; 144 while (len-- > 0 && nms-- > 0) { 145 if (*s & 0x80) { 146 *src = s; 147 errno = EILSEQ; 148 return ((size_t)-1); 149 } 150 if ((*dst++ = (unsigned char)*s++) == L'\0') { 151 *src = NULL; 152 return (nchr); 153 } 154 nchr++; 155 } 156 *src = s; 157 return (nchr); 158 } 159 160 static size_t 161 _ascii_wcsnrtombs(char * __restrict dst, const wchar_t ** __restrict src, 162 size_t nwc, size_t len, mbstate_t * __restrict ps __unused) 163 { 164 const wchar_t *s; 165 size_t nchr; 166 167 if (dst == NULL) { 168 for (s = *src; nwc > 0 && *s != L'\0'; s++, nwc--) { 169 if (*s < 0 || *s > 127) { 170 errno = EILSEQ; 171 return ((size_t)-1); 172 } 173 } 174 return (s - *src); 175 } 176 177 s = *src; 178 nchr = 0; 179 while (len-- > 0 && nwc-- > 0) { 180 if (*s < 0 || *s > 127) { 181 *src = s; 182 errno = EILSEQ; 183 return ((size_t)-1); 184 } 185 if ((*dst++ = *s++) == '\0') { 186 *src = NULL; 187 return (nchr); 188 } 189 nchr++; 190 } 191 *src = s; 192 return (nchr); 193 } 194 195