forked from yuanrongxi/innodb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhash0hash.cc
284 lines (224 loc) · 6.59 KB
/
hash0hash.cc
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
#include "hash0hash.h"
#include "ut0rnd.h"
#include "mem0mem.h"
#ifdef UNIV_PFS_MUTEX
UNIV_INTERN mysql_pfs_key_t hash_table_mutex_key;
#endif /* UNIV_PFS_MUTEX */
#ifdef UNIV_PFS_RWLOCK
UNIV_INTERN mysql_pfs_key_t hash_table_rw_lock_key;
#endif /* UNIV_PFS_RWLOCK */
UNIV_INLINE hash_cell_t* hash_get_nth_cell(hash_table_t* table, ulint n)
{
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
ut_ad(n < table->n_cells);
return (table->array + n);
}
UNIV_INLINE void hash_table_clear(hash_table_t* table)
{
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
memset(table->array, 0, table->n_cells * sizeof(hash_cell_t));
}
UNIV_INLINE ulint hash_calc_hash(ulint fold, hash_table_t* table)
{
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
return (ut_hash_ulint(fold, table->n_cells));
}
/*获得锁的索引ID*/
UNIV_INLINE ulint hash_get_sync_obj_index(hash_table_t* table, ulint fold)
{
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
ut_ad(table->type != HASH_TABLE_SYNC_NONE);
ut_ad(ut_is_2pow(table->n_sync_obj));
return (ut_2pow_remainder(hash_calc_hash(fold, table), table->n_sync_obj));
}
UNIV_INLINE mem_heap_t* hash_get_nth_heap(hash_table_t* table, ulint i)
{
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
ut_ad(table->type != HASH_TABLE_SYNC_NONE);
ut_ad(i < table->n_sync_obj);
return (table->heaps[i]);
}
UNIV_INLINE mem_heap_t* hash_get_heap(hash_table_t* table, ulint fold)
{
ulint i;
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
if(table->heap)
return table->heap;
i = hash_get_sync_obj_index(table, hash_calc_hash(fold, table));
return hash_get_nth_heap(table, i);
}
UNIV_INLINE ib_mutex_t* hash_get_nth_mutex(hash_table_t* table, ulint i)
{
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
ut_ad(table->type == HASH_TABLE_SYNC_MUTEX);
ut_ad(i < table->n_sync_obj);
return (table->sync_obj.mutexes + i);
}
UNIV_INLINE ib_mutex_t* hash_get_mutex(hash_table_t* table, ulint fold)
{
ulint i;
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
i = hash_get_sync_obj_index(table, hash_calc_hash(fold, table));
return hash_get_nth_mutex(table, i);
}
UNIV_INLINE rw_lock_t* hash_get_nth_lock(hash_table_t* table, ulint i)
{
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
ut_ad(table->type == HASH_TABLE_SYNC_MUTEX);
ut_ad(i < table->n_sync_obj);
return (table->sync_obj.rw_locks + i);
}
UNIV_INLINE rw_lock_t* hash_get_lock(hash_table_t* table, ulint fold)
{
ulint i;
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
i = hash_get_sync_obj_index(table, hash_calc_hash(fold, table));
return hash_get_nth_lock(table, i);
}
UNIV_INTERN void hash_mutex_enter(hash_table_t* table, ulint fold)
{
ut_ad(table->type == HASH_TABLE_SYNC_MUTEX);
mutex_enter(hash_get_mutex(table, fold));
}
UNIV_INTERN void hash_mutex_exit(hash_table_t* table, ulint fold)
{
ut_ad(table->type == HASH_TABLE_SYNC_MUTEX);
mutex_exit(hash_get_mutex(table, fold));
}
UNIV_INTERN void hash_mutex_enter_all(hash_table_t* table)
{
ulint i;
ut_ad(table->type == HASH_TABLE_SYNC_MUTEX);
for(i = 0; i < table->n_sync_obj; i ++)
mutex_enter(table->sync_obj.mutexes + i);
}
UNIV_INTERN void hash_mutex_exit_all(hash_table_t* table)
{
ulint i;
ut_ad(table->type == HASH_TABLE_SYNC_MUTEX);
for(i = 0; i < table->n_sync_obj; i ++)
mutex_exit(table->sync_obj.mutexes + i);
}
UNIV_INTERN void hash_mutex_exit_all_but(hash_table_t* table, ib_mutex_t* keep_mutex)
{
ulint i;
ut_ad(table->type == HASH_TABLE_SYNC_MUTEX);
for(i = 0; i < table->n_sync_obj; i ++){
ib_mutex_t* mutex = table->sync_obj.mutexes + i;
if(UNIV_LIKELY(keep_mutex != mutex))
mutex_exit(mutex);
}
}
UNIV_INTERN void hash_lock_s(hash_table_t* table, ulint fold)
{
rw_lock_t* lock = hash_get_lock(table, fold);
ut_ad(table->type == HASH_TABLE_SYNC_RW_LOCK);
ut_ad(lock);
rw_lock_s_lock(lock);
}
UNIV_INTERN void hash_lock_x(hash_table_t* table, ulint fold)
{
rw_lock_t* lock = hash_get_lock(table, fold);
ut_ad(table->type == HASH_TABLE_SYNC_RW_LOCK);
ut_ad(lock);
rw_lock_x_lock(lock);
}
UNIV_INTERN void hash_unlock_s(hash_table_t* table, ulint fold)
{
rw_lock_t* lock = hash_get_lock(table, fold);
ut_ad(table->type == HASH_TABLE_SYNC_RW_LOCK);
ut_ad(lock);
rw_lock_s_unlock(lock);
}
UNIV_INTERN void hash_unlock_x(hash_table_t* table, ulint fold)
{
rw_lock_t* lock = hash_get_lock(table, fold);
ut_ad(table->type == HASH_TABLE_SYNC_RW_LOCK);
ut_ad(lock);
rw_lock_x_unlock(lock);
}
UNIV_INTERN void hash_unlock_x_all(hash_table_t* table)
{
ulint i;
ut_ad(table->type == HASH_TABLE_SYNC_RW_LOCK);
ut_ad(lock);
for(i = 0; i < table->n_sync_obj; i ++){
rw_lock_t* lock = table->sync_obj.rw_locks + i;
rw_lock_x_lock(lock);
}
}
UNIV_INTERN void hash_unlock_x_all_put(hash_table_t* table, rw_lock_t* keep_lock)
{
ulint i;
ut_ad(table->type == HASH_TABLE_SYNC_RW_LOCK);
ut_ad(lock);
for(i = 0; i < table->n_sync_obj; i ++){
rw_lock_t* lock = table->sync_obj.rw_locks + i;
if(UNIV_LIKELY(keep_lock != lock))
rw_lock_x_lock(lock);
}
}
/*创建一个不带锁的hash*/
UNIV_INTERN hash_table_t* hash_create(ulint n)
{
hash_cell_t* array;
ulint prime;
hash_table_t* table;
prime = ut_find_prime(n);
table = static_cast<hash_table_t*>(mem_alloc(sizeof(hash_table_t)));
array = static_cast<hash_cell_t *>(ut_malloc(sizeof(hash_cell_t) * n));
table->type = HASH_TABLE_SYNC_NONE;
table->array = array;
table->n_cells = prime;
table->n_sync_obj = 0;
table->sync_obj.mutexes = NULL;
table->heaps = NULL;
table->magic_n = HASH_TABLE_MAGIC_N;
hash_table_clear(table);
return table;
}
UNIV_INTERN void hash_table_free(hash_table_t* table)
{
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
ut_free(table->array);
mem_free(table);
/*锁在什么地方释放?*/
}
/*n_sync_obj一定要是2的N次方*/
UNIV_INTERN void hash_create_sync_obj_func(hash_table_t* table, enum hash_table_sync_t type, ulint n_sync_obj)
{
ulint i;
ut_ad(table);
ut_ad(table->magic_n == HASH_TABLE_MAGIC_N);
ut_a(n_sync_obj > 0);
ut_a(ut_is_2pow(n_sync_obj));
table->type = type;
switch(type){
case HASH_TABLE_SYNC_MUTEX:
table->sync_obj.mutexes = static_cast<ib_mutex_t*>(mem_alloc(n_sync_obj * sizeof(ib_mutex_t)));
for(i = 0; i< n_sync_obj; i ++){
mutex_create(hash_table_mutex_key, table->sync_obj.mutexes + i, SYNC_MEM_HASH);
}
break;
case HASH_TABLE_SYNC_RW_LOCK:
table->sync_obj.rw_locks = static_cast<rw_lock_t*>(mem_alloc(n_sync_obj * sizeof(rw_lock_t)));
for (i = 0; i < n_sync_obj; i++) {
rw_lock_create(hash_table_rw_lock_key,table->sync_obj.rw_locks + i, SYNC_MEM_HASH);
}
break;
default:
ut_error;
}
table->n_sync_obj = n_sync_obj;
}