1 /* 2 * Copyright 2013 Garrett D'Amore <garrett@damore.org> 3 * Copyright 2010 Nexenta Systems, Inc. All rights reserved. 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 * 4. 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 * @(#)none.c 8.1 (Berkeley) 6/4/93 41 */ 42 43 #include <sys/cdefs.h> 44 __FBSDID("$FreeBSD$"); 45 46 #include <errno.h> 47 #include <limits.h> 48 #include <runetype.h> 49 #include <stddef.h> 50 #include <stdio.h> 51 #include <stdlib.h> 52 #include <string.h> 53 #include <wchar.h> 54 #include "mblocal.h" 55 56 static size_t _ascii_mbrtowc(wchar_t * __restrict, const char * __restrict, 57 size_t, mbstate_t * __restrict); 58 static int _ascii_mbsinit(const mbstate_t *); 59 static size_t _ascii_mbsnrtowcs(wchar_t * __restrict dst, 60 const char ** __restrict src, size_t nms, size_t len, 61 mbstate_t * __restrict ps __unused); 62 static size_t _ascii_wcrtomb(char * __restrict, wchar_t, 63 mbstate_t * __restrict); 64 static size_t _ascii_wcsnrtombs(char * __restrict, const wchar_t ** __restrict, 65 size_t, size_t, mbstate_t * __restrict); 66 67 int 68 _ascii_init(struct xlocale_ctype *l, _RuneLocale *rl) 69 { 70 71 l->__mbrtowc = _ascii_mbrtowc; 72 l->__mbsinit = _ascii_mbsinit; 73 l->__mbsnrtowcs = _ascii_mbsnrtowcs; 74 l->__wcrtomb = _ascii_wcrtomb; 75 l->__wcsnrtombs = _ascii_wcsnrtombs; 76 l->runes = rl; 77 l->__mb_cur_max = 1; 78 l->__mb_sb_limit = 128; 79 return(0); 80 } 81 82 static int 83 _ascii_mbsinit(const mbstate_t *ps __unused) 84 { 85 /* 86 * Encoding is not state dependent - we are always in the 87 * initial state. 88 */ 89 return (1); 90 } 91 92 static size_t 93 _ascii_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n, 94 mbstate_t * __restrict ps __unused) 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 111 static 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 127 static 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 s = memchr(*src, '\0', nms); 136 if (s == NULL) 137 return (nms); 138 139 if (*s & 0x80) { 140 errno = EILSEQ; 141 return ((size_t)-1); 142 } 143 return (s - *src); 144 } 145 146 s = *src; 147 nchr = 0; 148 while (len-- > 0 && nms-- > 0) { 149 if (*s & 0x80) { 150 errno = EILSEQ; 151 return ((size_t)-1); 152 } 153 if ((*dst++ = (unsigned char)*s++) == L'\0') { 154 *src = NULL; 155 return (nchr); 156 } 157 nchr++; 158 } 159 *src = s; 160 return (nchr); 161 } 162 163 static size_t 164 _ascii_wcsnrtombs(char * __restrict dst, const wchar_t ** __restrict src, 165 size_t nwc, size_t len, mbstate_t * __restrict ps __unused) 166 { 167 const wchar_t *s; 168 size_t nchr; 169 170 if (dst == NULL) { 171 for (s = *src; nwc > 0 && *s != L'\0'; s++, nwc--) { 172 if (*s < 0 || *s > 127) { 173 errno = EILSEQ; 174 return ((size_t)-1); 175 } 176 } 177 return (s - *src); 178 } 179 180 s = *src; 181 nchr = 0; 182 while (len-- > 0 && nwc-- > 0) { 183 if (*s < 0 || *s > 127) { 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