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