1 /* $NetBSD: map.c,v 1.1.1.1 2011/04/13 18:15:58 elric Exp $ */
4 * Copyright (c) 2004 Kungliga Tekniska Högskolan
5 * (Royal Institute of Technology, Stockholm, Sweden).
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the Institute nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 #include "map_table.h"
46 translation_cmp(const void *key
, const void *data
)
48 const struct translation
*t1
= (const struct translation
*)key
;
49 const struct translation
*t2
= (const struct translation
*)data
;
51 return t1
->key
- t2
->key
;
55 _wind_stringprep_map(const uint32_t *in
, size_t in_len
,
56 uint32_t *out
, size_t *out_len
,
57 wind_profile_flags flags
)
62 for (i
= 0; i
< in_len
; ++i
) {
63 struct translation ts
= {in
[i
]};
64 const struct translation
*s
;
66 s
= (const struct translation
*)
67 bsearch(&ts
, _wind_map_table
, _wind_map_table_size
,
68 sizeof(_wind_map_table
[0]),
70 if (s
!= NULL
&& (s
->flags
& flags
)) {
73 for (j
= 0; j
< s
->val_len
; ++j
) {
75 return WIND_ERR_OVERRUN
;
76 out
[o
++] = _wind_map_table_val
[s
->val_offset
+ j
];
80 return WIND_ERR_OVERRUN
;