/src/libidn2/lib/context.c

Source (jump to first uncovered line)
/* context.c - check contextual rule on label
   Copyright (C) 2011-2022 Simon Josefsson

   Libidn2 is free software: you can redistribute it and/or modify it
   under the terms of either:

     * the GNU Lesser General Public License as published by the Free
       Software Foundation; either version 3 of the License, or (at
       your option) any later version.

   or

     * the GNU General Public License as published by the Free
       Software Foundation; either version 2 of the License, or (at
       your option) any later version.

   or both in parallel, as here.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received copies of the GNU General Public License and
   the GNU Lesser General Public License along with this program.  If
   not, see <http://www.gnu.org/licenses/>.
*/

#include <config.h>

#include "idn2.h"
#include "tables.h"
#include <unictype.h>   /* uc_combining_class, UC_CCC_VR */
#include "context.h"

int
_idn2_contextj_rule (const uint32_t * label, size_t llen, size_t pos)
{
  uint32_t cp;

  if (llen == 0)
    return IDN2_OK;

  cp = label[pos];

  if (!_idn2_contextj_p (cp))
    return IDN2_OK;

  switch (cp)
    {
    case 0x200C:    /* ZERO WIDTH NON-JOINER */
      if (pos > 0)
  {
    /* If Canonical_Combining_Class(Before(cp)) .eq.  Virama Then True; */
    uint32_t before_cp = label[pos - 1];
    int cc = uc_combining_class (before_cp);
    if (cc == UC_CCC_VR)
      return IDN2_OK;
  }

      /* See http://permalink.gmane.org/gmane.ietf.idnabis/6980 for
         clarified rule. */

      if (pos == 0 || pos == llen - 1)
  return IDN2_CONTEXTJ;

      {
  int jt;
  size_t tmp;

  /* Search backwards. */
  for (tmp = pos - 1;; tmp--)
    {
      jt = uc_joining_type (label[tmp]);
      if (jt == UC_JOINING_TYPE_L || jt == UC_JOINING_TYPE_D)
        break;
      if (tmp == 0)
        return IDN2_CONTEXTJ;
      if (jt == UC_JOINING_TYPE_T)
        continue;
      return IDN2_CONTEXTJ;
    }

  /* Search forward. */
  for (tmp = pos + 1; tmp < llen; tmp++)
    {
      jt = uc_joining_type (label[tmp]);
      if (jt == UC_JOINING_TYPE_R || jt == UC_JOINING_TYPE_D)
        break;
      if (tmp == llen - 1)
        return IDN2_CONTEXTJ;
      if (jt == UC_JOINING_TYPE_T)
        continue;
      return IDN2_CONTEXTJ;
    }
      }

      return IDN2_OK;
      break;

    case 0x200D:    /* ZERO WIDTH JOINER */
      if (pos > 0)
  {
    uint32_t before_cp = label[pos - 1];
    int cc = uc_combining_class (before_cp);
    if (cc == UC_CCC_VR)
      return IDN2_OK;
  }
      return IDN2_CONTEXTJ;
    }

  return IDN2_CONTEXTJ_NO_RULE;
}

static const char *
_uc_script_name (ucs4_t uc)
{
  const uc_script_t *ucs = uc_script (uc);

  if (!ucs)
    return "";

  return ucs->name;
}

