iolog.c: Fix memory leak for blkparse case
[fio.git] / filehash.c
CommitLineData
380065aa
JA
1#include <stdlib.h>
2#include <assert.h>
3
4#include "fio.h"
01743ee1 5#include "flist.h"
dadf66c5 6#include "hash.h"
10aa136b 7#include "filehash.h"
63a26e05 8#include "smalloc.h"
1b2a83dc 9#include "lib/bloom.h"
380065aa
JA
10
11#define HASH_BUCKETS 512
12#define HASH_MASK (HASH_BUCKETS - 1)
13
1b2a83dc
JA
14#define BLOOM_SIZE 16*1024*1024
15
63a26e05 16static unsigned int file_hash_size = HASH_BUCKETS * sizeof(struct flist_head);
380065aa 17
01743ee1 18static struct flist_head *file_hash;
971caeb1 19static struct fio_sem *hash_lock;
1b2a83dc 20static struct bloom *file_bloom;
380065aa 21
380065aa
JA
22static unsigned short hash(const char *name)
23{
dadf66c5 24 return jhash(name, strlen(name), 0) & HASH_MASK;
380065aa
JA
25}
26
90426237
JA
27void fio_file_hash_lock(void)
28{
45aeca74 29 if (hash_lock)
971caeb1 30 fio_sem_down(hash_lock);
90426237
JA
31}
32
33void fio_file_hash_unlock(void)
34{
45aeca74 35 if (hash_lock)
971caeb1 36 fio_sem_up(hash_lock);
90426237
JA
37}
38
380065aa
JA
39void remove_file_hash(struct fio_file *f)
40{
971caeb1 41 fio_sem_down(hash_lock);
380065aa 42
d6aed795 43 if (fio_file_hashed(f)) {
01743ee1
JA
44 assert(!flist_empty(&f->hash_list));
45 flist_del_init(&f->hash_list);
d6aed795 46 fio_file_clear_hashed(f);
380065aa
JA
47 }
48
971caeb1 49 fio_sem_up(hash_lock);
380065aa
JA
50}
51
52static struct fio_file *__lookup_file_hash(const char *name)
53{
01743ee1
JA
54 struct flist_head *bucket = &file_hash[hash(name)];
55 struct flist_head *n;
380065aa 56
01743ee1
JA
57 flist_for_each(n, bucket) {
58 struct fio_file *f = flist_entry(n, struct fio_file, hash_list);
380065aa 59
89541106
JA
60 if (!f->file_name)
61 continue;
62
afa37b56 63 if (!strcmp(f->file_name, name))
380065aa 64 return f;
380065aa
JA
65 }
66
380065aa
JA
67 return NULL;
68}
69
70struct fio_file *lookup_file_hash(const char *name)
71{
72 struct fio_file *f;
73
971caeb1 74 fio_sem_down(hash_lock);
380065aa 75 f = __lookup_file_hash(name);
971caeb1 76 fio_sem_up(hash_lock);
380065aa
JA
77 return f;
78}
79
80struct fio_file *add_file_hash(struct fio_file *f)
81{
82 struct fio_file *alias;
83
d6aed795 84 if (fio_file_hashed(f))
380065aa
JA
85 return NULL;
86
01743ee1 87 INIT_FLIST_HEAD(&f->hash_list);
380065aa 88
971caeb1 89 fio_sem_down(hash_lock);
380065aa
JA
90
91 alias = __lookup_file_hash(f->file_name);
92 if (!alias) {
d6aed795 93 fio_file_set_hashed(f);
01743ee1 94 flist_add_tail(&f->hash_list, &file_hash[hash(f->file_name)]);
380065aa
JA
95 }
96
971caeb1 97 fio_sem_up(hash_lock);
380065aa
JA
98 return alias;
99}
100
1b2a83dc
JA
101bool file_bloom_exists(const char *fname, bool set)
102{
103 return bloom_string(file_bloom, fname, strlen(fname), set);
104}
105
5e1d306e
JA
106void file_hash_exit(void)
107{
108 unsigned int i, has_entries = 0;
109
971caeb1 110 fio_sem_down(hash_lock);
5e1d306e 111 for (i = 0; i < HASH_BUCKETS; i++)
01743ee1 112 has_entries += !flist_empty(&file_hash[i]);
971caeb1 113 fio_sem_up(hash_lock);
5e1d306e
JA
114
115 if (has_entries)
116 log_err("fio: file hash not empty on exit\n");
117
63a26e05 118 sfree(file_hash);
b950781e 119 file_hash = NULL;
971caeb1 120 fio_sem_remove(hash_lock);
5e1d306e 121 hash_lock = NULL;
1b2a83dc
JA
122 bloom_free(file_bloom);
123 file_bloom = NULL;
5e1d306e
JA
124}
125
63a26e05 126void file_hash_init(void)
380065aa
JA
127{
128 unsigned int i;
129
63a26e05
JA
130 file_hash = smalloc(file_hash_size);
131
380065aa 132 for (i = 0; i < HASH_BUCKETS; i++)
01743ee1 133 INIT_FLIST_HEAD(&file_hash[i]);
380065aa 134
971caeb1 135 hash_lock = fio_sem_init(FIO_SEM_UNLOCKED);
1b2a83dc 136 file_bloom = bloom_new(BLOOM_SIZE);
380065aa 137}