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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
|
/* MIT/X Consortium Copyright (c) 2012 Connor Lane Smith <cls@lubutu.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
#include "../utf.h"
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define UTFSEQ(x) ((((x) & 0x80) == 0x00) ? 1 /* 0xxxxxxx */ \
: (((x) & 0xC0) == 0x80) ? 0 /* 10xxxxxx */ \
: (((x) & 0xE0) == 0xC0) ? 2 /* 110xxxxx */ \
: (((x) & 0xF0) == 0xE0) ? 3 /* 1110xxxx */ \
: (((x) & 0xF8) == 0xF0) ? 4 /* 11110xxx */ \
: (((x) & 0xFC) == 0xF8) ? 5 /* 111110xx */ \
: (((x) & 0xFE) == 0xFC) ? 6 /* 1111110x */ \
: 0 )
#define BADRUNE(x) ((x) < 0 || (x) > Runemax \
|| ((x) & 0xFFFE) == 0xFFFE \
|| ((x) >= 0xD800 && (x) <= 0xDFFF) \
|| ((x) >= 0xFDD0 && (x) <= 0xFDEF))
int
runetochar(char *s, const Rune *p)
{
Rune r = *p;
switch(runelen(r)) {
case 1: /* 0aaaaaaa */
s[0] = r;
return 1;
case 2: /* 00000aaa aabbbbbb */
s[0] = 0xC0 | ((r & 0x0007C0) >> 6); /* 110aaaaa */
s[1] = 0x80 | (r & 0x00003F); /* 10bbbbbb */
return 2;
case 3: /* aaaabbbb bbcccccc */
s[0] = 0xE0 | ((r & 0x00F000) >> 12); /* 1110aaaa */
s[1] = 0x80 | ((r & 0x000FC0) >> 6); /* 10bbbbbb */
s[2] = 0x80 | (r & 0x00003F); /* 10cccccc */
return 3;
case 4: /* 000aaabb bbbbcccc ccdddddd */
s[0] = 0xF0 | ((r & 0x1C0000) >> 18); /* 11110aaa */
s[1] = 0x80 | ((r & 0x03F000) >> 12); /* 10bbbbbb */
s[2] = 0x80 | ((r & 0x000FC0) >> 6); /* 10cccccc */
s[3] = 0x80 | (r & 0x00003F); /* 10dddddd */
return 4;
default:
return 0; /* error */
}
}
int
chartorune(Rune *p, const char *s)
{
return charntorune(p, s, UTFmax);
}
int
charntorune(Rune *p, const char *s, size_t len)
{
unsigned int i, n;
Rune r;
if(len == 0) /* can't even look at s[0] */
return 0;
switch((n = UTFSEQ(s[0]))) {
case 1: r = s[0]; break; /* 0xxxxxxx */
case 2: r = s[0] & 0x1F; break; /* 110xxxxx */
case 3: r = s[0] & 0x0F; break; /* 1110xxxx */
case 4: r = s[0] & 0x07; break; /* 11110xxx */
case 5: r = s[0] & 0x03; break; /* 111110xx */
case 6: r = s[0] & 0x01; break; /* 1111110x */
default: /* invalid sequence */
*p = Runeerror;
return 1;
}
/* add values from continuation bytes */
for(i = 1; i < MIN(n, len); i++)
if((s[i] & 0xC0) == 0x80) {
/* add bits from continuation byte to rune value
* cannot overflow: 6 byte sequences contain 31 bits */
r = (r << 6) | (s[i] & 0x3F); /* 10xxxxxx */
}
else { /* expected continuation */
*p = Runeerror;
return i;
}
if(i < n) /* must have reached len limit */
return 0;
/* reject invalid or overlong sequences */
if(BADRUNE(r) || runelen(r) < (int)n)
r = Runeerror;
*p = r;
return n;
}
int
runelen(Rune r)
{
if(BADRUNE(r))
return 0; /* error */
else if(r <= 0x7F)
return 1;
else if(r <= 0x07FF)
return 2;
else if(r <= 0xFFFF)
return 3;
else
return 4;
}
size_t
runenlen(const Rune *p, size_t len)
{
size_t i, n = 0;
for(i = 0; i < len; i++)
n += runelen(p[i]);
return n;
}
int
fullrune(const char *s, size_t len)
{
Rune r;
return charntorune(&r, s, len) > 0;
}
|
