Coverage Report

Created: 2026-01-10 06:17

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