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
|
/* uuterm, Copyright (C) 2006 Rich Felker; licensed under GNU GPL v2 only */
#include <string.h>
#include "uuterm.h"
#include "ucf.h"
static void extract_cell(unsigned *ch, size_t max, struct uucell *cell)
{
int i, l;
unsigned b;
for (b=i=0; i<3; i++) b |= cell->c[i] << 8*i;
l = uu_decompose_char(b, ch, max);
ch += l; max -= l;
for (; i<sizeof(cell->c) && cell->c[i]; i++) {
l = uu_decompose_char(uu_combine_involution(b, cell->c[i]), ch, max);
ch += l; max -= l;
}
if ((cell->a & UU_ATTR_UL) && max)
max--, *ch++ = '_'; //0x0332;
for (; max; max--) *ch++ = 0;
ch[-1] = 0;
}
const void *ascii_get_glyph(unsigned);
static const void *lookup_glyph(struct ucf *f, int i, unsigned *this, unsigned *prev, unsigned *next, int width, int part)
{
const unsigned char *a;
static const unsigned c[2] = { 0xfffd, 0 };
int g = ucf_lookup(f, i, this, prev, next, width);
if (g<0 && !i) g = ucf_lookup(f, i, c, c, c, width);
if (g>=0) return f->glyphs + f->S * (g + part);
return 0;
}
#define CH_LEN 16
void uuterm_refresh_row(struct uudisp *d, struct uurow *row, int x1, int x2)
{
unsigned ch[4][CH_LEN], *chp;
int x, i;
int width, part;
if (x1) extract_cell(ch[(x1-1)&3], CH_LEN, &row->cells[x1-1]);
else memset(ch[3], 0, sizeof(ch[3]));
extract_cell(ch[x1&3], CH_LEN, &row->cells[x1]);
for (x=x1; x<=x2; x++) {
extract_cell(ch[(x+1)&3], CH_LEN, &row->cells[x+1]);
if (ch[x&3][0] == UU_FULLWIDTH) {
width = 2; part = 0; chp = ch[(x+1)&3];
} else if (ch[(x+3)&3][0] == UU_FULLWIDTH) {
width = 2; part = 1; chp = ch[x&3];
} else {
width = 1; part = 0; chp = ch[x&3];
}
uudisp_predraw_cell(d, row->idx, x, row->cells[x].a & 0xff);
for (i=0; i<sizeof(ch[0]) && chp[i]; i++) {
const void *glyph = lookup_glyph(d->font, i, chp, ch[(x+3)&3], ch[(x+1)&3], width, part);
if (glyph) uudisp_draw_glyph(d, row->idx, x, glyph);
}
uudisp_finalize_cell(d, row->idx, x);
}
}
|
