/* * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * The contents of this file constitute Original Code as defined in and * are subject to the Apple Public Source License Version 1.1 (the * "License"). You may not use this file except in compliance with the * License. Please obtain a copy of the License at * http://www.apple.com/publicsource and read it before using this file. * * This Original Code and all software distributed under the License are * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the * License for the specific language governing rights and limitations * under the License. * * @APPLE_LICENSE_HEADER_END@ */ /* * Copyright (c) 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * Paul Borman at Krystal Technologies. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include <stdlib.h> #include <limits.h> #include <stddef.h> #include <rune.h> int mblen(s, n) const char *s; size_t n; { char const *e; if (s == 0 || *s == 0) return (0); /* No support for state dependent encodings. */ if (sgetrune(s, (int)n, &e) == _INVALID_RUNE) return (s - e); return (e - s); } int mbtowc(pwc, s, n) wchar_t *pwc; const char *s; size_t n; { char const *e; rune_t r; if (s == 0 || *s == 0) return (0); /* No support for state dependent encodings. */ if ((r = sgetrune(s, (int)n, &e)) == _INVALID_RUNE) return (s - e); if (pwc) *pwc = r; return (e - s); } int wctomb(s, wchar) char *s; wchar_t wchar; { char *e; if (s == 0) return (0); /* No support for state dependent encodings. */ if (wchar == 0) { *s = 0; return (1); } sputrune(wchar, s, MB_CUR_MAX, &e); return (e ? e - s : -1); } size_t mbstowcs(pwcs, s, n) wchar_t *pwcs; const char *s; size_t n; { char const *e; int cnt = 0; if (!pwcs || !s) return (-1); while (n-- > 0) { *pwcs = sgetrune(s, MB_LEN_MAX, &e); if (*pwcs == _INVALID_RUNE) return (-1); if (*pwcs++ == 0) break; s = e; ++cnt; } return (cnt); } size_t wcstombs(s, pwcs, n) char *s; const wchar_t *pwcs; size_t n; { char *e; int cnt = 0; if (!pwcs || !s) return (-1); while (n > 0) { if (*pwcs == 0) { *s = 0; break; } if (!sputrune(*pwcs++, s, (int)n, &e)) return (-1); /* encoding error */ if (!e) /* too long */ return (cnt); cnt += e - s; s = e; } return (cnt); }