Coverage Report

Created: 2026-08-28 06:46

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/libidn2/lib/bidi.c
Line
Count
Source
1
/* bidi.c - IDNA right to left checking functions
2
   Copyright (C) 2011-2026 Simon Josefsson
3
4
   Libidn2 is free software: you can redistribute it and/or modify it
5
   under the terms of either:
6
7
     * the GNU Lesser General Public License as published by the Free
8
       Software Foundation; either version 3 of the License, or (at
9
       your option) any later version.
10
11
   or
12
13
     * the GNU General Public License as published by the Free
14
       Software Foundation; either version 2 of the License, or (at
15
       your option) any later version.
16
17
   or both in parallel, as here.
18
19
   This program is distributed in the hope that it will be useful,
20
   but WITHOUT ANY WARRANTY; without even the implied warranty of
21
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
22
   GNU General Public License for more details.
23
24
   You should have received copies of the GNU General Public License and
25
   the GNU Lesser General Public License along with this program.  If
26
   not, see <http://www.gnu.org/licenses/>.
27
*/
28
29
#include <config.h>
30
31
#include "idn2.h"
32
33
#include <sys/types.h>
34
#include <stdbool.h>
35
36
#include "bidi.h"
37
38
#include <unictype.h>
39
40
static bool
41
_isBidi (const uint32_t *label, size_t llen)
42
1.57M
{
43
2.31M
  for (; (ssize_t) llen > 0; llen--)
44
1.67M
    {
45
1.67M
      int bc = uc_bidi_category (*label++);
46
47
1.67M
      if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_AN)
48
930k
  return 1;
49
1.67M
    }
50
51
642k
  return 0;
52
1.57M
}
53
54
/* IDNA2008 BIDI check (RFC 5893) */
55
int
56
_idn2_bidi (const uint32_t *label, size_t llen)
57
1.57M
{
58
1.57M
  int bc;
59
1.57M
  int endok = 1;
60
61
1.57M
  if (!_isBidi (label, llen))
62
642k
    return IDN2_OK;
63
64
  // 2.1
65
930k
  switch ((bc = uc_bidi_category (*label)))
66
930k
    {
67
2.04k
    case UC_BIDI_L:
68
      // check 2.5 & 2.6
69
4.96k
      for (size_t it = 1; it < llen; it++)
70
4.96k
  {
71
4.96k
    bc = uc_bidi_category (label[it]);
72
73
4.96k
    if (bc == UC_BIDI_L || bc == UC_BIDI_EN || bc == UC_BIDI_NSM)
74
1.61k
      {
75
1.61k
        endok = 1;
76
1.61k
      }
77
3.34k
    else
78
3.34k
      {
79
3.34k
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
80
2.69k
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
81
2.04k
    {
82
      /* printf("LTR label contains invalid code point\n"); */
83
2.04k
      return IDN2_BIDI;
84
2.04k
    }
85
1.29k
        endok = 0;
86
1.29k
      }
87
4.96k
  }
88
      /* printf("LTR label ends with invalid code point\n"); */
89
0
      return endok ? IDN2_OK : IDN2_BIDI;
90
91
81.4k
    case UC_BIDI_R:
92
927k
    case UC_BIDI_AL:
93
      // check 2.2, 2.3, 2.4
94
      /* printf("Label[0]=%04X: %s\n", label[0], uc_bidi_category_name(bc)); */
95
1.03M
      for (size_t it = 1; it < llen; it++)
96
113k
  {
97
113k
    bc = uc_bidi_category (label[it]);
98
99
    /* printf("Label[%d]=%04X: %s\n", (int) it, label[it], uc_bidi_category_name(bc)); */
100
113k
    if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_EN
101
5.19k
        || bc == UC_BIDI_AN || bc == UC_BIDI_NSM)
102
108k
      {
103
108k
        endok = 1;
104
108k
      }
105
4.76k
    else
106
4.76k
      {
107
4.76k
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
108
3.31k
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
109
1.66k
    {
110
      /* printf("RTL label contains invalid code point\n"); */
111
1.66k
      return IDN2_BIDI;
112
1.66k
    }
113
3.10k
        endok = 0;
114
3.10k
      }
115
113k
  }
116
      /* printf("RTL label ends with invalid code point\n"); */
117
925k
      return endok ? IDN2_OK : IDN2_BIDI;
118
119
1.30k
    default:
120
      /* printf("Label begins with invalid BIDI class %s\n", uc_bidi_category_name(bc)); */
121
1.30k
      return IDN2_BIDI;
122
930k
    }
123
930k
}