Home | History | Annotate | Line # | Download | only in locale
      1  1.17   tnozaki /*	$NetBSD: _wctrans.c,v 1.17 2010/06/13 04:14:57 tnozaki Exp $	*/
      2   1.1  tshiozak 
      3   1.1  tshiozak /*-
      4   1.1  tshiozak  * Copyright (c)2003 Citrus Project,
      5   1.1  tshiozak  * All rights reserved.
      6   1.1  tshiozak  *
      7   1.1  tshiozak  * Redistribution and use in source and binary forms, with or without
      8   1.1  tshiozak  * modification, are permitted provided that the following conditions
      9   1.1  tshiozak  * are met:
     10   1.1  tshiozak  * 1. Redistributions of source code must retain the above copyright
     11   1.1  tshiozak  *    notice, this list of conditions and the following disclaimer.
     12   1.1  tshiozak  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1  tshiozak  *    notice, this list of conditions and the following disclaimer in the
     14   1.1  tshiozak  *    documentation and/or other materials provided with the distribution.
     15   1.1  tshiozak  *
     16   1.1  tshiozak  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
     17   1.1  tshiozak  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     18   1.1  tshiozak  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     19   1.1  tshiozak  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
     20   1.1  tshiozak  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     21   1.1  tshiozak  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     22   1.1  tshiozak  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     23   1.1  tshiozak  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     24   1.1  tshiozak  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     25   1.1  tshiozak  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     26   1.1  tshiozak  * SUCH DAMAGE.
     27   1.1  tshiozak  */
     28   1.1  tshiozak 
     29   1.1  tshiozak /*-
     30   1.1  tshiozak  * Copyright (c) 1993
     31   1.1  tshiozak  *	The Regents of the University of California.  All rights reserved.
     32   1.1  tshiozak  *
     33   1.1  tshiozak  * This code is derived from software contributed to Berkeley by
     34   1.1  tshiozak  * Paul Borman at Krystal Technologies.
     35   1.1  tshiozak  *
     36   1.1  tshiozak  * Redistribution and use in source and binary forms, with or without
     37   1.1  tshiozak  * modification, are permitted provided that the following conditions
     38   1.1  tshiozak  * are met:
     39   1.1  tshiozak  * 1. Redistributions of source code must retain the above copyright
     40   1.1  tshiozak  *    notice, this list of conditions and the following disclaimer.
     41   1.1  tshiozak  * 2. Redistributions in binary form must reproduce the above copyright
     42   1.1  tshiozak  *    notice, this list of conditions and the following disclaimer in the
     43   1.1  tshiozak  *    documentation and/or other materials provided with the distribution.
     44   1.5       agc  * 3. Neither the name of the University nor the names of its contributors
     45   1.1  tshiozak  *    may be used to endorse or promote products derived from this software
     46   1.1  tshiozak  *    without specific prior written permission.
     47   1.1  tshiozak  *
     48   1.1  tshiozak  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     49   1.1  tshiozak  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     50   1.1  tshiozak  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     51   1.1  tshiozak  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     52   1.1  tshiozak  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     53   1.1  tshiozak  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     54   1.1  tshiozak  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     55   1.1  tshiozak  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     56   1.1  tshiozak  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     57   1.1  tshiozak  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     58   1.1  tshiozak  * SUCH DAMAGE.
     59   1.1  tshiozak  */
     60   1.1  tshiozak 
     61   1.1  tshiozak #include <sys/cdefs.h>
     62   1.1  tshiozak #if defined(LIBC_SCCS) && !defined(lint)
     63  1.17   tnozaki __RCSID("$NetBSD: _wctrans.c,v 1.17 2010/06/13 04:14:57 tnozaki Exp $");
     64   1.1  tshiozak #endif /* LIBC_SCCS and not lint */
     65   1.1  tshiozak 
     66   1.1  tshiozak #include "namespace.h"
     67   1.1  tshiozak 
     68  1.15   tnozaki #include <sys/types.h>
     69  1.13   tnozaki #include <assert.h>
     70   1.1  tshiozak #include <wctype.h>
     71  1.15   tnozaki 
     72  1.17   tnozaki #include "runetype_local.h"
     73   1.1  tshiozak #include "_wctrans_local.h"
     74   1.1  tshiozak 
     75   1.1  tshiozak /*
     76   1.7   tnozaki  * _towctrans_ext:
     77   1.1  tshiozak  *	translate a character (extended part)
     78   1.1  tshiozak  */
     79   1.1  tshiozak wint_t
     80  1.16   tnozaki _towctrans_ext(wint_t c, struct _WCTransEntry const *te)
     81   1.1  tshiozak {
     82   1.6   tnozaki 	__nbrune_t c0;
     83   1.1  tshiozak 	uint32_t x;
     84   1.6   tnozaki 	_RuneRange *rr;
     85   1.6   tnozaki 	_RuneEntry *base, *re;
     86   1.1  tshiozak 
     87  1.15   tnozaki 	_DIAGASSERT(te != NULL);
     88  1.15   tnozaki 
     89   1.4  tshiozak 	if (c == WEOF)
     90   1.6   tnozaki 		return (c);
     91   1.1  tshiozak 
     92   1.6   tnozaki 	c0 = (__nbrune_t)c; /* XXX assumes wchar_t = int */
     93   1.6   tnozaki 	rr = te->te_extmap;
     94   1.6   tnozaki 	base = rr->rr_rune_ranges;
     95   1.6   tnozaki 	for (x = rr->rr_nranges; x != 0; x >>= 1) {
     96   1.6   tnozaki 		re = base + (x >> 1);
     97   1.6   tnozaki 		if (re->re_min <= c0 && re->re_max >= c0)
     98   1.6   tnozaki 			return (re->re_map + c0 - re->re_min);
     99   1.6   tnozaki 		else if (c0 >= re->re_max) {
    100   1.6   tnozaki 			base = re + 1;
    101   1.6   tnozaki 			x--;
    102   1.6   tnozaki 		}
    103   1.1  tshiozak 	}
    104   1.6   tnozaki 
    105   1.6   tnozaki 	return (c);
    106   1.1  tshiozak }
    107