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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
/*
* names.c db names
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version
* 2 of the License, or (at your option) any later version.
*
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
#include "names.h"
#include "utils.h"
#define MAX_ENTRIES 256
#define NAME_MAX_LEN 512
static int read_id_name(FILE *fp, int *id, char *name)
{
char buf[NAME_MAX_LEN];
int min, maj;
while (fgets(buf, sizeof(buf), fp)) {
char *p = buf;
while (*p == ' ' || *p == '\t')
p++;
if (*p == '#' || *p == '\n' || *p == 0)
continue;
if (sscanf(p, "%x:%x %s\n", &maj, &min, name) == 3) {
*id = (maj << 16) | min;
} else if (sscanf(p, "%x:%x %s #", &maj, &min, name) == 3) {
*id = (maj << 16) | min;
} else if (sscanf(p, "0x%x %s\n", id, name) != 2 &&
sscanf(p, "0x%x %s #", id, name) != 2 &&
sscanf(p, "%d %s\n", id, name) != 2 &&
sscanf(p, "%d %s #", id, name) != 2) {
strcpy(name, p);
return -1;
}
return 1;
}
return 0;
}
struct db_names *db_names_alloc(void)
{
struct db_names *db;
db = calloc(1, sizeof(*db));
if (!db)
return NULL;
db->size = MAX_ENTRIES;
db->hash = calloc(db->size, sizeof(struct db_entry *));
return db;
}
int db_names_load(struct db_names *db, const char *path)
{
struct db_entry *entry;
FILE *fp;
int id;
char namebuf[NAME_MAX_LEN] = {0};
int ret = -1;
fp = fopen(path, "r");
if (!fp)
return -ENOENT;
while ((ret = read_id_name(fp, &id, &namebuf[0]))) {
if (ret == -1) {
fprintf(stderr, "Database %s is corrupted at %s\n",
path, namebuf);
goto Exit;
}
ret = -1;
if (id < 0)
continue;
entry = malloc(sizeof(*entry));
if (!entry)
goto Exit;
entry->name = strdup(namebuf);
if (!entry->name) {
free(entry);
goto Exit;
}
entry->id = id;
entry->next = db->hash[id & (db->size - 1)];
db->hash[id & (db->size - 1)] = entry;
}
ret = 0;
Exit:
fclose(fp);
return ret;
}
void db_names_free(struct db_names *db)
{
int i;
if (!db)
return;
for (i = 0; i < db->size; i++) {
struct db_entry *entry = db->hash[i];
while (entry) {
struct db_entry *next = entry->next;
free(entry->name);
free(entry);
entry = next;
}
}
free(db->hash);
free(db);
}
char *id_to_name(struct db_names *db, int id, char *name)
{
struct db_entry *entry;
if (!db)
return NULL;
entry = db->hash[id & (db->size - 1)];
while (entry && entry->id != id)
entry = entry->next;
if (entry) {
strncpy(name, entry->name, IDNAME_MAX);
return name;
}
snprintf(name, IDNAME_MAX, "%d", id);
return NULL;
}
int name_to_id(struct db_names *db, int *id, const char *name)
{
struct db_entry *entry;
int i;
if (!db)
return -1;
if (db->cached && strcmp(db->cached->name, name) == 0) {
*id = db->cached->id;
return 0;
}
for (i = 0; i < db->size; i++) {
entry = db->hash[i];
while (entry && strcmp(entry->name, name))
entry = entry->next;
if (entry) {
db->cached = entry;
*id = entry->id;
return 0;
}
}
return -1;
}
|
