-
Notifications
You must be signed in to change notification settings - Fork 3
/
0020-locking-qspinlock-Introduce-the-shuffle-reduction-op.patch
67 lines (59 loc) · 2.33 KB
/
0020-locking-qspinlock-Introduce-the-shuffle-reduction-op.patch
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
From dd09d3d196e865414e7b86668343c4b25ae50e14 Mon Sep 17 00:00:00 2001
From: AltArch Kernel <[email protected]>
Date: Wed, 23 Sep 2020 16:55:22 +0800
Subject: [PATCH 20/25] locking/qspinlock: Introduce the shuffle reduction
optimization into CNA
hulk inclusion
category: feature
bugzilla: 13227
CVE: NA
-------------------------------------------------
This optimization reduces the probability threads will be shuffled between
the main and secondary queues when the secondary queue is empty.
It is helpful when the lock is only lightly contended.
---
kernel/locking/qspinlock_cna.h | 20 ++++++++++++++++++++
1 file changed, 20 insertions(+)
diff --git a/kernel/locking/qspinlock_cna.h b/kernel/locking/qspinlock_cna.h
index 08748a5..b3cd1c9 100644
--- a/kernel/locking/qspinlock_cna.h
+++ b/kernel/locking/qspinlock_cna.h
@@ -64,6 +64,15 @@ struct cna_node {
#define INTRA_NODE_HANDOFF_PROB_ARG (16)
/*
+ * Controls the probability for enabling the scan of the main queue when
+ * the secondary queue is empty. The chosen value reduces the amount of
+ * unnecessary shuffling of threads between the two waiting queues when
+ * the contention is low, while responding fast enough and enabling
+ * the shuffling when the contention is high.
+ */
+#define SHUFFLE_REDUCTION_PROB_ARG (7)
+
+/*
* Return false with probability 1 / 2^@num_bits.
* Intuitively, the larger @num_bits the less likely false is to be returned.
* @num_bits must be a number between 0 and 31.
@@ -230,6 +239,16 @@ static inline void cna_pass_lock(struct mcs_spinlock *node,
u32 val = 1;
/*
+ * Limit thread shuffling when the secondary queue is empty.
+ * This copes with the overhead the shuffling creates when the
+ * lock is only lightly contended, and threads do not stay
+ * in the secondary queue long enough to reap the benefit of moving
+ * them there.
+ */
+ if (node->locked <= 1 && probably(SHUFFLE_REDUCTION_PROB_ARG))
+ goto pass_lock;
+
+ /*
* Try to find a successor running on the same NUMA node
* as the current lock holder. For long-term fairness,
* search for such a thread with high probability rather than always.
@@ -252,5 +271,6 @@ static inline void cna_pass_lock(struct mcs_spinlock *node,
((struct cna_node *)next_holder)->tail->mcs.next = next;
}
+pass_lock:
arch_mcs_spin_unlock_contended(&next_holder->locked, val);
}
--
1.8.3.1