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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "glyphs.h"
struct glyph_entry {
unsigned short code;
char *name;
struct glyph_entry *next;
};
static struct glyph_entry glyphs[256];
ttf2f_result glyph_load_list(void)
{
FILE *fp;
char line[1024];
char *semi, *name;
struct glyph_entry *g, *cur;
#ifdef __riscos__
fp = fopen("<TTF2f$Dir>.Glyphs", "r");
#else
fp = fopen("Glyphs", "r");
#endif
if (fp == NULL)
return TTF2F_RESULT_OPEN;
while(fgets(line, 1024, fp)) {
/* skip comments & blank lines */
if (line[0] == 0 || line[0] == '#')
continue;
/* strip cr from end */
line[strlen(line) - 1] = 0;
semi = strchr(line, ';');
if (!semi)
continue;
*semi = 0;
name = semi+1;
semi = strchr(name, ';');
if (semi)
*semi = 0;
g = calloc(1, sizeof(struct glyph_entry));
if (g == NULL)
return TTF2F_RESULT_NOMEM;
g->code = (unsigned short)strtoul(line, NULL, 16);
g->name = strdup(name);
if (g->name == NULL) {
free(g);
return TTF2F_RESULT_NOMEM;
}
for (cur = &glyphs[g->code / 256];
cur->next && cur->code < g->code;
cur = cur->next)
;
if (cur->code == g->code) {
free(g->name);
free(g);
continue;
}
if (cur->next)
g->next = cur->next;
cur->next = g;
}
fclose(fp);
return TTF2F_RESULT_OK;
}
const char *glyph_name(unsigned short code)
{
struct glyph_entry *g;
for (g = &glyphs[code / 256]; g; g = g->next)
if (g->code == code)
break;
return g != NULL ? g->name : NULL;
}
void glyph_destroy_list(void)
{
int i;
struct glyph_entry *a, *b;
for (i = 0; i != 256; i++) {
for (a = (&glyphs[i])->next; a; a = b) {
b = a->next;
free(a->name);
free(a);
}
}
}
|
