2 * Copyright (C) 2011 - David Goulet <david.goulet@polymtl.ca>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License, version 2 only,
6 * as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful, but WITHOUT
9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
13 * You should have received a copy of the GNU General Public License along
14 * with this program; if not, write to the Free Software Foundation, Inc.,
15 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
22 #include <urcu/compiler.h>
24 #include <common/common.h>
25 #include <common/defaults.h>
27 #include "hashtable.h"
30 #define HASH_SEED 0x42UL /* The answer to life */
32 static unsigned long min_hash_alloc_size
= 1;
33 static unsigned long max_hash_buckets_size
= (1UL << 20);
36 * Match function for string node.
38 static int match_str(struct cds_lfht_node
*node
, const void *key
)
40 struct lttng_ht_node_str
*match_node
=
41 caa_container_of(node
, struct lttng_ht_node_str
, node
);
43 return hash_match_key_str(match_node
->key
, (void *) key
);
47 * Match function for ulong node.
49 static int match_ulong(struct cds_lfht_node
*node
, const void *key
)
51 struct lttng_ht_node_ulong
*match_node
=
52 caa_container_of(node
, struct lttng_ht_node_ulong
, node
);
54 return hash_match_key_ulong((void *) match_node
->key
, (void *) key
);
58 * Return an allocated lttng hashtable.
60 struct lttng_ht
*lttng_ht_new(unsigned long size
, int type
)
66 size
= DEFAULT_HT_SIZE
;
68 ht
= zmalloc(sizeof(*ht
));
70 PERROR("zmalloc lttng_ht");
74 ht
->ht
= cds_lfht_new(size
, min_hash_alloc_size
, max_hash_buckets_size
,
75 CDS_LFHT_AUTO_RESIZE
, NULL
);
77 * There is already an assert in the RCU hashtable code so if the ht is
78 * NULL here there is a *huge* problem.
83 case LTTNG_HT_TYPE_STRING
:
84 ht
->match_fct
= match_str
;
85 ht
->hash_fct
= hash_key_str
;
87 case LTTNG_HT_TYPE_ULONG
:
88 ht
->match_fct
= match_ulong
;
89 ht
->hash_fct
= hash_key_ulong
;
92 ERR("Unknown lttng hashtable type %d", type
);
96 DBG3("Created hashtable size %lu at %p of type %d", size
, ht
->ht
, type
);
105 * Free a lttng hashtable.
107 void lttng_ht_destroy(struct lttng_ht
*ht
)
111 ret
= cds_lfht_destroy(ht
->ht
, NULL
);
117 * Init lttng ht node string.
119 void lttng_ht_node_init_str(struct lttng_ht_node_str
*node
, char *key
)
124 cds_lfht_node_init(&node
->node
);
128 * Init lttng ht node unsigned long.
130 void lttng_ht_node_init_ulong(struct lttng_ht_node_ulong
*node
,
136 cds_lfht_node_init(&node
->node
);
140 * Free lttng ht node string.
142 void lttng_ht_node_free_str(struct lttng_ht_node_str
*node
)
149 * Free lttng ht node unsigned long.
151 void lttng_ht_node_free_ulong(struct lttng_ht_node_ulong
*node
)
158 * Lookup function in hashtable.
160 void lttng_ht_lookup(struct lttng_ht
*ht
, void *key
,
161 struct lttng_ht_iter
*iter
)
166 cds_lfht_lookup(ht
->ht
, ht
->hash_fct(key
, HASH_SEED
),
167 ht
->match_fct
, key
, &iter
->iter
);
171 * Add unique string node to hashtable.
173 void lttng_ht_add_unique_str(struct lttng_ht
*ht
,
174 struct lttng_ht_node_str
*node
)
176 struct cds_lfht_node
*node_ptr
;
181 node_ptr
= cds_lfht_add_unique(ht
->ht
, ht
->hash_fct(node
->key
, HASH_SEED
),
182 ht
->match_fct
, node
->key
, &node
->node
);
183 assert(node_ptr
== &node
->node
);
187 * Add unsigned long node to hashtable.
189 void lttng_ht_add_ulong(struct lttng_ht
*ht
, struct lttng_ht_node_ulong
*node
)
195 cds_lfht_add(ht
->ht
, ht
->hash_fct((void *) node
->key
, HASH_SEED
),
200 * Add unique unsigned long node to hashtable.
202 void lttng_ht_add_unique_ulong(struct lttng_ht
*ht
,
203 struct lttng_ht_node_ulong
*node
)
205 struct cds_lfht_node
*node_ptr
;
210 node_ptr
= cds_lfht_add_unique(ht
->ht
,
211 ht
->hash_fct((void *) node
->key
, HASH_SEED
), ht
->match_fct
,
212 (void *) node
->key
, &node
->node
);
213 assert(node_ptr
== &node
->node
);
217 * Add replace unsigned long node to hashtable.
219 struct lttng_ht_node_ulong
*lttng_ht_add_replace_ulong(struct lttng_ht
*ht
,
220 struct lttng_ht_node_ulong
*node
)
222 struct cds_lfht_node
*node_ptr
;
227 node_ptr
= cds_lfht_add_replace(ht
->ht
,
228 ht
->hash_fct((void *) node
->key
, HASH_SEED
), ht
->match_fct
,
229 (void *) node
->key
, &node
->node
);
233 return caa_container_of(node_ptr
, struct lttng_ht_node_ulong
, node
);
235 assert(node_ptr
== &node
->node
);
239 * Delete node from hashtable.
241 int lttng_ht_del(struct lttng_ht
*ht
, struct lttng_ht_iter
*iter
)
247 return cds_lfht_del(ht
->ht
, iter
->iter
.node
);
251 * Get first node in the hashtable.
253 void lttng_ht_get_first(struct lttng_ht
*ht
, struct lttng_ht_iter
*iter
)
259 cds_lfht_first(ht
->ht
, &iter
->iter
);
263 * Get next node in the hashtable.
265 void lttng_ht_get_next(struct lttng_ht
*ht
, struct lttng_ht_iter
*iter
)
271 cds_lfht_next(ht
->ht
, &iter
->iter
);
275 * Return the number of nodes in the hashtable.
277 unsigned long lttng_ht_get_count(struct lttng_ht
*ht
)
285 cds_lfht_count_nodes(ht
->ht
, &scb
, &count
, &sca
);
291 * Return lttng ht string node from iterator.
293 struct lttng_ht_node_str
*lttng_ht_iter_get_node_str(
294 struct lttng_ht_iter
*iter
)
296 struct cds_lfht_node
*node
;
299 node
= cds_lfht_iter_get_node(&iter
->iter
);
303 return caa_container_of(node
, struct lttng_ht_node_str
, node
);
307 * Return lttng ht unsigned long node from iterator.
309 struct lttng_ht_node_ulong
*lttng_ht_iter_get_node_ulong(
310 struct lttng_ht_iter
*iter
)
312 struct cds_lfht_node
*node
;
315 node
= cds_lfht_iter_get_node(&iter
->iter
);
319 return caa_container_of(node
, struct lttng_ht_node_ulong
, node
);
This page took 0.039554 seconds and 5 git commands to generate.