_wctrans.c revision 1.1 1 1.1 tshiozak /* $NetBSD: _wctrans.c,v 1.1 2003/03/02 22:18:13 tshiozak 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.1 tshiozak * 3. All advertising materials mentioning features or use of this software
45 1.1 tshiozak * must display the following acknowledgement:
46 1.1 tshiozak * This product includes software developed by the University of
47 1.1 tshiozak * California, Berkeley and its contributors.
48 1.1 tshiozak * 4. Neither the name of the University nor the names of its contributors
49 1.1 tshiozak * may be used to endorse or promote products derived from this software
50 1.1 tshiozak * without specific prior written permission.
51 1.1 tshiozak *
52 1.1 tshiozak * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53 1.1 tshiozak * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54 1.1 tshiozak * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55 1.1 tshiozak * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56 1.1 tshiozak * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57 1.1 tshiozak * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58 1.1 tshiozak * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59 1.1 tshiozak * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60 1.1 tshiozak * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61 1.1 tshiozak * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 1.1 tshiozak * SUCH DAMAGE.
63 1.1 tshiozak */
64 1.1 tshiozak
65 1.1 tshiozak #include <sys/cdefs.h>
66 1.1 tshiozak #if defined(LIBC_SCCS) && !defined(lint)
67 1.1 tshiozak __RCSID("$NetBSD: _wctrans.c,v 1.1 2003/03/02 22:18:13 tshiozak Exp $");
68 1.1 tshiozak #endif /* LIBC_SCCS and not lint */
69 1.1 tshiozak
70 1.1 tshiozak #include "namespace.h"
71 1.1 tshiozak
72 1.1 tshiozak #include <wctype.h>
73 1.1 tshiozak #include <stdlib.h>
74 1.1 tshiozak #include <string.h>
75 1.1 tshiozak #include "rune.h"
76 1.1 tshiozak #include "runetype.h"
77 1.1 tshiozak #include "rune_local.h"
78 1.1 tshiozak #include "_wctrans_local.h"
79 1.1 tshiozak
80 1.1 tshiozak /*
81 1.1 tshiozak * _wctrans_init:
82 1.1 tshiozak */
83 1.1 tshiozak
84 1.1 tshiozak void
85 1.1 tshiozak _wctrans_init(_RuneLocale *rl)
86 1.1 tshiozak {
87 1.1 tshiozak rl->rl_wctrans[_WCTRANS_INDEX_LOWER].te_name = "tolower";
88 1.1 tshiozak rl->rl_wctrans[_WCTRANS_INDEX_LOWER].te_cached = rl->rl_maplower;
89 1.1 tshiozak rl->rl_wctrans[_WCTRANS_INDEX_LOWER].te_extmap = &rl->rl_maplower_ext;
90 1.1 tshiozak rl->rl_wctrans[_WCTRANS_INDEX_UPPER].te_name = "toupper";
91 1.1 tshiozak rl->rl_wctrans[_WCTRANS_INDEX_UPPER].te_cached = rl->rl_mapupper;
92 1.1 tshiozak rl->rl_wctrans[_WCTRANS_INDEX_UPPER].te_extmap = &rl->rl_mapupper_ext;
93 1.1 tshiozak }
94 1.1 tshiozak
95 1.1 tshiozak /*
96 1.1 tshiozak * _wctrans_ext:
97 1.1 tshiozak * translate a character (extended part)
98 1.1 tshiozak */
99 1.1 tshiozak wint_t
100 1.1 tshiozak _towctrans_ext(wint_t c, struct _WCTransEntry *te)
101 1.1 tshiozak {
102 1.1 tshiozak uint32_t x;
103 1.1 tshiozak _RuneRange *rr = te->te_extmap;
104 1.1 tshiozak _RuneEntry *re = rr->rr_rune_ranges;
105 1.1 tshiozak
106 1.1 tshiozak if (c < 0 || c == EOF)
107 1.1 tshiozak return(c);
108 1.1 tshiozak
109 1.1 tshiozak for (x = 0; x < rr->rr_nranges; ++x, ++re) {
110 1.1 tshiozak if (c < re->re_min)
111 1.1 tshiozak return(c);
112 1.1 tshiozak if (c <= re->re_max)
113 1.1 tshiozak return(re->re_map + c - re->re_min);
114 1.1 tshiozak }
115 1.1 tshiozak return(c);
116 1.1 tshiozak }
117