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