Coverage Report

Created: 2026-10-14 06:53

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