2 * Copyright (c) 2004 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
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.
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
38 #include "bidi_table.h"
41 range_entry_cmp(const void *a, const void *b)
43 const struct range_entry *ea = (const struct range_entry*)a;
44 const struct range_entry *eb = (const struct range_entry*)b;
46 if (ea->start >= eb->start && ea->start < eb->start + eb->len)
48 return ea->start - eb->start;
54 struct range_entry ee = {cp};
55 void *s = bsearch(&ee, _wind_ral_table, _wind_ral_table_size,
56 sizeof(_wind_ral_table[0]),
64 struct range_entry ee = {cp};
65 void *s = bsearch(&ee, _wind_l_table, _wind_l_table_size,
66 sizeof(_wind_l_table[0]),
72 _wind_stringprep_testbidi(const uint32_t *in, size_t in_len, wind_profile_flags flags)
78 if ((flags & (WIND_PROFILE_NAME|WIND_PROFILE_SASL)) == 0)
81 for (i = 0; i < in_len; ++i) {
88 if (!is_ral(in[0]) || !is_ral(in[in_len - 1]))