Coverage Report

Created: 2025-11-09 06:32

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