1/*-
2 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
3 * Copyright (c) 1993
4 * The Regents of the University of California. All rights reserved.
5 *
6 * This code is derived from software contributed to Berkeley by
7 * Paul Borman at Krystal Technologies.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 */
37
38#if defined(LIBC_SCCS) && !defined(lint)
39static char sccsid[] = "@(#)none.c 8.1 (Berkeley) 6/4/93";
40#endif /* LIBC_SCCS and not lint */
41#include <sys/cdefs.h>
| 1/*-
2 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
3 * Copyright (c) 1993
4 * The Regents of the University of California. All rights reserved.
5 *
6 * This code is derived from software contributed to Berkeley by
7 * Paul Borman at Krystal Technologies.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 */
37
38#if defined(LIBC_SCCS) && !defined(lint)
39static char sccsid[] = "@(#)none.c 8.1 (Berkeley) 6/4/93";
40#endif /* LIBC_SCCS and not lint */
41#include <sys/cdefs.h>
|
42__FBSDID("$FreeBSD: head/lib/libc/locale/none.c 129179 2004-05-13 11:20:27Z tjr $");
| 42__FBSDID("$FreeBSD: head/lib/libc/locale/none.c 129707 2004-05-25 10:45:24Z tjr $");
|
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
54int _none_init(_RuneLocale *);
55size_t _none_mbrtowc(wchar_t * __restrict, const char * __restrict, size_t,
56 mbstate_t * __restrict);
57int _none_mbsinit(const mbstate_t *);
58size_t _none_mbsrtowcs(wchar_t * __restrict, const char ** __restrict,
59 size_t, mbstate_t * __restrict);
60size_t _none_wcrtomb(char * __restrict, wchar_t, mbstate_t * __restrict);
61size_t _none_wcsrtombs(char * __restrict, const wchar_t ** __restrict,
62 size_t, mbstate_t * __restrict);
63
64int
65_none_init(_RuneLocale *rl)
66{
67
68 __mbrtowc = _none_mbrtowc;
69 __mbsinit = _none_mbsinit;
70 __mbsrtowcs = _none_mbsrtowcs;
71 __wcrtomb = _none_wcrtomb;
72 __wcsrtombs = _none_wcsrtombs;
73 _CurrentRuneLocale = rl;
74 __mb_cur_max = 1;
75 return(0);
76}
77
78int
79_none_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
89size_t
90_none_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 (pwc != NULL)
101 *pwc = (unsigned char)*s;
102 return (*s == '\0' ? 0 : 1);
103}
104
105size_t
106_none_wcrtomb(char * __restrict s, wchar_t wc,
107 mbstate_t * __restrict ps __unused)
108{
109
110 if (s == NULL)
111 /* Reset to initial shift state (no-op) */
112 return (1);
113 if (wc < 0 || wc > UCHAR_MAX) {
114 errno = EILSEQ;
115 return ((size_t)-1);
116 }
117 *s = (unsigned char)wc;
118 return (1);
119}
120
121size_t
122_none_mbsrtowcs(wchar_t * __restrict dst, const char ** __restrict src,
123 size_t len, mbstate_t * __restrict ps __unused)
124{
125 const char *s;
126 size_t nchr;
127
128 if (dst == NULL)
129 return (strlen(*src));
130
131 s = *src;
132 nchr = 0;
133 while (len-- > 0) {
134 if ((*dst++ = (unsigned char)*s++) == L'\0') {
135 *src = NULL;
136 return (nchr);
137 }
138 nchr++;
139 }
140 *src = s;
141 return (nchr);
142}
143
144size_t
145_none_wcsrtombs(char * __restrict dst, const wchar_t ** __restrict src,
146 size_t len, mbstate_t * __restrict ps __unused)
147{
148 const wchar_t *s;
149 size_t nchr;
150
| 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
54int _none_init(_RuneLocale *);
55size_t _none_mbrtowc(wchar_t * __restrict, const char * __restrict, size_t,
56 mbstate_t * __restrict);
57int _none_mbsinit(const mbstate_t *);
58size_t _none_mbsrtowcs(wchar_t * __restrict, const char ** __restrict,
59 size_t, mbstate_t * __restrict);
60size_t _none_wcrtomb(char * __restrict, wchar_t, mbstate_t * __restrict);
61size_t _none_wcsrtombs(char * __restrict, const wchar_t ** __restrict,
62 size_t, mbstate_t * __restrict);
63
64int
65_none_init(_RuneLocale *rl)
66{
67
68 __mbrtowc = _none_mbrtowc;
69 __mbsinit = _none_mbsinit;
70 __mbsrtowcs = _none_mbsrtowcs;
71 __wcrtomb = _none_wcrtomb;
72 __wcsrtombs = _none_wcsrtombs;
73 _CurrentRuneLocale = rl;
74 __mb_cur_max = 1;
75 return(0);
76}
77
78int
79_none_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
89size_t
90_none_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 (pwc != NULL)
101 *pwc = (unsigned char)*s;
102 return (*s == '\0' ? 0 : 1);
103}
104
105size_t
106_none_wcrtomb(char * __restrict s, wchar_t wc,
107 mbstate_t * __restrict ps __unused)
108{
109
110 if (s == NULL)
111 /* Reset to initial shift state (no-op) */
112 return (1);
113 if (wc < 0 || wc > UCHAR_MAX) {
114 errno = EILSEQ;
115 return ((size_t)-1);
116 }
117 *s = (unsigned char)wc;
118 return (1);
119}
120
121size_t
122_none_mbsrtowcs(wchar_t * __restrict dst, const char ** __restrict src,
123 size_t len, mbstate_t * __restrict ps __unused)
124{
125 const char *s;
126 size_t nchr;
127
128 if (dst == NULL)
129 return (strlen(*src));
130
131 s = *src;
132 nchr = 0;
133 while (len-- > 0) {
134 if ((*dst++ = (unsigned char)*s++) == L'\0') {
135 *src = NULL;
136 return (nchr);
137 }
138 nchr++;
139 }
140 *src = s;
141 return (nchr);
142}
143
144size_t
145_none_wcsrtombs(char * __restrict dst, const wchar_t ** __restrict src,
146 size_t len, mbstate_t * __restrict ps __unused)
147{
148 const wchar_t *s;
149 size_t nchr;
150
|
151 if (dst == NULL)
152 return (wcslen(*src));
| 151 if (dst == NULL) {
152 for (s = *src; *s != L'\0'; s++) {
153 if (*s < 0 || *s > UCHAR_MAX) {
154 errno = EILSEQ;
155 return ((size_t)-1);
156 }
157 }
158 return (s - *src);
159 }
|
153
154 s = *src;
155 nchr = 0;
156 while (len-- > 0) {
157 if (*s < 0 || *s > UCHAR_MAX) {
158 errno = EILSEQ;
159 return ((size_t)-1);
160 }
161 if ((*dst++ = *s++) == '\0') {
162 *src = NULL;
163 return (nchr);
164 }
165 nchr++;
166 }
167 *src = s;
168 return (nchr);
169}
| 160
161 s = *src;
162 nchr = 0;
163 while (len-- > 0) {
164 if (*s < 0 || *s > UCHAR_MAX) {
165 errno = EILSEQ;
166 return ((size_t)-1);
167 }
168 if ((*dst++ = *s++) == '\0') {
169 *src = NULL;
170 return (nchr);
171 }
172 nchr++;
173 }
174 *src = s;
175 return (nchr);
176}
|