1 /* $NetBSD: bidi.c,v 1.1.1.1 2011/04/13 18:15:45 elric 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 #include "windlocl.h"
37
38 #include <stdlib.h>
39
40 #include "bidi_table.h"
41
42 static int
range_entry_cmp(const void * a,const void * b)43 range_entry_cmp(const void *a, const void *b)
44 {
45 const struct range_entry *ea = (const struct range_entry*)a;
46 const struct range_entry *eb = (const struct range_entry*)b;
47
48 if (ea->start >= eb->start && ea->start < eb->start + eb->len)
49 return 0;
50 return ea->start - eb->start;
51 }
52
53 static int
is_ral(uint32_t cp)54 is_ral(uint32_t cp)
55 {
56 struct range_entry ee = {cp};
57 void *s = bsearch(&ee, _wind_ral_table, _wind_ral_table_size,
58 sizeof(_wind_ral_table[0]),
59 range_entry_cmp);
60 return s != NULL;
61 }
62
63 static int
is_l(uint32_t cp)64 is_l(uint32_t cp)
65 {
66 struct range_entry ee = {cp};
67 void *s = bsearch(&ee, _wind_l_table, _wind_l_table_size,
68 sizeof(_wind_l_table[0]),
69 range_entry_cmp);
70 return s != NULL;
71 }
72
73 int
_wind_stringprep_testbidi(const uint32_t * in,size_t in_len,wind_profile_flags flags)74 _wind_stringprep_testbidi(const uint32_t *in, size_t in_len, wind_profile_flags flags)
75 {
76 size_t i;
77 unsigned ral = 0;
78 unsigned l = 0;
79
80 if ((flags & (WIND_PROFILE_NAME|WIND_PROFILE_SASL)) == 0)
81 return 0;
82
83 for (i = 0; i < in_len; ++i) {
84 ral |= is_ral(in[i]);
85 l |= is_l(in[i]);
86 }
87 if (ral) {
88 if (l)
89 return 1;
90 if (!is_ral(in[0]) || !is_ral(in[in_len - 1]))
91 return 1;
92 }
93 return 0;
94 }
95