1 /* $NetBSD: map.c,v 1.2 2017/01/28 21:31:50 christos Exp $ */
2
3 /*
4 * Copyright (c) 2004 Kungliga Tekniska Högskolan
5 * (Royal Institute of Technology, Stockholm, Sweden).
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 *
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.
18 *
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.
22 *
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
33 * SUCH DAMAGE.
34 */
35
36 #ifdef HAVE_CONFIG_H
37 #include <config.h>
38 #endif
39 #include "windlocl.h"
40
41 #include <stdlib.h>
42
43 #include "map_table.h"
44
45 static int
translation_cmp(const void * key,const void * data)46 translation_cmp(const void *key, const void *data)
47 {
48 const struct translation *t1 = (const struct translation *)key;
49 const struct translation *t2 = (const struct translation *)data;
50
51 return t1->key - t2->key;
52 }
53
54 int
_wind_stringprep_map(const uint32_t * in,size_t in_len,uint32_t * out,size_t * out_len,wind_profile_flags flags)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)
58 {
59 unsigned i;
60 unsigned o = 0;
61
62 for (i = 0; i < in_len; ++i) {
63 struct translation ts = {in[i], 0, 0, 0};
64 const struct translation *s;
65
66 s = (const struct translation *)
67 bsearch(&ts, _wind_map_table, _wind_map_table_size,
68 sizeof(_wind_map_table[0]),
69 translation_cmp);
70 if (s != NULL && (s->flags & flags)) {
71 unsigned j;
72
73 for (j = 0; j < s->val_len; ++j) {
74 if (o >= *out_len)
75 return WIND_ERR_OVERRUN;
76 out[o++] = _wind_map_table_val[s->val_offset + j];
77 }
78 } else {
79 if (o >= *out_len)
80 return WIND_ERR_OVERRUN;
81 out[o++] = in[i];
82
83 }
84 }
85 *out_len = o;
86 return 0;
87 }
88