int
_idn2_contexto_rule (const uint32_t * label, size_t llen, size_t pos)
{
  uint32_t cp = label[pos];

  if (!_idn2_contexto_p (cp))
    return IDN2_OK;

  switch (cp)
    {
    case 0x00B7:
      /* MIDDLE DOT */
      if (llen < 3)
  return IDN2_CONTEXTO;
      if (pos == 0 || pos == llen - 1)
  return IDN2_CONTEXTO;
      if (label[pos - 1] == 0x006C && label[pos + 1] == 0x006C)
  return IDN2_OK;
      return IDN2_CONTEXTO;
      break;

    case 0x0375:
      /* GREEK LOWER NUMERAL SIGN (KERAIA) */
      if (pos == llen - 1)
  return IDN2_CONTEXTO;
      if (strcmp (_uc_script_name (label[pos + 1]), "Greek") == 0)
  return IDN2_OK;
      return IDN2_CONTEXTO;
      break;

    case 0x05F3:
      /* HEBREW PUNCTUATION GERESH */
    case 0x05F4:
      /* HEBREW PUNCTUATION GERSHAYIM */
      if (pos == 0)
  return IDN2_CONTEXTO;
      if (strcmp (_uc_script_name (label[pos - 1]), "Hebrew") == 0)
  return IDN2_OK;
      return IDN2_CONTEXTO;
      break;

    case 0x0660:
    case 0x0661:
    case 0x0662:
    case 0x0663:
    case 0x0664:
    case 0x0665:
    case 0x0666:
    case 0x0667:
    case 0x0668:
    case 0x0669:
      {
  /* ARABIC-INDIC DIGITS */
  size_t i;
  for (i = 0; i < llen; i++)
    if (label[i] >= 0x6F0 && label[i] <= 0x06F9)
      return IDN2_CONTEXTO;
  return IDN2_OK;
  break;
      }

    case 0x06F0:
    case 0x06F1:
    case 0x06F2:
    case 0x06F3:
    case 0x06F4:
    case 0x06F5:
    case 0x06F6:
    case 0x06F7:
    case 0x06F8:
    case 0x06F9:
      {
  /* EXTENDED ARABIC-INDIC DIGITS */
  size_t i;
  for (i = 0; i < llen; i++)
    if (label[i] >= 0x660 && label[i] <= 0x0669)
      return IDN2_CONTEXTO;
  return IDN2_OK;
  break;
      }
    case 0x30FB:
      {
  /* KATAKANA MIDDLE DOT */
  size_t i;
  bool script_ok = false;

  for (i = 0; !script_ok && i < llen; i++)
    if (strcmp (_uc_script_name (label[i]), "Hiragana") == 0
        || strcmp (_uc_script_name (label[i]), "Katakana") == 0
        || strcmp (_uc_script_name (label[i]), "Han") == 0)
      script_ok = true;

  if (script_ok)
    return IDN2_OK;
  return IDN2_CONTEXTO;
  break;
      }
    }

  return IDN2_CONTEXTO_NO_RULE;
}

bool
_idn2_contexto_with_rule (uint32_t cp)
{
  switch (cp)
    {
    case 0x00B7:
      /* MIDDLE DOT */
    case 0x0375:
      /* GREEK LOWER NUMERAL SIGN (KERAIA) */
    case 0x05F3:
      /* HEBREW PUNCTUATION GERESH */
    case 0x05F4:
      /* HEBREW PUNCTUATION GERSHAYIM */
    case 0x0660:
    case 0x0661:
    case 0x0662:
    case 0x0663:
    case 0x0664:
    case 0x0665:
    case 0x0666:
    case 0x0667:
    case 0x0668:
    case 0x0669:
      /* ARABIC-INDIC DIGITS */
    case 0x06F0:
    case 0x06F1:
    case 0x06F2:
    case 0x06F3:
    case 0x06F4:
    case 0x06F5:
    case 0x06F6:
    case 0x06F7:
    case 0x06F8:
    case 0x06F9:
      /* EXTENDED ARABIC-INDIC DIGITS */
    case 0x30FB:
      /* KATAKANA MIDDLE DOT */
      return true;
      break;
    }

  return false;
}

Coverage Report

Created: 2022-11-21 06:06

