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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
|
#include "db.h"
database *newDatabase(char *name){
database *db = malloc(sizeof(database));
memcpy(db->name, name, len(name)+1);
db->lfiles = newLtable(0);
db->ltags = newLtable(0);
db->cfiles = newCtable(0);
db->ctags = newCtable(0);
db->hfiles = NULL;
db->htags = NULL;
db->map = newMtable(0);
return db;
}
database *loadDatabase(const char* path){
FILE *fp = fopen(path, "rb");
char *header = calloc(2, sizeof(char));
fread(header, sizeof(char), 2, fp);
if(!sameStr(header, "DB")){
fprintf(stderr, "Header is '%s' not 'DB'\n", header);
}
char name[32];
fread(&name, sizeof(char), 32, fp);
database *db = newDatabase(name);
db->lfiles = loadLtable(fp);
db->ltags = loadLtable(fp);
db->cfiles = loadCtable(fp);
db->ctags = loadCtable(fp);
db->hfiles = loadAVLTree(fp);
db->htags = loadAVLTree(fp);
db->map = loadMtable(fp);
char *end = calloc(3, sizeof(char));
fread(end, sizeof(char), 3, fp);
if(!sameStr(end, "END")){
fprintf(stderr, "End is '%s' not 'END'\n", end);
}
fclose(fp);
return db;
}
int storeDatabase(database *db, const char *path){
FILE *fp = fopen(path, "wb");
char header[2] = "DB";
fwrite(header, sizeof(char), 2, fp);
fwrite(db->name, sizeof(char), 32, fp);
storeLtable(db->lfiles, fp);
storeLtable(db->ltags, fp);
storeCtable(db->cfiles, fp);
storeCtable(db->ctags, fp);
storeAVLTree(db->hfiles, fp);
storeAVLTree(db->htags, fp);
storeMtable(db->map, fp);
char end[3] = "END";
fwrite(end, sizeof(char), 3, fp);
fclose(fp);
return 0;
}
static void increaseCount(ctable *ct, uint64_t i){
ct->table[i]++;
}
uint64_t addFile(database *db, char *file){
uint32_t l;
file = normalizeStrLimit(file, &l, MAXPATH-1);
uint64_t h = crc64(0, file, l);
uint64_t i = nodeSearch(db->hfiles, h);
if(i == -1){
ltableAdd(db->lfiles, file);
ctableAdd(db->cfiles, 0);
i = db->lfiles->size-1;
db->hfiles = insertNode(db->hfiles, h, i);
}
increaseCount(db->cfiles, i);
return i;
}
uint64_t addTag(database *db, char *tag){
uint32_t l;
tag = normalizeStrLimit(tag, &l, MAXPATH-1);
uint64_t h = crc64(0, tag, l);
uint64_t i = nodeSearch(db->htags, h);
if(i == -1){
ltableAdd(db->ltags, tag);
ctableAdd(db->ctags, 0);
i = db->ltags->size-1;
db->htags = insertNode(db->htags, h, i);
}
increaseCount(db->ctags, i);
return i;
}
static int addRelation(database *db, relation r){
if(mtableSearch(db->map, r) != -1){
return -1;
}
mtableAdd(db->map, r);
return 0;
}
int addFileTag(database *db, char *file, char *tag){
uint64_t fi = addFile(db, file), ti = addTag(db, tag);
addRelation(db, (relation){.file = fi, .tag = ti});
return 0;
}
int addFileTags(database *db, char *file, int ntags, ...){
va_list tags;
va_start(tags, ntags);
for(uint64_t i = 0; i < ntags; ++i){
char *tag = va_arg(tags, char*);
addFileTag(db, file, tag);
}
va_end(tags);
return 0;
}
// Stores in r a list with the indexes of the first n tags that this file has
// If n is 0 or lower, it returns all of them. Stores in rl the length of r
int searchFile(database *db, char *file, uint64_t n, uint64_t **r, uint64_t *rl){
uint32_t l;
file = normalizeStrLimit(file, &l, MAXPATH-1);
uint64_t h = crc64(0, file, l);
uint64_t fi = nodeSearch(db->hfiles, h);
if(fi == -1){
return -1;
}
*rl = 0;
for(uint64_t i = 0; i < db->map->size; ++i){
if(n < 1 || *rl < n){
if(db->map->table[i].file == fi){
++(*rl);
}
}
}
*r = malloc((*rl)*sizeof(uint64_t));
uint64_t c = 0;
for(uint64_t i = 0; i < db->map->size && c < *rl; ++i){
if(db->map->table[i].file == fi){
(*r)[c++] = db->map->table[i].tag;
}
}
return 0;
}
// Stores in r a list with the indexes of the first n files that have this tag
// If n is 0 or lower, it returns all of them. Stores in rl the length of r
int searchTag(database *db, char *tag, uint64_t n, uint64_t **r, uint64_t *rl){
uint32_t l;
tag = normalizeStrLimit(tag, &l, MAXPATH-1);
uint64_t h = crc64(0, tag, l);
uint64_t ti = nodeSearch(db->htags, h);
if(ti == -1){
return -1;
}
*rl = 0;
for(uint64_t i = 0; i < db->map->size; ++i){
if(n < 1 || *rl < n){
if(db->map->table[i].tag == ti){
++(*rl);
}
}
}
*r = malloc((*rl)*sizeof(uint64_t));
uint64_t c = 0;
for(uint64_t i = 0; i < db->map->size && c < *rl; ++i){
if(db->map->table[i].tag == ti){
(*r)[c++] = db->map->table[i].file;
}
}
return 0;
}
void printDatabase(database *db){
for(uint64_t i = 0; i < db->map->size; ++i){
printf("%s -> %s\n", db->lfiles->table[db->map->table[i].file], db->ltags->table[db->map->table[i].tag]);
}
printf("\n");
}
void debugAVLtree(node *n){
if(n != NULL){
printf("\t\t+%" PRIu64 " -> %" PRIu64 "\n", n->h, n->i);
debugAVLtree(n->left);
debugAVLtree(n->right);
}
}
void debugDatabase(database *db){
printf("\n");
printf("Name: %s\n", db->name);
printf("\t-lfiles: %d\n", db->lfiles->size);
for(uint64_t i = 0; i < db->lfiles->size; ++i){
printf("\t\t+%s (%" PRIu64 ")\n", db->lfiles->table[i], db->cfiles->table[i]);
}
printf("\t-ltags: %d\n", db->ltags->size);
for(uint64_t i = 0; i < db->ltags->size; ++i){
printf("\t\t+%s (%" PRIu64 ")\n", db->ltags->table[i], db->ctags->table[i]);
}
printf("\t-hfiles: %d\n", height(db->hfiles));
debugAVLtree(db->hfiles);
printf("\t-htags: %d\n", height(db->htags));
debugAVLtree(db->htags);
printf("\t-map: %d\n", db->map->size);
for(uint64_t i = 0; i < db->map->size; ++i){
printf("\t\t+%" PRIu64 ":%" PRIu64 "\n", db->map->table[i].file, db->map->table[i].tag);
}
printf("\n");
}
|
