Line | Count | Source (jump to first uncovered line) |
1 | | /* bidi.c - IDNA right to left checking functions |
2 | | Copyright (C) 2011-2022 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 | 0 | { |
43 | 0 | for (; (ssize_t) llen > 0; llen--) |
44 | 0 | { |
45 | 0 | int bc = uc_bidi_category (*label++); |
46 | |
|
47 | 0 | if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_AN) |
48 | 0 | return 1; |
49 | 0 | } |
50 | | |
51 | 0 | return 0; |
52 | 0 | } |
53 | | |
54 | | /* IDNA2008 BIDI check (RFC 5893) */ |
55 | | int |
56 | | _idn2_bidi (const uint32_t * label, size_t llen) |
57 | 0 | { |
58 | 0 | int bc; |
59 | 0 | int endok = 1; |
60 | |
|
61 | 0 | if (!_isBidi (label, llen)) |
62 | 0 | return IDN2_OK; |
63 | | |
64 | | // 2.1 |
65 | 0 | switch ((bc = uc_bidi_category (*label))) |
66 | 0 | { |
67 | 0 | case UC_BIDI_L: |
68 | | // check 2.5 & 2.6 |
69 | 0 | for (size_t it = 1; it < llen; it++) |
70 | 0 | { |
71 | 0 | bc = uc_bidi_category (label[it]); |
72 | |
|
73 | 0 | if (bc == UC_BIDI_L || bc == UC_BIDI_EN || bc == UC_BIDI_NSM) |
74 | 0 | { |
75 | 0 | endok = 1; |
76 | 0 | } |
77 | 0 | else |
78 | 0 | { |
79 | 0 | if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET |
80 | 0 | && bc != UC_BIDI_ON && bc != UC_BIDI_BN) |
81 | 0 | { |
82 | | /* printf("LTR label contains invalid code point\n"); */ |
83 | 0 | return IDN2_BIDI; |
84 | 0 | } |
85 | 0 | endok = 0; |
86 | 0 | } |
87 | 0 | } |
88 | | /* printf("LTR label ends with invalid code point\n"); */ |
89 | 0 | return endok ? IDN2_OK : IDN2_BIDI; |
90 | | |
91 | 0 | case UC_BIDI_R: |
92 | 0 | 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 | 0 | for (size_t it = 1; it < llen; it++) |
96 | 0 | { |
97 | 0 | bc = uc_bidi_category (label[it]); |
98 | | |
99 | | /* printf("Label[%d]=%04X: %s\n", (int) it, label[it], uc_bidi_category_name(bc)); */ |
100 | 0 | if (bc == UC_BIDI_R || bc == UC_BIDI_AL || bc == UC_BIDI_EN |
101 | 0 | || bc == UC_BIDI_AN || bc == UC_BIDI_NSM) |
102 | 0 | { |
103 | 0 | endok = 1; |
104 | 0 | } |
105 | 0 | else |
106 | 0 | { |
107 | 0 | if (bc != UC_BIDI_ES && bc != UC_BIDI_CS && bc != UC_BIDI_ET |
108 | 0 | && bc != UC_BIDI_ON && bc != UC_BIDI_BN) |
109 | 0 | { |
110 | | /* printf("RTL label contains invalid code point\n"); */ |
111 | 0 | return IDN2_BIDI; |
112 | 0 | } |
113 | 0 | endok = 0; |
114 | 0 | } |
115 | 0 | } |
116 | | /* printf("RTL label ends with invalid code point\n"); */ |
117 | 0 | return endok ? IDN2_OK : IDN2_BIDI; |
118 | | |
119 | 0 | default: |
120 | | /* printf("Label begins with invalid BIDI class %s\n", uc_bidi_category_name(bc)); */ |
121 | 0 | return IDN2_BIDI; |
122 | 0 | } |
123 | 0 | } |