Coverage Report

Created: 2025-11-24 06:19

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