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
|
#include <u.h>
#include <libc.h>
#include <draw.h>
/*
* The code makes two assumptions: strlen(ld) is 1 or 2; latintab[i].ld can be a
* prefix of latintab[j].ld only when j<i.
*/
static struct cvlist
{
char *ld; /* must be seen before using this conversion */
char *si; /* options for last input characters */
Rune so[60]; /* the corresponding Rune for each si entry */
} latintab[] = {
#include "latin1.h"
0, 0, { 0 }
};
/*
* Given 5 characters k[0]..k[n], find the rune or return -1 for failure.
*/
static long
unicode(Rune *k, int n)
{
long i, c;
c = 0;
for(i=0; i<n; i++,k++){
c <<= 4;
if('0'<=*k && *k<='9')
c += *k-'0';
else if('a'<=*k && *k<='f')
c += 10 + *k-'a';
else if('A'<=*k && *k<='F')
c += 10 + *k-'A';
else
return -1;
if(c > Runemax)
return -1;
}
return c;
}
/*
* Given n characters k[0]..k[n-1], find the corresponding rune or return -1 for
* failure, or something < -1 if n is too small. In the latter case, the result
* is minus the required n.
*/
int
latin1(Rune *k, int n)
{
struct cvlist *l;
int c;
char* p;
if(k[0] == 'X'){
if(n < 2)
return -2;
if(k[1] == 'X') {
if(n < 3)
return -3;
if(k[2] == 'X') {
if(n < 9) {
if(unicode(k+3, n-3) < 0)
return -1;
return -(n+1);
}
return unicode(k+3, 6);
}
if(n < 7) {
if(unicode(k+2, n-2) < 0)
return -1;
return -(n+1);
}
return unicode(k+2, 5);
}
if(n < 5) {
if(unicode(k+1, n-1) < 0)
return -1;
return -(n+1);
}
return unicode(k+1, 4);
}
for(l=latintab; l->ld!=0; l++)
if(k[0] == l->ld[0]){
if(n == 1)
return -2;
if(l->ld[1] == 0)
c = k[1];
else if(l->ld[1] != k[1])
continue;
else if(n == 2)
return -3;
else
c = k[2];
for(p=l->si; *p!=0; p++)
if(*p == c)
return l->so[p - l->si];
return -1;
}
return -1;
}
|