mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
synced 2025-12-27 13:30:45 -05:00
20d387d7ce
Reuse the already implemented MurmurHash3 algorithm. Under heavy stress testing (on an 8-core system sustaining over 50,000 authentication events per second), sample once per second and take the mean of 1800 samples: 1. Bucket utilization rate and length of longest chain +--------------------------+-----------------------------------------+ | | bucket utilization rate / longest chain | | +--------------------+--------------------+ | | no-patch | with-patch | +--------------------------+--------------------+--------------------+ | 512 nodes, 512 buckets | 52.5%/7.5 | 60.2%/5.7 | +--------------------------+--------------------+--------------------+ | 1024 nodes, 512 buckets | 68.9%/12.1 | 80.2%/9.7 | +--------------------------+--------------------+--------------------+ | 2048 nodes, 512 buckets | 83.7%/19.4 | 93.4%/16.3 | +--------------------------+--------------------+--------------------+ | 8192 nodes, 8192 buckets | 49.5%/11.4 | 60.3%/7.4 | +--------------------------+--------------------+--------------------+ 2. avc_search_node latency (total latency of hash operation and table lookup) +--------------------------+-----------------------------------------+ | | latency of function avc_search_node | | +--------------------+--------------------+ | | no-patch | with-patch | +--------------------------+--------------------+--------------------+ | 512 nodes, 512 buckets | 87ns | 84ns | +--------------------------+--------------------+--------------------+ | 1024 nodes, 512 buckets | 97ns | 96ns | +--------------------------+--------------------+--------------------+ | 2048 nodes, 512 buckets | 118ns | 113ns | +--------------------------+--------------------+--------------------+ | 8192 nodes, 8192 buckets | 106ns | 99ns | +--------------------------+--------------------+--------------------+ Although MurmurHash3 has higher overhead than the bitwise operations in the original algorithm, the data shows that the MurmurHash3 achieves better distribution, reducing average lookup time. Consequently, the total latency of hashing and table lookup is lower than before. Signed-off-by: Hongru Zhang <zhanghongru@xiaomi.com> [PM: whitespace fixes] Signed-off-by: Paul Moore <paul@paul-moore.com>
48 lines
1.1 KiB
C
48 lines
1.1 KiB
C
/* SPDX-License-Identifier: GPL-2.0-only */
|
|
|
|
#ifndef _SELINUX_HASH_H_
|
|
#define _SELINUX_HASH_H_
|
|
|
|
/*
|
|
* Based on MurmurHash3, written by Austin Appleby and placed in the
|
|
* public domain.
|
|
*/
|
|
static inline u32 av_hash(u32 key1, u32 key2, u32 key3, u32 mask)
|
|
{
|
|
static const u32 c1 = 0xcc9e2d51;
|
|
static const u32 c2 = 0x1b873593;
|
|
static const u32 r1 = 15;
|
|
static const u32 r2 = 13;
|
|
static const u32 m = 5;
|
|
static const u32 n = 0xe6546b64;
|
|
|
|
u32 hash = 0;
|
|
|
|
#define mix(input) \
|
|
do { \
|
|
u32 v = input; \
|
|
v *= c1; \
|
|
v = (v << r1) | (v >> (32 - r1)); \
|
|
v *= c2; \
|
|
hash ^= v; \
|
|
hash = (hash << r2) | (hash >> (32 - r2)); \
|
|
hash = hash * m + n; \
|
|
} while (0)
|
|
|
|
mix(key1);
|
|
mix(key2);
|
|
mix(key3);
|
|
|
|
#undef mix
|
|
|
|
hash ^= hash >> 16;
|
|
hash *= 0x85ebca6b;
|
|
hash ^= hash >> 13;
|
|
hash *= 0xc2b2ae35;
|
|
hash ^= hash >> 16;
|
|
|
|
return hash & mask;
|
|
}
|
|
|
|
#endif /* _SELINUX_HASH_H_ */
|