Line data    Source code

       1             : /*
       2             :  * Copyright (c) 2004 Kungliga Tekniska Högskolan
       3             :  * (Royal Institute of Technology, Stockholm, Sweden).
       4             :  * All rights reserved.
       5             :  *
       6             :  * Redistribution and use in source and binary forms, with or without
       7             :  * modification, are permitted provided that the following conditions
       8             :  * are met:
       9             :  *
      10             :  * 1. Redistributions of source code must retain the above copyright
      11             :  *    notice, this list of conditions and the following disclaimer.
      12             :  *
      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.
      16             :  *
      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.
      20             :  *
      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
      31             :  * SUCH DAMAGE.
      32             :  */
      33             : 
      34             : #include "windlocl.h"
      35             : 
      36             : #include <stdlib.h>
      37             : 
      38             : #include "bidi_table.h"
      39             : 
      40             : static int
      41           0 : range_entry_cmp(const void *a, const void *b)
      42             : {
      43           0 :     const struct range_entry *ea = (const struct range_entry*)a;
      44           0 :     const struct range_entry *eb = (const struct range_entry*)b;
      45             : 
      46           0 :     if (ea->start >= eb->start && ea->start < eb->start + eb->len)
      47           0 :         return 0;
      48           0 :     return ea->start - eb->start;
      49             : }
      50             : 
      51             : static int
      52           0 : is_ral(uint32_t cp)
      53             : {
      54           0 :     struct range_entry ee = {cp, 0};
      55           0 :     void *s = bsearch(&ee, _wind_ral_table, _wind_ral_table_size,
      56             :                       sizeof(_wind_ral_table[0]),
      57             :                       range_entry_cmp);
      58           0 :     return s != NULL;
      59             : }
      60             : 
      61             : static int
      62           0 : is_l(uint32_t cp)
      63             : {
      64           0 :     struct range_entry ee = {cp, 0};
      65           0 :     void *s = bsearch(&ee, _wind_l_table, _wind_l_table_size,
      66             :                       sizeof(_wind_l_table[0]),
      67             :                       range_entry_cmp);
      68           0 :     return s != NULL;
      69             : }
      70             : 
      71             : int
      72           0 : _wind_stringprep_testbidi(const uint32_t *in, size_t in_len, wind_profile_flags flags)
      73             : {
      74             :     size_t i;
      75           0 :     unsigned ral = 0;
      76           0 :     unsigned l   = 0;
      77             : 
      78           0 :     if ((flags & (WIND_PROFILE_NAME|WIND_PROFILE_SASL)) == 0)
      79           0 :         return 0;
      80             : 
      81           0 :     for (i = 0; i < in_len; ++i) {
      82           0 :         ral |= is_ral(in[i]);
      83           0 :         l   |= is_l(in[i]);
      84             :     }
      85           0 :     if (ral) {
      86           0 :         if (l)
      87           0 :             return 1;
      88           0 :         if (!is_ral(in[0]) || !is_ral(in[in_len - 1]))
      89           0 :             return 1;
      90             :     }
      91           0 :     return 0;
      92             : }