Lucas De Marchi | 8f923be | 2011-12-03 04:28:49 -0200 | [diff] [blame] | 1 | /* |
| 2 | * libkmod - interface to kernel module operations |
| 3 | * |
Lucas De Marchi | 8f923be | 2011-12-03 04:28:49 -0200 | [diff] [blame] | 4 | * Copyright (C) 2011 ProFUSION embedded systems |
| 5 | * |
| 6 | * This library is free software; you can redistribute it and/or |
| 7 | * modify it under the terms of the GNU Lesser General Public |
Lucas De Marchi | cb451f3 | 2011-12-12 18:24:35 -0200 | [diff] [blame] | 8 | * License as published by the Free Software Foundation; either |
| 9 | * version 2.1 of the License, or (at your option) any later version. |
Lucas De Marchi | 8f923be | 2011-12-03 04:28:49 -0200 | [diff] [blame] | 10 | * |
| 11 | * This library is distributed in the hope that it will be useful, |
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 14 | * Lesser General Public License for more details. |
| 15 | * |
| 16 | * You should have received a copy of the GNU Lesser General Public |
| 17 | * License along with this library; if not, write to the Free Software |
| 18 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA |
| 19 | */ |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 20 | |
| 21 | #include <arpa/inet.h> /* htonl */ |
| 22 | #include <stdlib.h> |
| 23 | #include <stdio.h> |
| 24 | #include <string.h> |
| 25 | #include <errno.h> |
| 26 | #include <fnmatch.h> |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 27 | #include <assert.h> |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 28 | |
| 29 | #include "libkmod-private.h" |
| 30 | #include "libkmod-index.h" |
| 31 | #include "macro.h" |
| 32 | |
Lucas De Marchi | 8f923be | 2011-12-03 04:28:49 -0200 | [diff] [blame] | 33 | /* index.c: module index file shared functions for modprobe and depmod */ |
| 34 | |
Gustavo Sverzut Barbieri | 148226e | 2011-12-10 11:53:51 -0200 | [diff] [blame] | 35 | #define INDEX_CHILDMAX 128 |
| 36 | |
| 37 | /* Disk format: |
| 38 | |
| 39 | uint32_t magic = INDEX_MAGIC; |
| 40 | uint32_t version = INDEX_VERSION; |
| 41 | uint32_t root_offset; |
| 42 | |
| 43 | (node_offset & INDEX_NODE_MASK) specifies the file offset of nodes: |
| 44 | |
| 45 | char[] prefix; // nul terminated |
| 46 | |
| 47 | char first; |
| 48 | char last; |
| 49 | uint32_t children[last - first + 1]; |
| 50 | |
| 51 | uint32_t value_count; |
| 52 | struct { |
| 53 | uint32_t priority; |
| 54 | char[] value; // nul terminated |
| 55 | } values[value_count]; |
| 56 | |
| 57 | (node_offset & INDEX_NODE_FLAGS) indicates which fields are present. |
| 58 | Empty prefixes are omitted, leaf nodes omit the three child-related fields. |
| 59 | |
| 60 | This could be optimised further by adding a sparse child format |
| 61 | (indicated using a new flag). |
| 62 | */ |
| 63 | |
| 64 | /* Format of node offsets within index file */ |
| 65 | enum node_offset { |
| 66 | INDEX_NODE_FLAGS = 0xF0000000, /* Flags in high nibble */ |
| 67 | INDEX_NODE_PREFIX = 0x80000000, |
| 68 | INDEX_NODE_VALUES = 0x40000000, |
| 69 | INDEX_NODE_CHILDS = 0x20000000, |
| 70 | |
| 71 | INDEX_NODE_MASK = 0x0FFFFFFF, /* Offset value */ |
| 72 | }; |
| 73 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 74 | void index_values_free(struct index_value *values) |
| 75 | { |
| 76 | while (values) { |
| 77 | struct index_value *value = values; |
| 78 | |
| 79 | values = value->next; |
| 80 | free(value); |
| 81 | } |
| 82 | } |
| 83 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 84 | static int add_value(struct index_value **values, |
Gustavo Sverzut Barbieri | 1433ba9 | 2011-12-08 14:50:29 -0200 | [diff] [blame] | 85 | const char *value, unsigned len, unsigned int priority) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 86 | { |
| 87 | struct index_value *v; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 88 | |
| 89 | /* find position to insert value */ |
| 90 | while (*values && (*values)->priority < priority) |
| 91 | values = &(*values)->next; |
| 92 | |
Gustavo Sverzut Barbieri | 1433ba9 | 2011-12-08 14:50:29 -0200 | [diff] [blame] | 93 | v = malloc(sizeof(struct index_value) + len + 1); |
| 94 | if (!v) |
| 95 | return -1; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 96 | v->next = *values; |
| 97 | v->priority = priority; |
Gustavo Sverzut Barbieri | 1433ba9 | 2011-12-08 14:50:29 -0200 | [diff] [blame] | 98 | v->len = len; |
| 99 | memcpy(v->value, value, len); |
| 100 | v->value[len] = '\0'; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 101 | *values = v; |
| 102 | |
Gustavo Sverzut Barbieri | 558b020 | 2011-12-08 16:36:48 -0200 | [diff] [blame] | 103 | return 0; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 104 | } |
| 105 | |
Lucas De Marchi | 9368888 | 2011-12-02 10:05:31 -0200 | [diff] [blame] | 106 | static void read_error(void) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 107 | { |
| 108 | fatal("Module index: unexpected error: %s\n" |
| 109 | "Try re-running depmod\n", errno ? strerror(errno) : "EOF"); |
| 110 | } |
| 111 | |
| 112 | static int read_char(FILE *in) |
| 113 | { |
| 114 | int ch; |
| 115 | |
| 116 | errno = 0; |
| 117 | ch = getc_unlocked(in); |
| 118 | if (ch == EOF) |
| 119 | read_error(); |
| 120 | return ch; |
| 121 | } |
| 122 | |
| 123 | static uint32_t read_long(FILE *in) |
| 124 | { |
| 125 | uint32_t l; |
| 126 | |
| 127 | errno = 0; |
| 128 | if (fread(&l, sizeof(uint32_t), 1, in) <= 0) |
| 129 | read_error(); |
| 130 | return ntohl(l); |
| 131 | } |
| 132 | |
| 133 | /* |
| 134 | * Buffer abstract data type |
| 135 | * |
| 136 | * Used internally to store the current path during tree traversal. |
| 137 | * They help build wildcard key strings to pass to fnmatch(), |
| 138 | * as well as building values of matching keys. |
| 139 | */ |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 140 | struct buffer { |
| 141 | char *bytes; |
| 142 | unsigned size; |
| 143 | unsigned used; |
| 144 | }; |
| 145 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 146 | #define BUF_STEP (2048) |
| 147 | static bool buf_grow(struct buffer *buf, size_t newsize) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 148 | { |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 149 | void *tmp; |
| 150 | size_t sz; |
| 151 | |
| 152 | if (newsize % BUF_STEP == 0) |
| 153 | sz = newsize; |
| 154 | else |
| 155 | sz = ((newsize / BUF_STEP) + 1) * BUF_STEP; |
| 156 | |
Gustavo Sverzut Barbieri | 435ad78 | 2011-12-08 16:35:08 -0200 | [diff] [blame] | 157 | if (buf->size == sz) |
| 158 | return true; |
| 159 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 160 | tmp = realloc(buf->bytes, sz); |
| 161 | if (sz > 0 && tmp == NULL) |
| 162 | return false; |
| 163 | buf->bytes = tmp; |
| 164 | buf->size = sz; |
| 165 | return true; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 166 | } |
| 167 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 168 | static void buf_init(struct buffer *buf) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 169 | { |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 170 | buf->bytes = NULL; |
| 171 | buf->size = 0; |
| 172 | buf->used = 0; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 173 | } |
| 174 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 175 | static void buf_release(struct buffer *buf) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 176 | { |
| 177 | free(buf->bytes); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 178 | } |
| 179 | |
| 180 | /* Destroy buffer and return a copy as a C string */ |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 181 | static char *buf_steal(struct buffer *buf) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 182 | { |
| 183 | char *bytes; |
| 184 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 185 | bytes = realloc(buf->bytes, buf->used + 1); |
| 186 | if (!bytes) { |
| 187 | free(buf->bytes); |
| 188 | return NULL; |
| 189 | } |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 190 | bytes[buf->used] = '\0'; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 191 | return bytes; |
| 192 | } |
| 193 | |
| 194 | /* Return a C string owned by the buffer |
| 195 | (invalidated if the buffer is changed). |
| 196 | */ |
| 197 | static const char *buf_str(struct buffer *buf) |
| 198 | { |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 199 | if (!buf_grow(buf, buf->used + 1)) |
| 200 | return NULL; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 201 | buf->bytes[buf->used] = '\0'; |
| 202 | return buf->bytes; |
| 203 | } |
| 204 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 205 | static bool buf_pushchar(struct buffer *buf, char ch) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 206 | { |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 207 | if (!buf_grow(buf, buf->used + 1)) |
| 208 | return false; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 209 | buf->bytes[buf->used] = ch; |
| 210 | buf->used++; |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 211 | return true; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 212 | } |
| 213 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 214 | static unsigned buf_freadchars(struct buffer *buf, FILE *in) |
| 215 | { |
| 216 | unsigned i = 0; |
| 217 | int ch; |
| 218 | |
| 219 | while ((ch = read_char(in))) { |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 220 | if (!buf_pushchar(buf, ch)) |
| 221 | break; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 222 | i++; |
| 223 | } |
| 224 | |
| 225 | return i; |
| 226 | } |
| 227 | |
| 228 | static void buf_popchar(struct buffer *buf) |
| 229 | { |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 230 | assert(buf->used > 0); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 231 | buf->used--; |
| 232 | } |
| 233 | |
| 234 | static void buf_popchars(struct buffer *buf, unsigned n) |
| 235 | { |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 236 | assert(buf->used >= n); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 237 | buf->used -= n; |
| 238 | } |
| 239 | |
| 240 | static void buf_clear(struct buffer *buf) |
| 241 | { |
| 242 | buf->used = 0; |
| 243 | } |
| 244 | |
| 245 | /* |
Lucas De Marchi | eb8bb32 | 2011-12-02 10:23:02 -0200 | [diff] [blame] | 246 | * Index file searching |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 247 | */ |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 248 | struct index_node_f { |
| 249 | FILE *file; |
| 250 | char *prefix; /* path compression */ |
| 251 | struct index_value *values; |
| 252 | unsigned char first; /* range of child nodes */ |
| 253 | unsigned char last; |
| 254 | uint32_t children[0]; |
| 255 | }; |
| 256 | |
| 257 | static struct index_node_f *index_read(FILE *in, uint32_t offset) |
| 258 | { |
| 259 | struct index_node_f *node; |
| 260 | char *prefix; |
| 261 | int i, child_count = 0; |
| 262 | |
| 263 | if ((offset & INDEX_NODE_MASK) == 0) |
| 264 | return NULL; |
| 265 | |
| 266 | fseek(in, offset & INDEX_NODE_MASK, SEEK_SET); |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 267 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 268 | if (offset & INDEX_NODE_PREFIX) { |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 269 | struct buffer buf; |
| 270 | buf_init(&buf); |
| 271 | buf_freadchars(&buf, in); |
| 272 | prefix = buf_steal(&buf); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 273 | } else |
| 274 | prefix = NOFAIL(strdup("")); |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 275 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 276 | if (offset & INDEX_NODE_CHILDS) { |
| 277 | char first = read_char(in); |
| 278 | char last = read_char(in); |
| 279 | child_count = last - first + 1; |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 280 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 281 | node = NOFAIL(malloc(sizeof(struct index_node_f) + |
| 282 | sizeof(uint32_t) * child_count)); |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 283 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 284 | node->first = first; |
| 285 | node->last = last; |
| 286 | |
| 287 | for (i = 0; i < child_count; i++) |
| 288 | node->children[i] = read_long(in); |
| 289 | } else { |
| 290 | node = NOFAIL(malloc(sizeof(struct index_node_f))); |
| 291 | node->first = INDEX_CHILDMAX; |
| 292 | node->last = 0; |
| 293 | } |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 294 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 295 | node->values = NULL; |
| 296 | if (offset & INDEX_NODE_VALUES) { |
| 297 | int value_count; |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 298 | struct buffer buf; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 299 | const char *value; |
| 300 | unsigned int priority; |
| 301 | |
| 302 | value_count = read_long(in); |
| 303 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 304 | buf_init(&buf); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 305 | while (value_count--) { |
| 306 | priority = read_long(in); |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 307 | buf_freadchars(&buf, in); |
| 308 | value = buf_str(&buf); |
Gustavo Sverzut Barbieri | 1433ba9 | 2011-12-08 14:50:29 -0200 | [diff] [blame] | 309 | add_value(&node->values, value, buf.used, priority); |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 310 | buf_clear(&buf); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 311 | } |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 312 | buf_release(&buf); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 313 | } |
| 314 | |
| 315 | node->prefix = prefix; |
| 316 | node->file = in; |
| 317 | return node; |
| 318 | } |
| 319 | |
| 320 | static void index_close(struct index_node_f *node) |
| 321 | { |
| 322 | free(node->prefix); |
| 323 | index_values_free(node->values); |
| 324 | free(node); |
| 325 | } |
| 326 | |
| 327 | struct index_file { |
| 328 | FILE *file; |
| 329 | uint32_t root_offset; |
| 330 | }; |
| 331 | |
| 332 | /* Failures are silent; modprobe will fall back to text files */ |
| 333 | struct index_file *index_file_open(const char *filename) |
| 334 | { |
| 335 | FILE *file; |
| 336 | uint32_t magic, version; |
| 337 | struct index_file *new; |
| 338 | |
Cristian RodrÃguez | 79e5ea9 | 2011-12-16 02:49:54 -0300 | [diff] [blame] | 339 | file = fopen(filename, "re"); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 340 | if (!file) |
| 341 | return NULL; |
| 342 | errno = EINVAL; |
| 343 | |
| 344 | magic = read_long(file); |
Cristian RodrÃguez | 67d94ad | 2011-12-23 03:06:56 -0200 | [diff] [blame^] | 345 | if (magic != INDEX_MAGIC) { |
| 346 | fclose(file); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 347 | return NULL; |
Cristian RodrÃguez | 67d94ad | 2011-12-23 03:06:56 -0200 | [diff] [blame^] | 348 | } |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 349 | |
| 350 | version = read_long(file); |
| 351 | if (version >> 16 != INDEX_VERSION_MAJOR) |
| 352 | return NULL; |
| 353 | |
| 354 | new = NOFAIL(malloc(sizeof(struct index_file))); |
| 355 | new->file = file; |
| 356 | new->root_offset = read_long(new->file); |
| 357 | |
| 358 | errno = 0; |
| 359 | return new; |
| 360 | } |
| 361 | |
Lucas De Marchi | 0fbdfef | 2011-12-02 09:56:22 -0200 | [diff] [blame] | 362 | void index_file_close(struct index_file *idx) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 363 | { |
Lucas De Marchi | 0fbdfef | 2011-12-02 09:56:22 -0200 | [diff] [blame] | 364 | fclose(idx->file); |
| 365 | free(idx); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 366 | } |
| 367 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 368 | static struct index_node_f *index_readroot(struct index_file *in) |
| 369 | { |
| 370 | return index_read(in->file, in->root_offset); |
| 371 | } |
| 372 | |
| 373 | static struct index_node_f *index_readchild(const struct index_node_f *parent, |
| 374 | int ch) |
| 375 | { |
Lucas De Marchi | e71970a | 2011-12-02 10:27:15 -0200 | [diff] [blame] | 376 | if (parent->first <= ch && ch <= parent->last) { |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 377 | return index_read(parent->file, |
| 378 | parent->children[ch - parent->first]); |
Lucas De Marchi | e71970a | 2011-12-02 10:27:15 -0200 | [diff] [blame] | 379 | } |
| 380 | |
| 381 | return NULL; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 382 | } |
| 383 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 384 | static char *index_search__node(struct index_node_f *node, const char *key, int i) |
| 385 | { |
| 386 | char *value; |
| 387 | struct index_node_f *child; |
| 388 | int ch; |
| 389 | int j; |
| 390 | |
| 391 | while(node) { |
| 392 | for (j = 0; node->prefix[j]; j++) { |
| 393 | ch = node->prefix[j]; |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 394 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 395 | if (ch != key[i+j]) { |
| 396 | index_close(node); |
| 397 | return NULL; |
| 398 | } |
| 399 | } |
Lucas De Marchi | e71970a | 2011-12-02 10:27:15 -0200 | [diff] [blame] | 400 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 401 | i += j; |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 402 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 403 | if (key[i] == '\0') { |
| 404 | if (node->values) { |
| 405 | value = strdup(node->values[0].value); |
| 406 | index_close(node); |
| 407 | return value; |
| 408 | } else { |
| 409 | return NULL; |
| 410 | } |
| 411 | } |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 412 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 413 | child = index_readchild(node, key[i]); |
| 414 | index_close(node); |
| 415 | node = child; |
| 416 | i++; |
| 417 | } |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 418 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 419 | return NULL; |
| 420 | } |
| 421 | |
| 422 | /* |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 423 | * Search the index for a key |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 424 | * |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 425 | * Returns the value of the first match |
| 426 | * |
| 427 | * The recursive functions free their node argument (using index_close). |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 428 | */ |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 429 | char *index_search(struct index_file *in, const char *key) |
| 430 | { |
| 431 | struct index_node_f *root; |
| 432 | char *value; |
| 433 | |
| 434 | root = index_readroot(in); |
| 435 | value = index_search__node(root, key, 0); |
| 436 | |
| 437 | return value; |
| 438 | } |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 439 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 440 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 441 | |
| 442 | /* Level 4: add all the values from a matching node */ |
| 443 | static void index_searchwild__allvalues(struct index_node_f *node, |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 444 | struct index_value **out) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 445 | { |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 446 | struct index_value *v; |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 447 | |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 448 | for (v = node->values; v != NULL; v = v->next) |
Gustavo Sverzut Barbieri | 1433ba9 | 2011-12-08 14:50:29 -0200 | [diff] [blame] | 449 | add_value(out, v->value, v->len, v->priority); |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 450 | |
| 451 | index_close(node); |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 452 | } |
| 453 | |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 454 | /* |
| 455 | * Level 3: traverse a sub-keyspace which starts with a wildcard, |
| 456 | * looking for matches. |
| 457 | */ |
| 458 | static void index_searchwild__all(struct index_node_f *node, int j, |
| 459 | struct buffer *buf, |
| 460 | const char *subkey, |
| 461 | struct index_value **out) |
| 462 | { |
| 463 | int pushed = 0; |
| 464 | int ch; |
| 465 | |
| 466 | while (node->prefix[j]) { |
| 467 | ch = node->prefix[j]; |
| 468 | |
| 469 | buf_pushchar(buf, ch); |
| 470 | pushed++; |
| 471 | j++; |
| 472 | } |
| 473 | |
| 474 | for (ch = node->first; ch <= node->last; ch++) { |
| 475 | struct index_node_f *child = index_readchild(node, ch); |
| 476 | |
| 477 | if (!child) |
| 478 | continue; |
| 479 | |
| 480 | buf_pushchar(buf, ch); |
| 481 | index_searchwild__all(child, 0, buf, subkey, out); |
| 482 | buf_popchar(buf); |
| 483 | } |
| 484 | |
| 485 | if (node->values) { |
| 486 | if (fnmatch(buf_str(buf), subkey, 0) == 0) |
| 487 | index_searchwild__allvalues(node, out); |
Gustavo Sverzut Barbieri | 27fdf63 | 2011-12-10 13:28:18 -0200 | [diff] [blame] | 488 | else |
| 489 | index_close(node); |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 490 | } else { |
| 491 | index_close(node); |
| 492 | } |
| 493 | |
| 494 | buf_popchars(buf, pushed); |
| 495 | } |
| 496 | |
| 497 | /* Level 2: descend the tree (until we hit a wildcard) */ |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 498 | static void index_searchwild__node(struct index_node_f *node, |
| 499 | struct buffer *buf, |
| 500 | const char *key, int i, |
| 501 | struct index_value **out) |
| 502 | { |
| 503 | struct index_node_f *child; |
| 504 | int j; |
| 505 | int ch; |
| 506 | |
| 507 | while(node) { |
| 508 | for (j = 0; node->prefix[j]; j++) { |
| 509 | ch = node->prefix[j]; |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 510 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 511 | if (ch == '*' || ch == '?' || ch == '[') { |
| 512 | index_searchwild__all(node, j, buf, |
| 513 | &key[i+j], out); |
| 514 | return; |
| 515 | } |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 516 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 517 | if (ch != key[i+j]) { |
| 518 | index_close(node); |
| 519 | return; |
| 520 | } |
| 521 | } |
Lucas De Marchi | e71970a | 2011-12-02 10:27:15 -0200 | [diff] [blame] | 522 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 523 | i += j; |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 524 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 525 | child = index_readchild(node, '*'); |
| 526 | if (child) { |
| 527 | buf_pushchar(buf, '*'); |
| 528 | index_searchwild__all(child, 0, buf, &key[i], out); |
| 529 | buf_popchar(buf); |
| 530 | } |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 531 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 532 | child = index_readchild(node, '?'); |
| 533 | if (child) { |
| 534 | buf_pushchar(buf, '?'); |
| 535 | index_searchwild__all(child, 0, buf, &key[i], out); |
| 536 | buf_popchar(buf); |
| 537 | } |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 538 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 539 | child = index_readchild(node, '['); |
| 540 | if (child) { |
| 541 | buf_pushchar(buf, '['); |
| 542 | index_searchwild__all(child, 0, buf, &key[i], out); |
| 543 | buf_popchar(buf); |
| 544 | } |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 545 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 546 | if (key[i] == '\0') { |
| 547 | index_searchwild__allvalues(node, out); |
| 548 | |
| 549 | return; |
| 550 | } |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 551 | |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 552 | child = index_readchild(node, key[i]); |
| 553 | index_close(node); |
| 554 | node = child; |
| 555 | i++; |
| 556 | } |
| 557 | } |
| 558 | |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 559 | /* |
| 560 | * Search the index for a key. The index may contain wildcards. |
| 561 | * |
| 562 | * Returns a list of all the values of matching keys. |
| 563 | */ |
| 564 | struct index_value *index_searchwild(struct index_file *in, const char *key) |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 565 | { |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 566 | struct index_node_f *root = index_readroot(in); |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 567 | struct buffer buf; |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 568 | struct index_value *out = NULL; |
Lucas De Marchi | a7be73b | 2011-11-30 15:59:36 -0200 | [diff] [blame] | 569 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 570 | buf_init(&buf); |
| 571 | index_searchwild__node(root, &buf, key, 0, &out); |
| 572 | buf_release(&buf); |
Lucas De Marchi | 1d152ac | 2011-12-02 10:15:00 -0200 | [diff] [blame] | 573 | return out; |
Lucas De Marchi | e8847fd | 2011-11-30 15:23:28 -0200 | [diff] [blame] | 574 | } |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 575 | |
| 576 | #include <sys/mman.h> |
| 577 | #include <sys/stat.h> |
| 578 | #include <unistd.h> |
| 579 | |
Gustavo Sverzut Barbieri | 15c1c14 | 2011-12-10 11:44:31 -0200 | [diff] [blame] | 580 | static const char _idx_empty_str[] = ""; |
| 581 | |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 582 | /**************************************************************************/ |
| 583 | /* |
| 584 | * Alternative implementation, using mmap to map all the file to memory when |
| 585 | * starting |
| 586 | */ |
| 587 | struct index_mm { |
| 588 | struct kmod_ctx *ctx; |
| 589 | void *mm; |
| 590 | uint32_t root_offset; |
| 591 | size_t size; |
| 592 | }; |
| 593 | |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 594 | struct index_mm_value { |
| 595 | unsigned int priority; |
| 596 | unsigned int len; |
| 597 | const char *value; |
| 598 | }; |
| 599 | |
| 600 | struct index_mm_value_array { |
| 601 | struct index_mm_value *values; |
| 602 | unsigned int len; |
| 603 | }; |
| 604 | |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 605 | struct index_mm_node { |
| 606 | struct index_mm *idx; |
Gustavo Sverzut Barbieri | 15c1c14 | 2011-12-10 11:44:31 -0200 | [diff] [blame] | 607 | const char *prefix; /* mmape'd value */ |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 608 | struct index_mm_value_array values; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 609 | unsigned char first; |
| 610 | unsigned char last; |
| 611 | uint32_t children[]; |
| 612 | }; |
| 613 | |
| 614 | static inline uint32_t read_long_mm(void **p) |
| 615 | { |
Gustavo Sverzut Barbieri | fc2d835 | 2011-12-10 11:36:35 -0200 | [diff] [blame] | 616 | uint8_t *addr = *(uint8_t **)p; |
| 617 | uint32_t v; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 618 | |
Gustavo Sverzut Barbieri | fc2d835 | 2011-12-10 11:36:35 -0200 | [diff] [blame] | 619 | /* addr may be unalined to uint32_t */ |
| 620 | memcpy(&v, addr, sizeof(uint32_t)); |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 621 | |
Gustavo Sverzut Barbieri | fc2d835 | 2011-12-10 11:36:35 -0200 | [diff] [blame] | 622 | *p = addr + sizeof(uint32_t); |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 623 | return ntohl(v); |
| 624 | } |
| 625 | |
| 626 | static inline uint8_t read_char_mm(void **p) |
| 627 | { |
Gustavo Sverzut Barbieri | fc2d835 | 2011-12-10 11:36:35 -0200 | [diff] [blame] | 628 | uint8_t *addr = *(uint8_t **)p; |
| 629 | uint8_t v = *addr; |
| 630 | *p = addr + sizeof(uint8_t); |
| 631 | return v; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 632 | } |
| 633 | |
Gustavo Sverzut Barbieri | 1433ba9 | 2011-12-08 14:50:29 -0200 | [diff] [blame] | 634 | static inline char *read_chars_mm(void **p, unsigned *rlen) |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 635 | { |
Gustavo Sverzut Barbieri | fc2d835 | 2011-12-10 11:36:35 -0200 | [diff] [blame] | 636 | char *addr = *(char **)p; |
| 637 | size_t len = *rlen = strlen(addr); |
| 638 | *p = addr + len + 1; |
| 639 | return addr; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 640 | } |
| 641 | |
| 642 | static struct index_mm_node *index_mm_read_node(struct index_mm *idx, |
| 643 | uint32_t offset) { |
| 644 | void *p = idx->mm; |
| 645 | struct index_mm_node *node; |
Gustavo Sverzut Barbieri | 15c1c14 | 2011-12-10 11:44:31 -0200 | [diff] [blame] | 646 | const char *prefix; |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 647 | int i, child_count, value_count, children_padding; |
| 648 | uint32_t children[INDEX_CHILDMAX]; |
| 649 | char first, last; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 650 | |
| 651 | if ((offset & INDEX_NODE_MASK) == 0) |
| 652 | return NULL; |
| 653 | |
| 654 | p = (char *)p + (offset & INDEX_NODE_MASK); |
| 655 | |
Gustavo Sverzut Barbieri | 15c1c14 | 2011-12-10 11:44:31 -0200 | [diff] [blame] | 656 | if (offset & INDEX_NODE_PREFIX) { |
| 657 | unsigned len; |
| 658 | prefix = read_chars_mm(&p, &len); |
| 659 | } else |
| 660 | prefix = _idx_empty_str; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 661 | |
| 662 | if (offset & INDEX_NODE_CHILDS) { |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 663 | first = read_char_mm(&p); |
| 664 | last = read_char_mm(&p); |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 665 | child_count = last - first + 1; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 666 | for (i = 0; i < child_count; i++) |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 667 | children[i] = read_long_mm(&p); |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 668 | } else { |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 669 | first = INDEX_CHILDMAX; |
| 670 | last = 0; |
| 671 | child_count = 0; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 672 | } |
| 673 | |
Gustavo Sverzut Barbieri | c6824b6 | 2011-12-21 18:23:58 -0200 | [diff] [blame] | 674 | children_padding = (sizeof(struct index_mm_node) + |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 675 | (sizeof(uint32_t) * child_count)) % sizeof(void *); |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 676 | |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 677 | if (offset & INDEX_NODE_VALUES) |
| 678 | value_count = read_long_mm(&p); |
| 679 | else |
| 680 | value_count = 0; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 681 | |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 682 | node = malloc(sizeof(struct index_mm_node) |
| 683 | + sizeof(uint32_t) * child_count + children_padding |
| 684 | + sizeof(struct index_mm_value) * value_count); |
| 685 | if (node == NULL) |
| 686 | return NULL; |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 687 | |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 688 | node->idx = idx; |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 689 | node->prefix = prefix; |
| 690 | if (value_count == 0) |
| 691 | node->values.values = NULL; |
| 692 | else { |
| 693 | node->values.values = (struct index_mm_value *) |
| 694 | ((char *)node + sizeof(struct index_mm_node) + |
| 695 | sizeof(uint32_t) * child_count + children_padding); |
| 696 | } |
| 697 | node->values.len = value_count; |
| 698 | node->first = first; |
| 699 | node->last = last; |
| 700 | memcpy(node->children, children, sizeof(uint32_t) * child_count); |
| 701 | |
| 702 | for (i = 0; i < value_count; i++) { |
| 703 | struct index_mm_value *v = node->values.values + i; |
| 704 | v->priority = read_long_mm(&p); |
| 705 | v->value = read_chars_mm(&p, &v->len); |
| 706 | } |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 707 | |
| 708 | return node; |
| 709 | } |
| 710 | |
| 711 | static void index_mm_free_node(struct index_mm_node *node) |
| 712 | { |
Lucas De Marchi | 836be9a | 2011-12-02 17:27:52 -0200 | [diff] [blame] | 713 | free(node); |
| 714 | } |
| 715 | |
Lucas De Marchi | 5109f2b | 2011-12-08 15:10:55 -0200 | [diff] [blame] | 716 | struct index_mm *index_mm_open(struct kmod_ctx *ctx, const char *filename, |
| 717 | bool populate) |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 718 | { |
| 719 | int fd; |
Lucas De Marchi | 5109f2b | 2011-12-08 15:10:55 -0200 | [diff] [blame] | 720 | int flags; |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 721 | struct stat st; |
| 722 | struct index_mm *idx; |
| 723 | struct { |
| 724 | uint32_t magic; |
| 725 | uint32_t version; |
| 726 | uint32_t root_offset; |
| 727 | } hdr; |
| 728 | void *p; |
| 729 | |
| 730 | DBG(ctx, "file=%s\n", filename); |
| 731 | |
Lucas De Marchi | 7d51d8b | 2011-12-12 18:41:57 -0200 | [diff] [blame] | 732 | idx = malloc(sizeof(*idx)); |
| 733 | if (idx == NULL) { |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 734 | ERR(ctx, "%m\n"); |
| 735 | return NULL; |
| 736 | } |
| 737 | |
Cristian RodrÃguez | 79e5ea9 | 2011-12-16 02:49:54 -0300 | [diff] [blame] | 738 | if ((fd = open(filename, O_RDONLY|O_CLOEXEC)) < 0) { |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 739 | ERR(ctx, "%m\n"); |
Lucas De Marchi | 7d51d8b | 2011-12-12 18:41:57 -0200 | [diff] [blame] | 740 | goto fail_open; |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 741 | } |
| 742 | |
Lucas De Marchi | 7d51d8b | 2011-12-12 18:41:57 -0200 | [diff] [blame] | 743 | fstat(fd, &st); |
Lucas De Marchi | 5109f2b | 2011-12-08 15:10:55 -0200 | [diff] [blame] | 744 | flags = MAP_PRIVATE; |
| 745 | if (populate) |
| 746 | flags |= MAP_POPULATE; |
| 747 | |
| 748 | if ((idx->mm = mmap(0, st.st_size, PROT_READ, flags, fd, 0)) |
| 749 | == MAP_FAILED) { |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 750 | ERR(ctx, "%m\n"); |
| 751 | goto fail; |
| 752 | } |
| 753 | |
| 754 | p = idx->mm; |
| 755 | hdr.magic = read_long_mm(&p); |
| 756 | hdr.version = read_long_mm(&p); |
| 757 | hdr.root_offset = read_long_mm(&p); |
| 758 | |
| 759 | if (hdr.magic != INDEX_MAGIC) { |
| 760 | ERR(ctx, "magic check fail: %x instead of %x\n", hdr.magic, |
| 761 | INDEX_MAGIC); |
| 762 | goto fail; |
| 763 | } |
| 764 | |
| 765 | if (hdr.version >> 16 != INDEX_VERSION_MAJOR) { |
| 766 | ERR(ctx, "major version check fail: %u instead of %u\n", |
| 767 | hdr.version, INDEX_MAGIC); |
| 768 | goto fail; |
| 769 | } |
| 770 | |
| 771 | idx->root_offset = hdr.root_offset; |
| 772 | idx->size = st.st_size; |
| 773 | idx->ctx = ctx; |
| 774 | close(fd); |
| 775 | |
| 776 | return idx; |
| 777 | |
| 778 | fail: |
| 779 | close(fd); |
Gustavo Sverzut Barbieri | a5a92a6 | 2011-12-16 16:17:50 -0200 | [diff] [blame] | 780 | if (idx->mm != MAP_FAILED) |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 781 | munmap(idx->mm, st.st_size); |
Gustavo Sverzut Barbieri | a5a92a6 | 2011-12-16 16:17:50 -0200 | [diff] [blame] | 782 | fail_open: |
Lucas De Marchi | b471a6b | 2011-12-01 23:14:20 -0200 | [diff] [blame] | 783 | free(idx); |
| 784 | return NULL; |
| 785 | } |
| 786 | |
| 787 | void index_mm_close(struct index_mm *idx) |
| 788 | { |
| 789 | munmap(idx->mm, idx->size); |
| 790 | free(idx); |
| 791 | } |
Lucas De Marchi | 77bf936 | 2011-12-02 17:41:30 -0200 | [diff] [blame] | 792 | |
| 793 | static struct index_mm_node *index_mm_readroot(struct index_mm *idx) |
| 794 | { |
| 795 | return index_mm_read_node(idx, idx->root_offset); |
| 796 | } |
Lucas De Marchi | 91298dc | 2011-12-02 17:41:46 -0200 | [diff] [blame] | 797 | |
| 798 | static struct index_mm_node *index_mm_readchild(const struct index_mm_node *parent, |
| 799 | int ch) |
| 800 | { |
| 801 | if (parent->first <= ch && ch <= parent->last) { |
| 802 | return index_mm_read_node(parent->idx, |
| 803 | parent->children[ch - parent->first]); |
| 804 | } |
| 805 | |
| 806 | return NULL; |
| 807 | } |
Lucas De Marchi | e33bb87 | 2011-12-02 17:45:01 -0200 | [diff] [blame] | 808 | |
| 809 | static char *index_mm_search_node(struct index_mm_node *node, const char *key, |
| 810 | int i) |
| 811 | { |
| 812 | char *value; |
| 813 | struct index_mm_node *child; |
| 814 | int ch; |
| 815 | int j; |
| 816 | |
| 817 | while(node) { |
| 818 | for (j = 0; node->prefix[j]; j++) { |
| 819 | ch = node->prefix[j]; |
| 820 | |
| 821 | if (ch != key[i+j]) { |
| 822 | index_mm_free_node(node); |
| 823 | return NULL; |
| 824 | } |
| 825 | } |
| 826 | |
| 827 | i += j; |
| 828 | |
| 829 | if (key[i] == '\0') { |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 830 | if (node->values.len > 0) { |
| 831 | value = strdup(node->values.values[0].value); |
Lucas De Marchi | e33bb87 | 2011-12-02 17:45:01 -0200 | [diff] [blame] | 832 | index_mm_free_node(node); |
| 833 | return value; |
| 834 | } else { |
| 835 | return NULL; |
| 836 | } |
| 837 | } |
| 838 | |
| 839 | child = index_mm_readchild(node, key[i]); |
| 840 | index_mm_free_node(node); |
| 841 | node = child; |
| 842 | i++; |
| 843 | } |
| 844 | |
| 845 | return NULL; |
| 846 | } |
Lucas De Marchi | b797b79 | 2011-12-02 17:49:03 -0200 | [diff] [blame] | 847 | |
| 848 | /* |
| 849 | * Search the index for a key |
| 850 | * |
| 851 | * Returns the value of the first match |
| 852 | * |
| 853 | * The recursive functions free their node argument (using index_close). |
| 854 | */ |
| 855 | char *index_mm_search(struct index_mm *idx, const char *key) |
| 856 | { |
| 857 | struct index_mm_node *root; |
| 858 | char *value; |
| 859 | |
| 860 | root = index_mm_readroot(idx); |
| 861 | value = index_mm_search_node(root, key, 0); |
| 862 | |
| 863 | return value; |
| 864 | } |
Lucas De Marchi | bf89f70 | 2011-12-02 18:23:36 -0200 | [diff] [blame] | 865 | |
| 866 | /* Level 4: add all the values from a matching node */ |
| 867 | static void index_mm_searchwild_allvalues(struct index_mm_node *node, |
| 868 | struct index_value **out) |
| 869 | { |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 870 | struct index_mm_value *itr, *itr_end; |
Lucas De Marchi | bf89f70 | 2011-12-02 18:23:36 -0200 | [diff] [blame] | 871 | |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 872 | itr = node->values.values; |
| 873 | itr_end = itr + node->values.len; |
| 874 | for (; itr < itr_end; itr++) |
| 875 | add_value(out, itr->value, itr->len, itr->priority); |
Lucas De Marchi | bf89f70 | 2011-12-02 18:23:36 -0200 | [diff] [blame] | 876 | |
| 877 | index_mm_free_node(node); |
| 878 | } |
| 879 | |
| 880 | /* |
| 881 | * Level 3: traverse a sub-keyspace which starts with a wildcard, |
| 882 | * looking for matches. |
| 883 | */ |
| 884 | static void index_mm_searchwild_all(struct index_mm_node *node, int j, |
| 885 | struct buffer *buf, |
| 886 | const char *subkey, |
| 887 | struct index_value **out) |
| 888 | { |
| 889 | int pushed = 0; |
| 890 | int ch; |
| 891 | |
| 892 | while (node->prefix[j]) { |
| 893 | ch = node->prefix[j]; |
| 894 | |
| 895 | buf_pushchar(buf, ch); |
| 896 | pushed++; |
| 897 | j++; |
| 898 | } |
| 899 | |
| 900 | for (ch = node->first; ch <= node->last; ch++) { |
| 901 | struct index_mm_node *child = index_mm_readchild(node, ch); |
| 902 | |
| 903 | if (!child) |
| 904 | continue; |
| 905 | |
| 906 | buf_pushchar(buf, ch); |
| 907 | index_mm_searchwild_all(child, 0, buf, subkey, out); |
| 908 | buf_popchar(buf); |
| 909 | } |
| 910 | |
Gustavo Sverzut Barbieri | d091546 | 2011-12-10 13:04:43 -0200 | [diff] [blame] | 911 | if (node->values.len > 0) { |
Lucas De Marchi | bf89f70 | 2011-12-02 18:23:36 -0200 | [diff] [blame] | 912 | if (fnmatch(buf_str(buf), subkey, 0) == 0) |
| 913 | index_mm_searchwild_allvalues(node, out); |
Gustavo Sverzut Barbieri | 27fdf63 | 2011-12-10 13:28:18 -0200 | [diff] [blame] | 914 | else |
| 915 | index_mm_free_node(node); |
Lucas De Marchi | bf89f70 | 2011-12-02 18:23:36 -0200 | [diff] [blame] | 916 | } else { |
| 917 | index_mm_free_node(node); |
| 918 | } |
| 919 | |
| 920 | buf_popchars(buf, pushed); |
| 921 | } |
| 922 | |
| 923 | /* Level 2: descend the tree (until we hit a wildcard) */ |
| 924 | static void index_mm_searchwild_node(struct index_mm_node *node, |
| 925 | struct buffer *buf, |
| 926 | const char *key, int i, |
| 927 | struct index_value **out) |
| 928 | { |
| 929 | struct index_mm_node *child; |
| 930 | int j; |
| 931 | int ch; |
| 932 | |
| 933 | while(node) { |
| 934 | for (j = 0; node->prefix[j]; j++) { |
| 935 | ch = node->prefix[j]; |
| 936 | |
| 937 | if (ch == '*' || ch == '?' || ch == '[') { |
| 938 | index_mm_searchwild_all(node, j, buf, |
| 939 | &key[i+j], out); |
| 940 | return; |
| 941 | } |
| 942 | |
| 943 | if (ch != key[i+j]) { |
| 944 | index_mm_free_node(node); |
| 945 | return; |
| 946 | } |
| 947 | } |
| 948 | |
| 949 | i += j; |
| 950 | |
| 951 | child = index_mm_readchild(node, '*'); |
| 952 | if (child) { |
| 953 | buf_pushchar(buf, '*'); |
| 954 | index_mm_searchwild_all(child, 0, buf, &key[i], out); |
| 955 | buf_popchar(buf); |
| 956 | } |
| 957 | |
| 958 | child = index_mm_readchild(node, '?'); |
| 959 | if (child) { |
| 960 | buf_pushchar(buf, '?'); |
| 961 | index_mm_searchwild_all(child, 0, buf, &key[i], out); |
| 962 | buf_popchar(buf); |
| 963 | } |
| 964 | |
| 965 | child = index_mm_readchild(node, '['); |
| 966 | if (child) { |
| 967 | buf_pushchar(buf, '['); |
| 968 | index_mm_searchwild_all(child, 0, buf, &key[i], out); |
| 969 | buf_popchar(buf); |
| 970 | } |
| 971 | |
| 972 | if (key[i] == '\0') { |
| 973 | index_mm_searchwild_allvalues(node, out); |
| 974 | |
| 975 | return; |
| 976 | } |
| 977 | |
| 978 | child = index_mm_readchild(node, key[i]); |
| 979 | index_mm_free_node(node); |
| 980 | node = child; |
| 981 | i++; |
| 982 | } |
| 983 | } |
| 984 | |
| 985 | /* |
| 986 | * Search the index for a key. The index may contain wildcards. |
| 987 | * |
| 988 | * Returns a list of all the values of matching keys. |
| 989 | */ |
| 990 | struct index_value *index_mm_searchwild(struct index_mm *idx, const char *key) |
| 991 | { |
| 992 | struct index_mm_node *root = index_mm_readroot(idx); |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 993 | struct buffer buf; |
Lucas De Marchi | bf89f70 | 2011-12-02 18:23:36 -0200 | [diff] [blame] | 994 | struct index_value *out = NULL; |
| 995 | |
Gustavo Sverzut Barbieri | 405f614 | 2011-12-08 14:36:30 -0200 | [diff] [blame] | 996 | buf_init(&buf); |
| 997 | index_mm_searchwild_node(root, &buf, key, 0, &out); |
| 998 | buf_release(&buf); |
Lucas De Marchi | bf89f70 | 2011-12-02 18:23:36 -0200 | [diff] [blame] | 999 | return out; |
| 1000 | } |