提交 47835be6 编写于 作者: A Alex Kogan 提交者: Xie XiuQi

locking/qspinlock: Introduce starvation avoidance into CNA

hulk inclusion
category: feature
bugzilla: 13227
CVE: NA

-------------------------------------------------

Choose the next lock holder among spinning threads running on the same
node with high probability rather than always. With small probability,
hand the lock to the first thread in the secondary queue or, if that
queue is empty, to the immediate successor of the current lock holder
in the main queue.  Thus, assuming no failures while threads hold the
lock, every thread would be able to acquire the lock after a bounded
number of lock transitions, with high probability.
Signed-off-by: NAlex Kogan <alex.kogan@oracle.com>
Reviewed-by: NSteve Sistare <steven.sistare@oracle.com>
Signed-off-by: NWei Li <liwei391@huawei.com>
Signed-off-by: NYang Yingliang <yangyingliang@huawei.com>
上级 2636acee
......@@ -4,6 +4,7 @@
#endif
#include <linux/topology.h>
#include <linux/random.h>
/*
* Implement a NUMA-aware version of MCS (aka CNA, or compact NUMA-aware lock).
......@@ -36,6 +37,33 @@ struct cna_node {
#define CNA_NODE(ptr) ((struct cna_node *)(ptr))
/* Per-CPU pseudo-random number seed */
static DEFINE_PER_CPU(u32, seed);
/*
* Controls the probability for intra-node lock hand-off. It can be
* tuned and depend, e.g., on the number of CPUs per node. For now,
* choose a value that provides reasonable long-term fairness without
* sacrificing performance compared to a version that does not have any
* fairness guarantees.
*/
#define INTRA_NODE_HANDOFF_PROB_ARG 0x10000
/*
* Return false with probability 1 / @range.
* @range must be a power of 2.
*/
static bool probably(unsigned int range)
{
u32 s;
s = this_cpu_read(seed);
s = next_pseudo_random32(s);
this_cpu_write(seed, s);
return s & (range - 1);
}
static void cna_init_node(struct mcs_spinlock *node)
{
struct cna_node *cn = CNA_NODE(node);
......@@ -140,7 +168,13 @@ static inline void cna_pass_mcs_lock(struct mcs_spinlock *node,
u64 *var = &next->locked;
u64 val = 1;
succ = find_successor(node);
/*
* Try to pass the lock to a thread running on the same node.
* For long-term fairness, search for such a thread with high
* probability rather than always.
*/
if (probably(INTRA_NODE_HANDOFF_PROB_ARG))
succ = find_successor(node);
if (succ) {
var = &succ->mcs.locked;
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册