1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
/* See LICENSE file for copyright and license details. */
#include "lib-common.h"
static struct {
#ifndef REVERSED
# define FUNC_NAME libcharconv_rotated_90deg_cw
uint_least32_t from;
uint_least32_t to;
#else
# define FUNC_NAME libcharconv_rotated_90deg_ccw
uint_least32_t to;
uint_least32_t from;
#endif
} pairs[] = {
CYCLE_4(0x230E, 0x230C, 0x230D, 0x230F),
CYCLE_4(0x1FA04, 0x1FA19, 0x1FA2E, 0x1FA43),
CYCLE_4(0x02658, 0x1FA0D, 0x1FA22, 0x1FA37),
CYCLE_4(0x0265E, 0x1FA13, 0x1FA28, 0x1FA3D),
CYCLE_4(0x1FA08, 0x1FA1D, 0x1FA32, 0x1FA47),
CYCLE_4(0x1FA06, 0x1FA1B, 0x1FA30, 0x1FA45),
CYCLE_4(0x1FA07, 0x1FA1C, 0x1FA31, 0x1FA46),
CYCLE_2(0x1FA48, 0x1FA4B),
CYCLE_2(0x1FA49, 0x1FA4C),
CYCLE_2(0x1FA4A, 0x1FA4D),
CYCLE_4(0x1FA00, 0x1FA15, 0x1FA2A, 0x1FA3F),
CYCLE_4(0x1FA01, 0x1FA16, 0x1FA2B, 0x1FA40),
CYCLE_4(0x1FA02, 0x1FA17, 0x1FA2C, 0x1FA41),
CYCLE_4(0x1FA03, 0x1FA18, 0x1FA2D, 0x1FA42),
CYCLE_4(0x1FA05, 0x1FA1A, 0x1FA2F, 0x1FA44),
CYCLE_4(0x2654, 0x1FA09, 0x1FA1E, 0x1FA33),
CYCLE_4(0x2655, 0x1FA0A, 0x1FA1F, 0x1FA34),
CYCLE_4(0x2656, 0x1FA0B, 0x1FA20, 0x1FA35),
CYCLE_4(0x2657, 0x1FA0C, 0x1FA21, 0x1FA36),
CYCLE_4(0x2659, 0x1FA0E, 0x1FA23, 0x1FA38),
CYCLE_4(0x265A, 0x1FA0F, 0x1FA24, 0x1FA39),
CYCLE_4(0x265B, 0x1FA10, 0x1FA25, 0x1FA3A),
CYCLE_4(0x265C, 0x1FA11, 0x1FA26, 0x1FA3B),
CYCLE_4(0x265D, 0x1FA12, 0x1FA27, 0x1FA3C),
CYCLE_4(0x265F, 0x1FA14, 0x1FA29, 0x1FA3E),
{UINT32_C(0x213A), (uint_least32_t)'Q'}
};
enum libcharconv_result
FUNC_NAME(const char *s, size_t slen, size_t *n, uint_least32_t *cp, size_t *ncp)
{
uint_least32_t c;
size_t i, clen;
*n = 0;
while (slen) {
clen = libcharconv_decode_utf8_(s, slen, &c);
if (clen > slen) {
if (*n)
goto no_conv;
return LIBCHARCONV_INDETERMINATE;
}
if (!clen) {
*n += 1u;
slen -= 1u;
s = &s[1];
continue;
}
for (i = 0u; i < sizeof(pairs) / sizeof(*pairs); i++) {
if (c == pairs[i].from) {
c = pairs[i].to;
goto conv;
}
}
*n += clen;
s = &s[clen];
slen -= clen;
}
no_conv:
return LIBCHARCONV_NO_CONVERT;
conv:
if (*n)
goto no_conv;
if (*ncp)
*cp = c;
*n += clen;
*ncp = 1u;
return LIBCHARCONV_CONVERTED;
}
|
