Coverage Report

Created: 2025-11-02 07:14

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