1 c66b5250 2006-06-25 devnull #include <u.h>
2 c66b5250 2006-06-25 devnull #include <libc.h>
3 c66b5250 2006-06-25 devnull #include <draw.h>
6 c66b5250 2006-06-25 devnull * The code makes two assumptions: strlen(ld) is 1 or 2; latintab[i].ld can be a
7 c66b5250 2006-06-25 devnull * prefix of latintab[j].ld only when j<i.
9 c66b5250 2006-06-25 devnull static struct cvlist
11 c66b5250 2006-06-25 devnull char *ld; /* must be seen before using this conversion */
12 c66b5250 2006-06-25 devnull char *si; /* options for last input characters */
13 c66b5250 2006-06-25 devnull Rune so[60]; /* the corresponding Rune for each si entry */
14 c66b5250 2006-06-25 devnull } latintab[] = {
15 bb7ff349 2009-07-08 mt #include "latin1.h"
16 c66b5250 2006-06-25 devnull 0, 0, { 0 }
20 c66b5250 2006-06-25 devnull * Given 5 characters k[0]..k[4], find the rune or return -1 for failure.
22 c66b5250 2006-06-25 devnull static long
23 c66b5250 2006-06-25 devnull unicode(Rune *k)
25 c66b5250 2006-06-25 devnull long i, c;
27 c66b5250 2006-06-25 devnull k++; /* skip 'X' */
29 c66b5250 2006-06-25 devnull for(i=0; i<4; i++,k++){
31 c66b5250 2006-06-25 devnull if('0'<=*k && *k<='9')
32 c66b5250 2006-06-25 devnull c += *k-'0';
33 c66b5250 2006-06-25 devnull else if('a'<=*k && *k<='f')
34 c66b5250 2006-06-25 devnull c += 10 + *k-'a';
35 c66b5250 2006-06-25 devnull else if('A'<=*k && *k<='F')
36 c66b5250 2006-06-25 devnull c += 10 + *k-'A';
38 c66b5250 2006-06-25 devnull return -1;
40 c66b5250 2006-06-25 devnull return c;
44 c66b5250 2006-06-25 devnull * Given n characters k[0]..k[n-1], find the corresponding rune or return -1 for
45 c66b5250 2006-06-25 devnull * failure, or something < -1 if n is too small. In the latter case, the result
46 c66b5250 2006-06-25 devnull * is minus the required n.
49 c66b5250 2006-06-25 devnull _latin1(Rune *k, int n)
51 c66b5250 2006-06-25 devnull struct cvlist *l;
55 c66b5250 2006-06-25 devnull if(k[0] == 'X'){
57 c66b5250 2006-06-25 devnull return unicode(k);
59 c66b5250 2006-06-25 devnull return -5;
62 c66b5250 2006-06-25 devnull for(l=latintab; l->ld!=0; l++)
63 c66b5250 2006-06-25 devnull if(k[0] == l->ld[0]){
64 c66b5250 2006-06-25 devnull if(n == 1)
65 c66b5250 2006-06-25 devnull return -2;
66 c66b5250 2006-06-25 devnull if(l->ld[1] == 0)
67 c66b5250 2006-06-25 devnull c = k[1];
68 c66b5250 2006-06-25 devnull else if(l->ld[1] != k[1])
69 c66b5250 2006-06-25 devnull continue;
70 c66b5250 2006-06-25 devnull else if(n == 2)
71 c66b5250 2006-06-25 devnull return -3;
73 c66b5250 2006-06-25 devnull c = k[2];
74 c66b5250 2006-06-25 devnull for(p=l->si; *p!=0; p++)
75 c66b5250 2006-06-25 devnull if(*p == c)
76 c66b5250 2006-06-25 devnull return l->so[p - l->si];
77 c66b5250 2006-06-25 devnull return -1;
79 c66b5250 2006-06-25 devnull return -1;