Coverage Report

Created: 2026-08-17 07:06

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-2026 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.8k
{
43
65.5k
  for (; (ssize_t) llen > 0; llen--)
44
58.6k
    {
45
58.6k
      int bc = uc_bidi_category (*label++);
46
47
58.6k
      if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_AN)
48
3.91k
  return 1;
49
58.6k
    }
50
51
6.97k
  return 0;
52
10.8k
}
53
54
/* IDNA2008 BIDI check (RFC 5893) */
55
int
56
_idn2_bidi (const uint32_t *label, size_t llen)
57
10.8k
{
58
10.8k
  int bc;
59
10.8k
  int endok = 1;
60
61
10.8k
  if (!_isBidi (label, llen))
62
6.97k
    return IDN2_OK;
63
64
  // 2.1
65
3.91k
  switch ((bc = uc_bidi_category (*label)))
66
3.91k
    {
67
581
    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.67k
      {
75
1.67k
        endok = 1;
76
1.67k
      }
77
3.28k
    else
78
3.28k
      {
79
3.28k
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
80
870
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
81
581
    {
82
      /* printf("LTR label contains invalid code point\n"); */
83
581
      return IDN2_BIDI;
84
581
    }
85
2.69k
        endok = 0;
86
2.69k
      }
87
4.95k
  }
88
      /* printf("LTR label ends with invalid code point\n"); */
89
0
      return endok ? IDN2_OK : IDN2_BIDI;
90
91
1.10k
    case UC_BIDI_R:
92
2.59k
    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
10.1k
      for (size_t it = 1; it < llen; it++)
96
7.97k
  {
97
7.97k
    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.97k
    if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_EN
101
4.30k
        || bc == UC_BIDI_AN || bc == UC_BIDI_NSM)
102
4.55k
      {
103
4.55k
        endok = 1;
104
4.55k
      }
105
3.41k
    else
106
3.41k
      {
107
3.41k
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
108
1.16k
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
109
405
    {
110
      /* printf("RTL label contains invalid code point\n"); */
111
405
      return IDN2_BIDI;
112
405
    }
113
3.00k
        endok = 0;
114
3.00k
      }
115
7.97k
  }
116
      /* printf("RTL label ends with invalid code point\n"); */
117
2.18k
      return endok ? IDN2_OK : IDN2_BIDI;
118
119
740
    default:
120
      /* printf("Label begins with invalid BIDI class %s\n", uc_bidi_category_name(bc)); */
121
740
      return IDN2_BIDI;
122
3.91k
    }
123
3.91k
}