mirror of
https://mirrors.bfsu.edu.cn/git/linux.git
synced 2024-12-12 21:44:06 +08:00
0650b2b2e6
Per object mutexes may come with significant memory cost while a
global mutex can suffer from unnecessary contention. A sharded mutex
is a compromise where objects are hashed and then a particular mutex
for the hash of the object used. Contention can be controlled by the
number of shards.
v2. Use hashmap.h's hash_bits in case of contention from alignment of
objects.
Signed-off-by: Ian Rogers <irogers@google.com>
Acked-by: Namhyung Kim <namhyung@kernel.org>
Cc: Andres Freund <andres@anarazel.de>
Cc: Mark Rutland <mark.rutland@arm.com>
Cc: Yuan Can <yuancan@huawei.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Adrian Hunter <adrian.hunter@intel.com>
Cc: Arnaldo Carvalho de Melo <acme@kernel.org>
Cc: Huacai Chen <chenhuacai@kernel.org>
Cc: Jiri Olsa <jolsa@kernel.org>
Cc: Masami Hiramatsu <mhiramat@kernel.org>
Cc: Alexander Shishkin <alexander.shishkin@linux.intel.com>
Cc: Kan Liang <kan.liang@linux.intel.com>
Cc: Ingo Molnar <mingo@redhat.com>
Link: https://lore.kernel.org/r/20230615040715.2064350-1-irogers@google.com
Signed-off-by: Namhyung Kim <namhyung@kernel.org>
34 lines
684 B
C
34 lines
684 B
C
// SPDX-License-Identifier: GPL-2.0
|
|
#include "sharded_mutex.h"
|
|
|
|
#include <stdlib.h>
|
|
|
|
struct sharded_mutex *sharded_mutex__new(size_t num_shards)
|
|
{
|
|
struct sharded_mutex *result;
|
|
size_t size;
|
|
unsigned int bits;
|
|
|
|
for (bits = 0; ((size_t)1 << bits) < num_shards; bits++)
|
|
;
|
|
|
|
size = sizeof(*result) + sizeof(struct mutex) * (1 << bits);
|
|
result = malloc(size);
|
|
if (!result)
|
|
return NULL;
|
|
|
|
result->cap_bits = bits;
|
|
for (size_t i = 0; i < ((size_t)1 << bits); i++)
|
|
mutex_init(&result->mutexes[i]);
|
|
|
|
return result;
|
|
}
|
|
|
|
void sharded_mutex__delete(struct sharded_mutex *sm)
|
|
{
|
|
for (size_t i = 0; i < ((size_t)1 << sm->cap_bits); i++)
|
|
mutex_destroy(&sm->mutexes[i]);
|
|
|
|
free(sm);
|
|
}
|