locale.subproj/utf2.c

   1 /*
   2  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_HEADER_START@
   5  *
   6  * The contents of this file constitute Original Code as defined in and
   7  * are subject to the Apple Public Source License Version 1.1 (the
   8  * "License").  You may not use this file except in compliance with the
   9  * License.  Please obtain a copy of the License at
  10  * http://www.apple.com/publicsource and read it before using this file.
  11  *
  12  * This Original Code and all software distributed under the License are
  13  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  14  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  15  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  16  * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
  17  * License for the specific language governing rights and limitations
  18  * under the License.
  19  *
  20  * @APPLE_LICENSE_HEADER_END@
  21  */
  22 /*
  23  * Copyright (c) 1993
  24  *      The Regents of the University of California.  All rights reserved.
  25  *
  26  * This code is derived from software contributed to Berkeley by
  27  * Paul Borman at Krystal Technologies.
  28  *
  29  * Redistribution and use in source and binary forms, with or without
  30  * modification, are permitted provided that the following conditions
  31  * are met:
  32  * 1. Redistributions of source code must retain the above copyright
  33  *    notice, this list of conditions and the following disclaimer.
  34  * 2. Redistributions in binary form must reproduce the above copyright
  35  *    notice, this list of conditions and the following disclaimer in the
  36  *    documentation and/or other materials provided with the distribution.
  37  * 3. All advertising materials mentioning features or use of this software
  38  *    must display the following acknowledgement:
  39  *      This product includes software developed by the University of
  40  *      California, Berkeley and its contributors.
  41  * 4. Neither the name of the University nor the names of its contributors
  42  *    may be used to endorse or promote products derived from this software
  43  *    without specific prior written permission.
  44  *
  45  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  46  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  47  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  48  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  49  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  50  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  51  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  52  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  53  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  54  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  55  * SUCH DAMAGE.
  56  */
  57
  58
  59 #include <errno.h>
  60 #include <rune.h>
  61 #include <stddef.h>
  62 #include <stdio.h>
  63 #include <stdlib.h>
  64
  65 rune_t  _UTF2_sgetrune __P((const char *, size_t, char const **));
  66 int     _UTF2_sputrune __P((rune_t, char *, size_t, char **));
  67
  68 static _utf_count[16] = {
  69         1, 1, 1, 1, 1, 1, 1, 1,
  70         0, 0, 0, 0, 2, 2, 3, 0,
  71 };
  72
  73 int
  74 _UTF2_init(rl)
  75         _RuneLocale *rl;
  76 {
  77         rl->sgetrune = _UTF2_sgetrune;
  78         rl->sputrune = _UTF2_sputrune;
  79         _CurrentRuneLocale = rl;
  80         __mb_cur_max = 3;
  81         return (0);
  82 }
  83
  84 rune_t
  85 _UTF2_sgetrune(string, n, result)
  86         const char *string;
  87         size_t n;
  88         char const **result;
  89 {
  90         int c;
  91
  92         if (n < 1 || (c = _utf_count[(*string >> 4) & 0xf]) > n) {
  93                 if (result)
  94                         *result = string;
  95                 return (_INVALID_RUNE);
  96         }
  97         switch (c) {
  98         case 1:
  99                 if (result)
 100                         *result = string + 1;
 101                 return (*string & 0xff);
 102         case 2:
 103                 if ((string[1] & 0xC0) != 0x80)
 104                         goto encoding_error;
 105                 if (result)
 106                         *result = string + 2;
 107                 return (((string[0] & 0x1F) << 6) | (string[1] & 0x3F));
 108         case 3:
 109                 if ((string[1] & 0xC0) != 0x80 || (string[2] & 0xC0) != 0x80)
 110                         goto encoding_error;
 111                 if (result)
 112                         *result = string + 3;
 113                 return (((string[0] & 0x1F) << 12) | ((string[1] & 0x3F) << 6)
 114                     | (string[2] & 0x3F));
 115         default:
 116 encoding_error: if (result)
 117                         *result = string + 1;
 118                 return (_INVALID_RUNE);
 119         }
 120 }
 121
 122 int
 123 _UTF2_sputrune(c, string, n, result)
 124         rune_t c;
 125         char *string, **result;
 126         size_t n;
 127 {
 128         if (c & 0xF800) {
 129                 if (n >= 3) {
 130                         if (string) {
 131                                 string[0] = 0xE0 | ((c >> 12) & 0x0F);
 132                                 string[1] = 0x80 | ((c >> 6) & 0x3F);
 133                                 string[2] = 0x80 | ((c) & 0x3F);
 134                         }
 135                         if (result)
 136                                 *result = string + 3;
 137                 } else
 138                         if (result)
 139                                 *result = NULL;
 140
 141                 return (3);
 142         } else
 143                 if (c & 0x0780) {
 144                         if (n >= 2) {
 145                                 if (string) {
 146                                         string[0] = 0xC0 | ((c >> 6) & 0x1F);
 147                                         string[1] = 0x80 | ((c) & 0x3F);
 148                                 }
 149                                 if (result)
 150                                         *result = string + 2;
 151                         } else
 152                                 if (result)
 153                                         *result = NULL;
 154                         return (2);
 155                 } else {
 156                         if (n >= 1) {
 157                                 if (string)
 158                                         string[0] = c;
 159                                 if (result)
 160                                         *result = string + 1;
 161                         } else
 162                                 if (result)
 163                                         *result = NULL;
 164                         return (1);
 165                 }
 166 }