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
|
#ifndef CARROT_H
#define CARROT_H
#include <epoch.h>
/* this is a helper module for hashtable.
Hashtable try to match incrementally the right module/service.
a match can be more specific (e.g. a subdirectory)
can have a more recent epoch and may have exceptions.
Checking for exceptions can be computationally expensive.
It is useless if the match is then overridden by a more specific,
more recent match.
So, the incremental matching process stores in a "carrot" the list of matches
that can have exceptions.
When the incremental matching process completes, the carrot contains all
the possible matches if the exceptions are confirmed or not. */
struct vuht_entry_t;
struct carrot_t;
/* Functions */
void carrot_free(struct carrot_t *old);
/* Create the list of possible ht elements to be returned. The list is created according to the timestamp. */
struct carrot_t *carrot_insert(struct carrot_t *head, struct vuht_entry_t *elem, epoch_t time,
int (*has_exception)(struct vuht_entry_t *elem));
/* Delete a specific element from the "carrot" */
struct carrot_t *carrot_delete(struct carrot_t *head, struct vuht_entry_t *elem);
/* Choose the ht element to be returned, the first confirmed match is returned.*/
struct vuht_entry_t *carrot_check(struct carrot_t *head,
int (*confirm)(struct vuht_entry_t *elem, void *opaque), void *opaque);
#endif
|
