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