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