1*9ef1f84bSDavid du Colombier #include "u.h"
2*9ef1f84bSDavid du Colombier #include "../port/lib.h"
3*9ef1f84bSDavid du Colombier
4*9ef1f84bSDavid du Colombier /*
5*9ef1f84bSDavid du Colombier * The code makes two assumptions: strlen(ld) is 1 or 2; latintab[i].ld can be a
6*9ef1f84bSDavid du Colombier * prefix of latintab[j].ld only when j<i.
7*9ef1f84bSDavid du Colombier */
8*9ef1f84bSDavid du Colombier struct cvlist
9*9ef1f84bSDavid du Colombier {
10*9ef1f84bSDavid du Colombier char *ld; /* must be seen before using this conversion */
11*9ef1f84bSDavid du Colombier char *si; /* options for last input characters */
12*9ef1f84bSDavid du Colombier Rune *so; /* the corresponding Rune for each si entry */
13*9ef1f84bSDavid du Colombier } latintab[] = {
14*9ef1f84bSDavid du Colombier #include "../port/latin1.h"
15*9ef1f84bSDavid du Colombier 0, 0, 0
16*9ef1f84bSDavid du Colombier };
17*9ef1f84bSDavid du Colombier
18*9ef1f84bSDavid du Colombier /*
19*9ef1f84bSDavid du Colombier * Given n characters k[0]..k[n-1], find the rune or return -1 for failure.
20*9ef1f84bSDavid du Colombier */
21*9ef1f84bSDavid du Colombier static long
unicode(Rune * k,int n)22*9ef1f84bSDavid du Colombier unicode(Rune *k, int n)
23*9ef1f84bSDavid du Colombier {
24*9ef1f84bSDavid du Colombier long c;
25*9ef1f84bSDavid du Colombier Rune *r;
26*9ef1f84bSDavid du Colombier
27*9ef1f84bSDavid du Colombier c = 0;
28*9ef1f84bSDavid du Colombier for(r = &k[1]; r<&k[n]; r++){ /* +1 to skip [Xx] */
29*9ef1f84bSDavid du Colombier c <<= 4;
30*9ef1f84bSDavid du Colombier if('0'<=*r && *r<='9')
31*9ef1f84bSDavid du Colombier c += *r-'0';
32*9ef1f84bSDavid du Colombier else if('a'<=*r && *r<='f')
33*9ef1f84bSDavid du Colombier c += 10 + *r-'a';
34*9ef1f84bSDavid du Colombier else if('A'<=*r && *r<='F')
35*9ef1f84bSDavid du Colombier c += 10 + *r-'A';
36*9ef1f84bSDavid du Colombier else
37*9ef1f84bSDavid du Colombier return -1;
38*9ef1f84bSDavid du Colombier }
39*9ef1f84bSDavid du Colombier return c;
40*9ef1f84bSDavid du Colombier }
41*9ef1f84bSDavid du Colombier
42*9ef1f84bSDavid du Colombier /*
43*9ef1f84bSDavid du Colombier * Given n characters k[0]..k[n-1], find the corresponding rune or return -1 for
44*9ef1f84bSDavid du Colombier * failure, or something < -1 if n is too small. In the latter case, the result
45*9ef1f84bSDavid du Colombier * is minus the required n.
46*9ef1f84bSDavid du Colombier */
47*9ef1f84bSDavid du Colombier long
latin1(Rune * k,int n)48*9ef1f84bSDavid du Colombier latin1(Rune *k, int n)
49*9ef1f84bSDavid du Colombier {
50*9ef1f84bSDavid du Colombier struct cvlist *l;
51*9ef1f84bSDavid du Colombier int c;
52*9ef1f84bSDavid du Colombier char* p;
53*9ef1f84bSDavid du Colombier
54*9ef1f84bSDavid du Colombier if(k[0] == 'X')
55*9ef1f84bSDavid du Colombier if(n>=5)
56*9ef1f84bSDavid du Colombier return unicode(k, 5);
57*9ef1f84bSDavid du Colombier else
58*9ef1f84bSDavid du Colombier return -5;
59*9ef1f84bSDavid du Colombier if(k[0] == 'x')
60*9ef1f84bSDavid du Colombier if(n>=UTFmax*2+1)
61*9ef1f84bSDavid du Colombier return unicode(k, UTFmax*2+1);
62*9ef1f84bSDavid du Colombier else
63*9ef1f84bSDavid du Colombier return -(UTFmax+1);
64*9ef1f84bSDavid du Colombier for(l=latintab; l->ld!=0; l++)
65*9ef1f84bSDavid du Colombier if(k[0] == l->ld[0]){
66*9ef1f84bSDavid du Colombier if(n == 1)
67*9ef1f84bSDavid du Colombier return -2;
68*9ef1f84bSDavid du Colombier if(l->ld[1] == 0)
69*9ef1f84bSDavid du Colombier c = k[1];
70*9ef1f84bSDavid du Colombier else if(l->ld[1] != k[1])
71*9ef1f84bSDavid du Colombier continue;
72*9ef1f84bSDavid du Colombier else if(n == 2)
73*9ef1f84bSDavid du Colombier return -3;
74*9ef1f84bSDavid du Colombier else
75*9ef1f84bSDavid du Colombier c = k[2];
76*9ef1f84bSDavid du Colombier for(p=l->si; *p!=0; p++)
77*9ef1f84bSDavid du Colombier if(*p == c)
78*9ef1f84bSDavid du Colombier return l->so[p - l->si];
79*9ef1f84bSDavid du Colombier return -1;
80*9ef1f84bSDavid du Colombier }
81*9ef1f84bSDavid du Colombier return -1;
82*9ef1f84bSDavid du Colombier }
83