Coverage Report

Created: 2026-06-08 06:48

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.08k
{
43
18.3k
  for (; (ssize_t) llen > 0; llen--)
44
16.9k
    {
45
16.9k
      int bc = uc_bidi_category (*label++);
46
47
16.9k
      if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_AN)
48
686
  return 1;
49
16.9k
    }
50
51
1.39k
  return 0;
52
2.08k
}
53
54
/* IDNA2008 BIDI check (RFC 5893) */
55
int
56
_idn2_bidi (const uint32_t *label, size_t llen)
57
2.08k
{
58
2.08k
  int bc;
59
2.08k
  int endok = 1;
60
61
2.08k
  if (!_isBidi (label, llen))
62
1.39k
    return IDN2_OK;
63
64
  // 2.1
65
686
  switch ((bc = uc_bidi_category (*label)))
66
686
    {
67
67
    case UC_BIDI_L:
68
      // check 2.5 & 2.6
69
1.81k
      for (size_t it = 1; it < llen; it++)
70
1.81k
  {
71
1.81k
    bc = uc_bidi_category (label[it]);
72
73
1.81k
    if (bc == UC_BIDI_L || bc == UC_BIDI_EN || bc == UC_BIDI_NSM)
74
1.33k
      {
75
1.33k
        endok = 1;
76
1.33k
      }
77
472
    else
78
472
      {
79
472
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
80
263
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
81
67
    {
82
      /* printf("LTR label contains invalid code point\n"); */
83
67
      return IDN2_BIDI;
84
67
    }
85
405
        endok = 0;
86
405
      }
87
1.81k
  }
88
      /* printf("LTR label ends with invalid code point\n"); */
89
0
      return endok ? IDN2_OK : IDN2_BIDI;
90
91
200
    case UC_BIDI_R:
92
545
    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.65k
      for (size_t it = 1; it < llen; it++)
96
4.11k
  {
97
4.11k
    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.11k
    if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_EN
101
2.16k
        || bc == UC_BIDI_AN || bc == UC_BIDI_NSM)
102
3.57k
      {
103
3.57k
        endok = 1;
104
3.57k
      }
105
535
    else
106
535
      {
107
535
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
108
328
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
109
7
    {
110
      /* printf("RTL label contains invalid code point\n"); */
111
7
      return IDN2_BIDI;
112
7
    }
113
528
        endok = 0;
114
528
      }
115
4.11k
  }
116
      /* printf("RTL label ends with invalid code point\n"); */
117
538
      return endok ? IDN2_OK : IDN2_BIDI;
118
119
74
    default:
120
      /* printf("Label begins with invalid BIDI class %s\n", uc_bidi_category_name(bc)); */
121
74
      return IDN2_BIDI;
122
686
    }
123
686
}