Bump version to 0.14.0-pre
[urcu.git] / src / rculfhash-mm-chunk.c
1 /*
2 * rculfhash-mm-chunk.c
3 *
4 * Chunk based memory management for Lock-Free RCU Hash Table
5 *
6 * Copyright 2011 - Lai Jiangshan <laijs@cn.fujitsu.com>
7 *
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
12 *
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with this library; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 */
22
23 #include <stddef.h>
24 #include <urcu/assert.h>
25 #include <rculfhash-internal.h>
26
27 static
28 void cds_lfht_alloc_bucket_table(struct cds_lfht *ht, unsigned long order)
29 {
30 if (order == 0) {
31 ht->tbl_chunk[0] = calloc(ht->min_nr_alloc_buckets,
32 sizeof(struct cds_lfht_node));
33 urcu_posix_assert(ht->tbl_chunk[0]);
34 } else if (order > ht->min_alloc_buckets_order) {
35 unsigned long i, len = 1UL << (order - 1 - ht->min_alloc_buckets_order);
36
37 for (i = len; i < 2 * len; i++) {
38 ht->tbl_chunk[i] = calloc(ht->min_nr_alloc_buckets,
39 sizeof(struct cds_lfht_node));
40 urcu_posix_assert(ht->tbl_chunk[i]);
41 }
42 }
43 /* Nothing to do for 0 < order && order <= ht->min_alloc_buckets_order */
44 }
45
46 /*
47 * cds_lfht_free_bucket_table() should be called with decreasing order.
48 * When cds_lfht_free_bucket_table(0) is called, it means the whole
49 * lfht is destroyed.
50 */
51 static
52 void cds_lfht_free_bucket_table(struct cds_lfht *ht, unsigned long order)
53 {
54 if (order == 0)
55 poison_free(ht->tbl_chunk[0]);
56 else if (order > ht->min_alloc_buckets_order) {
57 unsigned long i, len = 1UL << (order - 1 - ht->min_alloc_buckets_order);
58
59 for (i = len; i < 2 * len; i++)
60 poison_free(ht->tbl_chunk[i]);
61 }
62 /* Nothing to do for 0 < order && order <= ht->min_alloc_buckets_order */
63 }
64
65 static
66 struct cds_lfht_node *bucket_at(struct cds_lfht *ht, unsigned long index)
67 {
68 unsigned long chunk, offset;
69
70 chunk = index >> ht->min_alloc_buckets_order;
71 offset = index & (ht->min_nr_alloc_buckets - 1);
72 return &ht->tbl_chunk[chunk][offset];
73 }
74
75 static
76 struct cds_lfht *alloc_cds_lfht(unsigned long min_nr_alloc_buckets,
77 unsigned long max_nr_buckets)
78 {
79 unsigned long nr_chunks, cds_lfht_size;
80
81 min_nr_alloc_buckets = max(min_nr_alloc_buckets,
82 max_nr_buckets / MAX_CHUNK_TABLE);
83 nr_chunks = max_nr_buckets / min_nr_alloc_buckets;
84 cds_lfht_size = offsetof(struct cds_lfht, tbl_chunk) +
85 sizeof(struct cds_lfht_node *) * nr_chunks;
86 cds_lfht_size = max(cds_lfht_size, sizeof(struct cds_lfht));
87
88 return __default_alloc_cds_lfht(
89 &cds_lfht_mm_chunk, cds_lfht_size,
90 min_nr_alloc_buckets, max_nr_buckets);
91 }
92
93 const struct cds_lfht_mm_type cds_lfht_mm_chunk = {
94 .alloc_cds_lfht = alloc_cds_lfht,
95 .alloc_bucket_table = cds_lfht_alloc_bucket_table,
96 .free_bucket_table = cds_lfht_free_bucket_table,
97 .bucket_at = bucket_at,
98 };
This page took 0.033915 seconds and 4 git commands to generate.