]> git.lizzy.rs Git - plan9front.git/blob - sys/src/cmd/tcs/font/kbits.c
fix typo
[plan9front.git] / sys / src / cmd / tcs / font / kbits.c
1 #include        <u.h>
2 #include        <libc.h>
3 #include        <libg.h>
4 #include        <bio.h>
5 #include        "hdr.h"
6
7 Bitmap *
8 kreadbits(char *file, int n, long *chars, int size, uchar *bits, int **doneptr)
9 {
10         Bitmap *bm;
11         Biobuf *bf;
12         char *p;
13         long kmin, kmax;
14         int i, j, byt;
15         int nch;
16         long c;
17         uchar *b;
18         int *done;
19         uchar *nbits;
20         static int dig[256] = {
21         ['0'] 0, ['1'] 1, ['2'] 2, ['3'] 3, ['4'] 4, ['5'] 5, ['6'] 6, ['7'] 7,
22         ['8'] 8, ['9'] 9, ['a'] 10, ['b'] 11, ['c'] 12, ['d'] 13, ['e'] 14, ['f'] 15,
23         };
24
25         bf = Bopen(file, OREAD);
26         if(bf == 0){
27                 fprint(2, "%s: %s: %r\n", argv0, file);
28                 exits("bitfile open error");
29         }
30         done = (int *)malloc(n*sizeof(done[0]));
31         if(done == 0){
32                 fprint(2, "%s: malloc error (%d bytes)\n", argv0, n);
33                 exits("malloc error");
34         }
35         *doneptr = done;
36         memset(done, 0, n*sizeof(done[0]));
37         kmin = 65536;
38         kmax = 0;
39         for(i = 0; i < n; i++){
40                 c = chars[i];
41                 if(kmin > c)
42                         kmin = c;
43                 if(kmax < c)
44                         kmax = c;
45         }
46         nch = 0;
47         byt = size/8;
48         Brdline(bf, '\n');              /* header line 1 */
49         Brdline(bf, '\n');              /* header line 2 */
50         while(p = (char *)Brdline(bf, '\n')){
51                 c = strtol(p+17, (char **)0, 10);
52                 if((c < kmin) || (c > kmax))
53                         continue;
54                 for(i = 0; i < n; i++)
55                         if(c == chars[i]){
56                                 nch++;
57                                 done[i] = 1;
58                                 p += 25;
59                                 b = bits + i*byt;
60                                 for(i = 0; i < size; i++){      /* rows */
61                                         for(j = 0; j < byt; j++){
62                                                 *b++ = (dig[*p]<<4) | dig[p[1]];
63                                                 p += 2;
64                                         }
65                                         b += (n-1)*byt;
66                                 }
67                                 break;
68                         }
69         }
70         nbits = (uchar *)malloc(nch*byt*size);
71         if(nbits == 0){
72                 fprint(2, "%s: malloc error (%d bytes)\n", argv0, nch*byt);
73                 exits("malloc error");
74         }
75         c = 0;
76         for(i = 0; i < n; i++)
77                 if(done[i]){
78                         for(j = 0; j < size; j++)
79                                 memmove(nbits+c*byt+j*nch*byt, bits+i*byt+j*n*byt, byt);
80                         c++;
81                 }
82         bm = balloc((Rectangle){(Point){0, 0}, (Point){nch*size, size}}, 0);
83         if(bm == 0){
84                 fprint(2, "%s: balloc failure\n", argv0);
85                 exits("balloc failure");
86         }
87         wrbitmap(bm, 0, size, nbits);
88         for(i = 0; i < n; i++)
89                 if(done[i] == 0){
90                         /*fprint(2, "char 0x%x (%d) not found\n", chars[i], chars[i]);/**/
91                 }
92         return(bm);
93 }