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
|
/*
arfnet2-search: Fast file indexer and search
Copyright (C) 2023 arf20 (Ángel Ruiz Fernandez)
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 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
index.c: Efficient fast file index
*/
#include "index.h"
#include <sys/types.h>
#include <dirent.h>
#include <errno.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <magic.h>
typedef struct map_s {
struct node_s *map;
size_t size, capacity;
} map_t;
struct node_s {
node_data_t *data;
struct node_s *next;
map_t *child;
};
static magic_t magic_cookie = NULL;
size_t
hash(const char *s, int mod)
{
size_t hash = 0;
if (!s)
return 0;
while (*s)
hash = hash * 31 + *s++;
return hash % mod;
}
map_t *
map_new(size_t icapacity)
{
map_t *map = malloc(sizeof(map_t));
map->map = malloc(sizeof(struct node_s) * icapacity);
memset(map->map, 0, sizeof(struct node_s) * icapacity);
map->capacity = icapacity;
map->size = 0;
return map;
}
void
map_insert(map_t *map, const char *key, node_data_t *data, map_t *child)
{
struct node_s *node = &map->map[hash(key, map->capacity)];
if (node->data) {
for (; node->next; node = node->next);
node->next = malloc(sizeof(struct node_s));
node->next->data = data;
node->next->child = child;
node->next->next = NULL;
} else {
node->data = data;
node->child = child;
}
}
int
index_init()
{
magic_cookie = magic_open(MAGIC_MIME);
if (!magic_cookie) {
fprintf(stderr, "[index] error magic_open()\n");
return -1;
}
if (magic_load(magic_cookie, NULL) < 0) {
fprintf(stderr, "[index] error magic_load(): %s\n",
magic_error(magic_cookie));
return -1;
}
return 0;
}
void
index_deinit()
{
magic_close(magic_cookie);
}
map_t *
index_new(size_t icapacity, const char *dir, int examine)
{
DIR *dirp = opendir(dir);
if (!dirp) {
fprintf(stderr, "[index] error opening directory %s: %s\n", dir,
strerror(errno));
return NULL;
}
map_t *map = map_new(icapacity);
char path[4096];
struct dirent *de = NULL;
while ((de = readdir(dirp))) {
if (de->d_name[0] == '.') {
if (de->d_name[1] == '\0')
continue;
else if (de->d_name[1] == '.')
if (de->d_name[2] == '\0')
continue;
}
snprintf(path, 4096, "%s/%s", dir, de->d_name);
/* stat it */
node_data_t *data = malloc(sizeof(node_data_t));
data->name = strdup(de->d_name);
if (stat(path, &data->stat) < 0) {
fprintf(stderr, "[index] error stat() %s: %s\n", path,
strerror(errno));
free(data);
data = NULL;
}
/* examine */
if (examine) {
data->mime = magic_file(magic_cookie, path);
if (!data->mime)
fprintf(stderr, "[index] error magic_file() %s: %s\n", path,
magic_error(magic_cookie));
}
/* recurse */
map_t *child = NULL;
if (de->d_type == DT_DIR) {
index_new(icapacity, path);
}
map_insert(map, de->d_name, data, child);
}
return map;
}
int
index_lookup(index_t index, lookup_type_t type, const char *query,
const node_data_t **results)
{
}
void
index_destroy(index_t index)
{
}
|
