Coverage Report

Created: 2025-11-16 06:28

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
23.1k
{
43
147k
  for (; (ssize_t) llen > 0; llen--)
44
131k
    {
45
131k
      int bc = uc_bidi_category (*label++);
46
47
131k
      if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_AN)
48
7.36k
  return 1;
49
131k
    }
50
51
15.7k
  return 0;
52
23.1k
}
53
54
/* IDNA2008 BIDI check (RFC 5893) */
55
int
56
_idn2_bidi (const uint32_t *label, size_t llen)
57
23.1k
{
58
23.1k
  int bc;
59
23.1k
  int endok = 1;
60
61
23.1k
  if (!_isBidi (label, llen))
62
15.7k
    return IDN2_OK;
63
64
  // 2.1
65
7.36k
  switch ((bc = uc_bidi_category (*label)))
66
7.36k
    {
67
1.30k
    case UC_BIDI_L:
68
      // check 2.5 & 2.6
69
9.97k
      for (size_t it = 1; it < llen; it++)
70
9.97k
  {
71
9.97k
    bc = uc_bidi_category (label[it]);
72
73
9.97k
    if (bc == UC_BIDI_L || bc == UC_BIDI_EN || bc == UC_BIDI_NSM)
74
7.28k
      {
75
7.28k
        endok = 1;
76
7.28k
      }
77
2.69k
    else
78
2.69k
      {
79
2.69k
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
80
1.91k
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
81
1.30k
    {
82
      /* printf("LTR label contains invalid code point\n"); */
83
1.30k
      return IDN2_BIDI;
84
1.30k
    }
85
1.39k
        endok = 0;
86
1.39k
      }
87
9.97k
  }
88
      /* printf("LTR label ends with invalid code point\n"); */
89
0
      return endok ? IDN2_OK : IDN2_BIDI;
90
91
1.41k
    case UC_BIDI_R:
92
4.51k
    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.6k
      for (size_t it = 1; it < llen; it++)
96
11.8k
  {
97
11.8k
    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.8k
    if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_EN
101
4.31k
        || bc == UC_BIDI_AN || bc == UC_BIDI_NSM)
102
9.30k
      {
103
9.30k
        endok = 1;
104
9.30k
      }
105
2.56k
    else
106
2.56k
      {
107
2.56k
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
108
1.90k
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
109
775
    {
110
      /* printf("RTL label contains invalid code point\n"); */
111
775
      return IDN2_BIDI;
112
775
    }
113
1.79k
        endok = 0;
114
1.79k
      }
115
11.8k
  }
116
      /* printf("RTL label ends with invalid code point\n"); */
117
3.73k
      return endok ? IDN2_OK : IDN2_BIDI;
118
119
1.55k
    default:
120
      /* printf("Label begins with invalid BIDI class %s\n", uc_bidi_category_name(bc)); */
121
1.55k
      return IDN2_BIDI;
122
7.36k
    }
123
7.36k
}