Coverage Report

Created: 2026-05-16 06:52

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.04k
{
43
17.4k
  for (; (ssize_t) llen > 0; llen--)
44
16.0k
    {
45
16.0k
      int bc = uc_bidi_category (*label++);
46
47
16.0k
      if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_AN)
48
607
  return 1;
49
16.0k
    }
50
51
1.43k
  return 0;
52
2.04k
}
53
54
/* IDNA2008 BIDI check (RFC 5893) */
55
int
56
_idn2_bidi (const uint32_t *label, size_t llen)
57
2.04k
{
58
2.04k
  int bc;
59
2.04k
  int endok = 1;
60
61
2.04k
  if (!_isBidi (label, llen))
62
1.43k
    return IDN2_OK;
63
64
  // 2.1
65
607
  switch ((bc = uc_bidi_category (*label)))
66
607
    {
67
69
    case UC_BIDI_L:
68
      // check 2.5 & 2.6
69
1.79k
      for (size_t it = 1; it < llen; it++)
70
1.79k
  {
71
1.79k
    bc = uc_bidi_category (label[it]);
72
73
1.79k
    if (bc == UC_BIDI_L || bc == UC_BIDI_EN || bc == UC_BIDI_NSM)
74
1.31k
      {
75
1.31k
        endok = 1;
76
1.31k
      }
77
482
    else
78
482
      {
79
482
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
80
265
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
81
69
    {
82
      /* printf("LTR label contains invalid code point\n"); */
83
69
      return IDN2_BIDI;
84
69
    }
85
413
        endok = 0;
86
413
      }
87
1.79k
  }
88
      /* printf("LTR label ends with invalid code point\n"); */
89
0
      return endok ? IDN2_OK : IDN2_BIDI;
90
91
196
    case UC_BIDI_R:
92
463
    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
4.73k
      for (size_t it = 1; it < llen; it++)
96
4.28k
  {
97
4.28k
    bc = uc_bidi_category (label[it]);
98
99
    /* printf("Label[%d]=%04X: %s\n", (int) it, label[it], uc_bidi_category_name(bc)); */
100
4.28k
    if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_EN
101
2.35k
        || bc == UC_BIDI_AN || bc == UC_BIDI_NSM)
102
3.73k
      {
103
3.73k
        endok = 1;
104
3.73k
      }
105
545
    else
106
545
      {
107
545
        if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET
108
329
      && bc != UC_BIDI_ON && bc != UC_BIDI_BN)
109
10
    {
110
      /* printf("RTL label contains invalid code point\n"); */
111
10
      return IDN2_BIDI;
112
10
    }
113
535
        endok = 0;
114
535
      }
115
4.28k
  }
116
      /* printf("RTL label ends with invalid code point\n"); */
117
453
      return endok ? IDN2_OK : IDN2_BIDI;
118
119
75
    default:
120
      /* printf("Label begins with invalid BIDI class %s\n", uc_bidi_category_name(bc)); */
121
75
      return IDN2_BIDI;
122
607
    }
123
607
}