Coverage Report

Created: 2026-09-28 06:58

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