blob: 7325e969eee3cadc9268025e2b6e835275f496e6 (
plain) (
blame)
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
|
/* SPDX-License-Identifier: GPL-2.0 */
#ifndef PERF_SHARDED_MUTEX_H
#define PERF_SHARDED_MUTEX_H
#include "mutex.h"
#include "hashmap.h"
/*
* In a situation where a lock is needed per object, having a mutex can be
* relatively memory expensive (40 bytes on x86-64). If the object can be
* constantly hashed, a sharded mutex is an alternative global pool of mutexes
* where the mutex is looked up from a hash value. This can lead to collisions
* if the number of shards isn't large enough.
*/
struct sharded_mutex {
/* mutexes array is 1<<cap_bits in size. */
unsigned int cap_bits;
struct mutex mutexes[];
};
struct sharded_mutex *sharded_mutex__new(size_t num_shards);
void sharded_mutex__delete(struct sharded_mutex *sm);
static inline struct mutex *sharded_mutex__get_mutex(struct sharded_mutex *sm, size_t hash)
{
return &sm->mutexes[hash_bits(hash, sm->cap_bits)];
}
#endif /* PERF_SHARDED_MUTEX_H */
|
