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