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