blob: 62cdd6c812818b20a488db94989beb1ee3db0602 (
plain)
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
|
#include "symlist.h"
struct symlist *symlist_create() {
struct symlist *ret;
ret = malloc(sizeof(struct symlist));
ret->size = 1;
ret->pos = 0;
ret->lastsym = 0;
ret->array = malloc(ret->size * sizeof(struct symlist_el));
return ret;
}
void symlist_add(struct symlist *sl, char *name) {
if (sl->pos >= sl->size) {
sl->size *= 2;
sl->array =
realloc(sl->array, sl->size * sizeof(struct symlist_el));
}
sl->array[sl->pos].name = name;
sl->array[sl->pos].prompt = false;
sl->array[sl->pos].def = NULL;
sl->array[sl->pos].dep = NULL;
sl->array[sl->pos].rev_dep = NULL;
output_push_symbol((unsigned) sl->pos + 1, name);
sl->pos++;
}
void symlist_closesym(struct symlist *sl) {
sl->lastsym = (unsigned) sl->pos;
}
unsigned symlist_adddummy(struct symlist *sl) {
if (sl->lastsym == 0)
fprintf(stderr,
"W: symlist adddummy, but lastsym is zero. This shouldn't happen.");
return sl->lastsym++;
}
struct symlist_el *symlist_find(struct symlist *sl, char *name) {
size_t i = symlist_id(sl, name);
if (i == 0)
return NULL;
else
return &(sl->array[i - 1]);
}
// TODO faster implementation? Maybe binary search tree?
size_t symlist_id(struct symlist * sl, char *name) {
if (name == NULL) {
printf("Aha\n");
return 0;
}
size_t i = 0;
while (i < sl->pos) {
if (!strcmp(name, sl->array[i].name))
return i + 1;
i++;
}
return 0;
}
void symlist_free(struct symlist *sl) {
free(sl->array);
free(sl);
}
|
