Libc-262.tar.gz

[apple/libc.git] / locale / ansi.c

diff --git a/locale/ansi.c b/locale/ansi.c
new file mode 100644 (file)
index 0000000..c0871fe
--- /dev/null
+++ b/locale/ansi.c
@@ -0,0 +1,151 @@
+/*-
+ * 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.
+ */
+
+#if defined(LIBC_SCCS) && !defined(lint)
+static char sccsid[] = "@(#)ansi.c     8.1 (Berkeley) 6/27/93";
+#endif /* LIBC_SCCS and not lint */
+
+#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, 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, 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, nb;
+
+       if (!pwcs || !s || n > INT_MAX)
+               return (-1);
+
+       nb = n;
+       cnt = 0;
+       while (nb > 0) {
+               if (*pwcs == 0) {
+                       *s = 0;
+                       break;
+               }
+               if (!sputrune(*pwcs++, s, nb, &e))
+                       return (-1);            /* encoding error */
+               if (!e)                 /* too long */
+                       return (cnt);
+               cnt += e - s;
+               nb -= e - s;
+               s = e;
+       }
+       return (cnt);
+}