Coverage Report

Created: 2025-12-12 07:21

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-2025 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
2.26M
{
43
3.26M
  for (; (ssize_t) llen > 0; llen--)
44
2.37M
    {
45
2.37M
      int bc = uc_bidi_category (*label++);
46
47
2.37M
      if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_AN)
48
1.36M
  return 1;
49
2.37M
    }
50
51
897k
  return 0;
52
2.26M
}
53
54
/* IDNA2008 BIDI check (RFC 5893) */
55
int
56
_idn2_bidi (const uint32_t *label, size_t llen)
57
2.26M
{
58
2.26M
  int bc;
59
2.26M
  int endok = 1;
60
61
2.26M
  if (!_isBidi (label, llen))
62
897k
    return IDN2_OK;
63
64
  // 2.1
65
1.36M
  switch ((bc = uc_bidi_category (*label)))
66
1.36M
    {
67
2.60k
    case UC_BIDI_L:
68
      // check 2.5 & 2.6
69
6.29k
      for (size_t it = 1; it < llen; it++)
70
6.29k
  {
71
6.29k
    bc = uc_bidi_category (label[it]);
72
73
6.29k
    if (bc == UC_BIDI_L || bc == UC_BIDI_EN || bc == UC_BIDI_NSM)
74
2.15k
      {
75
2.15k
        endok = 1;
76
2.15k
      }
77
4.14k
    else
78
4.14k
      {
79
4.14k
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
80
3.51k
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
81
2.60k
    {
82
      /* printf("LTR label contains invalid code point\n"); */
83
2.60k
      return IDN2_BIDI;
84
2.60k
    }
85
1.53k
        endok = 0;
86
1.53k
      }
87
6.29k
  }
88
      /* printf("LTR label ends with invalid code point\n"); */
89
0
      return endok ? IDN2_OK : IDN2_BIDI;
90
91
123k
    case UC_BIDI_R:
92
1.36M
    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.51M
      for (size_t it = 1; it < llen; it++)
96
162k
  {
97
162k
    bc = uc_bidi_category (label[it]);
98
99
    /* printf("Label[%d]=%04X: %s\n", (int) it, label[it], uc_bidi_category_name(bc)); */
100
162k
    if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_EN
101
7.81k
        || bc == UC_BIDI_AN || bc == UC_BIDI_NSM)
102
154k
      {
103
154k
        endok = 1;
104
154k
      }
105
7.36k
    else
106
7.36k
      {
107
7.36k
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
108
5.19k
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
109
3.43k
    {
110
      /* printf("RTL label contains invalid code point\n"); */
111
3.43k
      return IDN2_BIDI;
112
3.43k
    }
113
3.93k
        endok = 0;
114
3.93k
      }
115
162k
  }
116
      /* printf("RTL label ends with invalid code point\n"); */
117
1.35M
      return endok ? IDN2_OK : IDN2_BIDI;
118
119
1.58k
    default:
120
      /* printf("Label begins with invalid BIDI class %s\n", uc_bidi_category_name(bc)); */
121
1.58k
      return IDN2_BIDI;
122
1.36M
    }
123
1.36M
}