2019-01-17 18:31:34 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0+ */
|
srcu: Abstract multi-tail callback list handling
RCU has only one multi-tail callback list, which is implemented via
the nxtlist, nxttail, nxtcompleted, qlen_lazy, and qlen fields in the
rcu_data structure, and whose operations are open-code throughout the
Tree RCU implementation. This has been more or less OK in the past,
but upcoming callback-list optimizations in SRCU could really use
a multi-tail callback list there as well.
This commit therefore abstracts the multi-tail callback list handling
into a new kernel/rcu/rcu_segcblist.h file, and uses this new API.
The simple head-and-tail pointer callback list is also abstracted and
applied everywhere except for the NOCB callback-offload lists. (Yes,
the plan is to apply them there as well, but this commit is already
bigger than would be good.)
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
2017-02-08 20:36:42 +00:00
|
|
|
/*
|
|
|
|
* RCU segmented callback lists
|
|
|
|
*
|
2017-05-02 16:39:09 +00:00
|
|
|
* This seemingly RCU-private file must be available to SRCU users
|
|
|
|
* because the size of the TREE SRCU srcu_struct structure depends
|
|
|
|
* on these definitions.
|
|
|
|
*
|
srcu: Abstract multi-tail callback list handling
RCU has only one multi-tail callback list, which is implemented via
the nxtlist, nxttail, nxtcompleted, qlen_lazy, and qlen fields in the
rcu_data structure, and whose operations are open-code throughout the
Tree RCU implementation. This has been more or less OK in the past,
but upcoming callback-list optimizations in SRCU could really use
a multi-tail callback list there as well.
This commit therefore abstracts the multi-tail callback list handling
into a new kernel/rcu/rcu_segcblist.h file, and uses this new API.
The simple head-and-tail pointer callback list is also abstracted and
applied everywhere except for the NOCB callback-offload lists. (Yes,
the plan is to apply them there as well, but this commit is already
bigger than would be good.)
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
2017-02-08 20:36:42 +00:00
|
|
|
* Copyright IBM Corporation, 2017
|
|
|
|
*
|
2019-01-17 18:31:34 +00:00
|
|
|
* Authors: Paul E. McKenney <paulmck@linux.net.ibm.com>
|
srcu: Abstract multi-tail callback list handling
RCU has only one multi-tail callback list, which is implemented via
the nxtlist, nxttail, nxtcompleted, qlen_lazy, and qlen fields in the
rcu_data structure, and whose operations are open-code throughout the
Tree RCU implementation. This has been more or less OK in the past,
but upcoming callback-list optimizations in SRCU could really use
a multi-tail callback list there as well.
This commit therefore abstracts the multi-tail callback list handling
into a new kernel/rcu/rcu_segcblist.h file, and uses this new API.
The simple head-and-tail pointer callback list is also abstracted and
applied everywhere except for the NOCB callback-offload lists. (Yes,
the plan is to apply them there as well, but this commit is already
bigger than would be good.)
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
2017-02-08 20:36:42 +00:00
|
|
|
*/
|
|
|
|
|
2017-05-02 08:31:18 +00:00
|
|
|
#ifndef __INCLUDE_LINUX_RCU_SEGCBLIST_H
|
|
|
|
#define __INCLUDE_LINUX_RCU_SEGCBLIST_H
|
srcu: Abstract multi-tail callback list handling
RCU has only one multi-tail callback list, which is implemented via
the nxtlist, nxttail, nxtcompleted, qlen_lazy, and qlen fields in the
rcu_data structure, and whose operations are open-code throughout the
Tree RCU implementation. This has been more or less OK in the past,
but upcoming callback-list optimizations in SRCU could really use
a multi-tail callback list there as well.
This commit therefore abstracts the multi-tail callback list handling
into a new kernel/rcu/rcu_segcblist.h file, and uses this new API.
The simple head-and-tail pointer callback list is also abstracted and
applied everywhere except for the NOCB callback-offload lists. (Yes,
the plan is to apply them there as well, but this commit is already
bigger than would be good.)
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
2017-02-08 20:36:42 +00:00
|
|
|
|
2019-04-12 19:34:41 +00:00
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/atomic.h>
|
|
|
|
|
srcu: Abstract multi-tail callback list handling
RCU has only one multi-tail callback list, which is implemented via
the nxtlist, nxttail, nxtcompleted, qlen_lazy, and qlen fields in the
rcu_data structure, and whose operations are open-code throughout the
Tree RCU implementation. This has been more or less OK in the past,
but upcoming callback-list optimizations in SRCU could really use
a multi-tail callback list there as well.
This commit therefore abstracts the multi-tail callback list handling
into a new kernel/rcu/rcu_segcblist.h file, and uses this new API.
The simple head-and-tail pointer callback list is also abstracted and
applied everywhere except for the NOCB callback-offload lists. (Yes,
the plan is to apply them there as well, but this commit is already
bigger than would be good.)
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
2017-02-08 20:36:42 +00:00
|
|
|
/* Simple unsegmented callback lists. */
|
|
|
|
struct rcu_cblist {
|
|
|
|
struct rcu_head *head;
|
|
|
|
struct rcu_head **tail;
|
|
|
|
long len;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define RCU_CBLIST_INITIALIZER(n) { .head = NULL, .tail = &n.head }
|
|
|
|
|
|
|
|
/* Complicated segmented callback lists. ;-) */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Index values for segments in rcu_segcblist structure.
|
|
|
|
*
|
|
|
|
* The segments are as follows:
|
|
|
|
*
|
|
|
|
* [head, *tails[RCU_DONE_TAIL]):
|
|
|
|
* Callbacks whose grace period has elapsed, and thus can be invoked.
|
|
|
|
* [*tails[RCU_DONE_TAIL], *tails[RCU_WAIT_TAIL]):
|
|
|
|
* Callbacks waiting for the current GP from the current CPU's viewpoint.
|
|
|
|
* [*tails[RCU_WAIT_TAIL], *tails[RCU_NEXT_READY_TAIL]):
|
|
|
|
* Callbacks that arrived before the next GP started, again from
|
|
|
|
* the current CPU's viewpoint. These can be handled by the next GP.
|
|
|
|
* [*tails[RCU_NEXT_READY_TAIL], *tails[RCU_NEXT_TAIL]):
|
|
|
|
* Callbacks that might have arrived after the next GP started.
|
|
|
|
* There is some uncertainty as to when a given GP starts and
|
|
|
|
* ends, but a CPU knows the exact times if it is the one starting
|
|
|
|
* or ending the GP. Other CPUs know that the previous GP ends
|
|
|
|
* before the next one starts.
|
|
|
|
*
|
|
|
|
* Note that RCU_WAIT_TAIL cannot be empty unless RCU_NEXT_READY_TAIL is also
|
|
|
|
* empty.
|
|
|
|
*
|
|
|
|
* The ->gp_seq[] array contains the grace-period number at which the
|
|
|
|
* corresponding segment of callbacks will be ready to invoke. A given
|
|
|
|
* element of this array is meaningful only when the corresponding segment
|
|
|
|
* is non-empty, and it is never valid for RCU_DONE_TAIL (whose callbacks
|
|
|
|
* are already ready to invoke) or for RCU_NEXT_TAIL (whose callbacks have
|
|
|
|
* not yet been assigned a grace-period number).
|
|
|
|
*/
|
|
|
|
#define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */
|
|
|
|
#define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */
|
|
|
|
#define RCU_NEXT_READY_TAIL 2 /* Also RCU_NEXT head. */
|
|
|
|
#define RCU_NEXT_TAIL 3
|
|
|
|
#define RCU_CBLIST_NSEGS 4
|
|
|
|
|
|
|
|
struct rcu_segcblist {
|
|
|
|
struct rcu_head *head;
|
|
|
|
struct rcu_head **tails[RCU_CBLIST_NSEGS];
|
|
|
|
unsigned long gp_seq[RCU_CBLIST_NSEGS];
|
2019-07-02 00:36:53 +00:00
|
|
|
#ifdef CONFIG_RCU_NOCB_CPU
|
|
|
|
atomic_long_t len;
|
|
|
|
#else
|
srcu: Abstract multi-tail callback list handling
RCU has only one multi-tail callback list, which is implemented via
the nxtlist, nxttail, nxtcompleted, qlen_lazy, and qlen fields in the
rcu_data structure, and whose operations are open-code throughout the
Tree RCU implementation. This has been more or less OK in the past,
but upcoming callback-list optimizations in SRCU could really use
a multi-tail callback list there as well.
This commit therefore abstracts the multi-tail callback list handling
into a new kernel/rcu/rcu_segcblist.h file, and uses this new API.
The simple head-and-tail pointer callback list is also abstracted and
applied everywhere except for the NOCB callback-offload lists. (Yes,
the plan is to apply them there as well, but this commit is already
bigger than would be good.)
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
2017-02-08 20:36:42 +00:00
|
|
|
long len;
|
2019-07-02 00:36:53 +00:00
|
|
|
#endif
|
2019-04-12 19:34:41 +00:00
|
|
|
u8 enabled;
|
2019-04-12 22:58:34 +00:00
|
|
|
u8 offloaded;
|
srcu: Abstract multi-tail callback list handling
RCU has only one multi-tail callback list, which is implemented via
the nxtlist, nxttail, nxtcompleted, qlen_lazy, and qlen fields in the
rcu_data structure, and whose operations are open-code throughout the
Tree RCU implementation. This has been more or less OK in the past,
but upcoming callback-list optimizations in SRCU could really use
a multi-tail callback list there as well.
This commit therefore abstracts the multi-tail callback list handling
into a new kernel/rcu/rcu_segcblist.h file, and uses this new API.
The simple head-and-tail pointer callback list is also abstracted and
applied everywhere except for the NOCB callback-offload lists. (Yes,
the plan is to apply them there as well, but this commit is already
bigger than would be good.)
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
2017-02-08 20:36:42 +00:00
|
|
|
};
|
|
|
|
|
2017-03-13 23:48:18 +00:00
|
|
|
#define RCU_SEGCBLIST_INITIALIZER(n) \
|
|
|
|
{ \
|
|
|
|
.head = NULL, \
|
|
|
|
.tails[RCU_DONE_TAIL] = &n.head, \
|
|
|
|
.tails[RCU_WAIT_TAIL] = &n.head, \
|
|
|
|
.tails[RCU_NEXT_READY_TAIL] = &n.head, \
|
|
|
|
.tails[RCU_NEXT_TAIL] = &n.head, \
|
|
|
|
}
|
|
|
|
|
2017-05-02 08:31:18 +00:00
|
|
|
#endif /* __INCLUDE_LINUX_RCU_SEGCBLIST_H */
|