locale/ansi.c

   1 /*-
   2  * Copyright (c) 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Paul Borman at Krystal Technologies.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    notice, this list of conditions and the following disclaimer.
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  * 3. All advertising materials mentioning features or use of this software
  17  *    must display the following acknowledgement:
  18  *      This product includes software developed by the University of
  19  *      California, Berkeley and its contributors.
  20  * 4. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  */
  36
  37 #if defined(LIBC_SCCS) && !defined(lint)
  38 static char sccsid[] = "@(#)ansi.c      8.1 (Berkeley) 6/27/93";
  39 #endif /* LIBC_SCCS and not lint */
  40
  41 #include <stdlib.h>
  42 #include <limits.h>
  43 #include <stddef.h>
  44 #include <rune.h>
  45
  46 int
  47 mblen(s, n)
  48         const char *s;
  49         size_t n;
  50 {
  51         char const *e;
  52
  53         if (s == 0 || *s == 0)
  54                 return (0);     /* No support for state dependent encodings. */
  55
  56         if (sgetrune(s, n, &e) == _INVALID_RUNE)
  57                 return (s - e);
  58         return (e - s);
  59 }
  60
  61 int
  62 mbtowc(pwc, s, n)
  63         wchar_t *pwc;
  64         const char *s;
  65         size_t n;
  66 {
  67         char const *e;
  68         rune_t r;
  69
  70         if (s == 0 || *s == 0)
  71                 return (0);     /* No support for state dependent encodings. */
  72
  73         if ((r = sgetrune(s, n, &e)) == _INVALID_RUNE)
  74                 return (s - e);
  75         if (pwc)
  76                 *pwc = r;
  77         return (e - s);
  78 }
  79
  80 int
  81 wctomb(s, wchar)
  82         char *s;
  83         wchar_t wchar;
  84 {
  85         char *e;
  86
  87         if (s == 0)
  88                 return (0);     /* No support for state dependent encodings. */
  89
  90         if (wchar == 0) {
  91                 *s = 0;
  92                 return (1);
  93         }
  94
  95         sputrune(wchar, s, MB_CUR_MAX, &e);
  96         return (e ? e - s : -1);
  97 }
  98
  99 size_t
 100 mbstowcs(pwcs, s, n)
 101         wchar_t *pwcs;
 102         const char *s;
 103         size_t n;
 104 {
 105         char const *e;
 106         int cnt = 0;
 107
 108         if (!pwcs || !s)
 109                 return (-1);
 110
 111         while (n-- > 0) {
 112                 *pwcs = sgetrune(s, MB_LEN_MAX, &e);
 113                 if (*pwcs == _INVALID_RUNE)
 114                         return (-1);
 115                 if (*pwcs++ == 0)
 116                         break;
 117                 s = e;
 118                 ++cnt;
 119         }
 120         return (cnt);
 121 }
 122
 123 size_t
 124 wcstombs(s, pwcs, n)
 125         char *s;
 126         const wchar_t *pwcs;
 127         size_t n;
 128 {
 129         char *e;
 130         int cnt, nb;
 131
 132         if (!pwcs || !s || n > INT_MAX)
 133                 return (-1);
 134
 135         nb = n;
 136         cnt = 0;
 137         while (nb > 0) {
 138                 if (*pwcs == 0) {
 139                         *s = 0;
 140                         break;
 141                 }
 142                 if (!sputrune(*pwcs++, s, nb, &e))
 143                         return (-1);            /* encoding error */
 144                 if (!e)                 /* too long */
 145                         return (cnt);
 146                 cnt += e - s;
 147                 nb -= e - s;
 148                 s = e;
 149         }
 150         return (cnt);
 151 }