Line	Count	Source (jump to first uncovered line)
1		/* context.c - check contextual rule on label
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		#include "tables.h"
33		#include <unictype.h> /* uc_combining_class, UC_CCC_VR */
34		#include "context.h"
35
36		int
37		_idn2_contextj_rule (const uint32_t * label, size_t llen, size_t pos)
38	7.49k	{
39	7.49k	uint32_t cp;
40
41	7.49k	if (llen == 0)
42	0	return IDN2_OK;
43
44	7.49k	cp = label[pos];
45
46	7.49k	if (!_idn2_contextj_p (cp))
47	7.21k	return IDN2_OK;
48
49	282	switch (cp)
50	282	{
51	239	case 0x200C: /* ZERO WIDTH NON-JOINER */
52	239	if (pos > 0)
53	238	{
54		/* If Canonical_Combining_Class(Before(cp)) .eq. Virama Then True; */
55	238	uint32_t before_cp = label[pos - 1];
56	238	int cc = uc_combining_class (before_cp);
57	238	if (cc == UC_CCC_VR)
58	34	return IDN2_OK;
59	238	}
60
61		/* See http://permalink.gmane.org/gmane.ietf.idnabis/6980 for
62		clarified rule. */
63
64	205	if (pos == 0 \|\| pos == llen - 1)
65	19	return IDN2_CONTEXTJ;
66
67	186	{
68	186	int jt;
69	186	size_t tmp;
70
71		/* Search backwards. */
72	186	for (tmp = pos - 1;; tmp--)
73	320	{
74	320	jt = uc_joining_type (label[tmp]);
75	320	if (jt == UC_JOINING_TYPE_L \|\| jt == UC_JOINING_TYPE_D)
76	117	break;
77	203	if (tmp == 0)
78	58	return IDN2_CONTEXTJ;
79	145	if (jt == UC_JOINING_TYPE_T)
80	134	continue;
81	11	return IDN2_CONTEXTJ;
82	145	}
83
84		/* Search forward. */
85	305	for (tmp = pos + 1; tmp < llen; tmp++)
86	305	{
87	305	jt = uc_joining_type (label[tmp]);
88	305	if (jt == UC_JOINING_TYPE_R \|\| jt == UC_JOINING_TYPE_D)
89	88	break;
90	217	if (tmp == llen - 1)
91	25	return IDN2_CONTEXTJ;
92	192	if (jt == UC_JOINING_TYPE_T)
93	188	continue;
94	4	return IDN2_CONTEXTJ;
95	192	}
96	117	}
97
98	88	return IDN2_OK;
99	0	break;
100
101	43	case 0x200D: /* ZERO WIDTH JOINER */
102	43	if (pos > 0)
103	42	{
104	42	uint32_t before_cp = label[pos - 1];
105	42	int cc = uc_combining_class (before_cp);
106	42	if (cc == UC_CCC_VR)
107	34	return IDN2_OK;
108	42	}
109	9	return IDN2_CONTEXTJ;
110	282	}
111
112	0	return IDN2_CONTEXTJ_NO_RULE;
113	282	}
114
115		static const char *
116		_uc_script_name (ucs4_t uc)
117	9.43k	{
118	9.43k	const uc_script_t *ucs = uc_script (uc);
119
120	9.43k	if (!ucs)
121	1.88k	return "";
122
123	7.54k	return ucs->name;
124	9.43k	}
125
126		int
127		_idn2_contexto_rule (const uint32_t * label, size_t llen, size_t pos)
128	6.57k	{
129	6.57k	uint32_t cp = label[pos];
130
131	6.57k	if (!_idn2_contexto_p (cp))
132	3.85k	return IDN2_OK;
133
134	2.72k	switch (cp)
135	2.72k	{
136	72	case 0x00B7:
137		/* MIDDLE DOT */
138	72	if (llen < 3)
139	1	return IDN2_CONTEXTO;
140	71	if (pos == 0 \|\| pos == llen - 1)
141	7	return IDN2_CONTEXTO;
142	64	if (label[pos - 1] == 0x006C && label[pos + 1] == 0x006C)
143	36	return IDN2_OK;
144	28	return IDN2_CONTEXTO;
145	0	break;
146
147	127	case 0x0375:
148		/* GREEK LOWER NUMERAL SIGN (KERAIA) */
149	127	if (pos == llen - 1)
150	11	return IDN2_CONTEXTO;
151	116	if (strcmp (_uc_script_name (label[pos + 1]), "Greek") == 0)
152	104	return IDN2_OK;
153	12	return IDN2_CONTEXTO;
154	0	break;
155
156	74	case 0x05F3:
157		/* HEBREW PUNCTUATION GERESH */
158	153	case 0x05F4:
159		/* HEBREW PUNCTUATION GERSHAYIM */
160	153	if (pos == 0)
161	2	return IDN2_CONTEXTO;
162	151	if (strcmp (_uc_script_name (label[pos - 1]), "Hebrew") == 0)
163	140	return IDN2_OK;
164	11	return IDN2_CONTEXTO;
165	0	break;
166
167	132	case 0x0660:
168	202	case 0x0661:
169	273	case 0x0662:
170	345	case 0x0663:
171	445	case 0x0664:
172	518	case 0x0665:
173	594	case 0x0666:
174	667	case 0x0667:
175	755	case 0x0668:
176	841	case 0x0669:
177	841	{
178		/* ARABIC-INDIC DIGITS */
179	841	size_t i;
180	17.8k	for (i = 0; i < llen; i++)
181	17.0k	if (label[i] >= 0x6F0 && label[i] <= 0x06F9)
182	3	return IDN2_CONTEXTO;
183	838	return IDN2_OK;
184	0	break;
185	841	}
186
187	82	case 0x06F0:
188	251	case 0x06F1:
189	351	case 0x06F2:
190	445	case 0x06F3:
191	562	case 0x06F4:
192	671	case 0x06F5:
193	789	case 0x06F6:
194	887	case 0x06F7:
195	1.01k	case 0x06F8:
196	1.12k	case 0x06F9:
197	1.12k	{
198		/* EXTENDED ARABIC-INDIC DIGITS */
199	1.12k	size_t i;
200	26.4k	for (i = 0; i < llen; i++)
201	25.3k	if (label[i] >= 0x660 && label[i] <= 0x0669)
202	4	return IDN2_CONTEXTO;
203	1.12k	return IDN2_OK;
204	0	break;
205	1.12k	}
206	401	case 0x30FB:
207	401	{
208		/* KATAKANA MIDDLE DOT */
209	401	size_t i;
210	401	bool script_ok = false;
211
212	3.57k	for (i = 0; !script_ok && i < llen; i++)
213	3.16k	if (strcmp (_uc_script_name (label[i]), "Hiragana") == 0
214	3.16k	\|\| strcmp (_uc_script_name (label[i]), "Katakana") == 0
215	3.16k	\|\| strcmp (_uc_script_name (label[i]), "Han") == 0)
216	350	script_ok = true;
217
218	401	if (script_ok)
219	350	return IDN2_OK;
220	51	return IDN2_CONTEXTO;
221	0	break;
222	401	}
223	2.72k	}
224
225	0	return IDN2_CONTEXTO_NO_RULE;
226	2.72k	}
227
228		bool
229		_idn2_contexto_with_rule (uint32_t cp)
230	0	{
231	0	switch (cp)
232	0	{
233	0	case 0x00B7:
234		/* MIDDLE DOT */
235	0	case 0x0375:
236		/* GREEK LOWER NUMERAL SIGN (KERAIA) */
237	0	case 0x05F3:
238		/* HEBREW PUNCTUATION GERESH */
239	0	case 0x05F4:
240		/* HEBREW PUNCTUATION GERSHAYIM */
241	0	case 0x0660:
242	0	case 0x0661:
243	0	case 0x0662:
244	0	case 0x0663:
245	0	case 0x0664:
246	0	case 0x0665:
247	0	case 0x0666:
248	0	case 0x0667:
249	0	case 0x0668:
250	0	case 0x0669:
251		/* ARABIC-INDIC DIGITS */
252	0	case 0x06F0:
253	0	case 0x06F1:
254	0	case 0x06F2:
255	0	case 0x06F3:
256	0	case 0x06F4:
257	0	case 0x06F5:
258	0	case 0x06F6:
259	0	case 0x06F7:
260	0	case 0x06F8:
261	0	case 0x06F9:
262		/* EXTENDED ARABIC-INDIC DIGITS */
263	0	case 0x30FB:
264		/* KATAKANA MIDDLE DOT */
265	0	return true;
266	0	break;
267	0	}
268
269	0	return false;
270	0	}