aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorPaul E. McKenney <paulmck@linux.vnet.ibm.com>2017-05-02 11:45:25 -0400
committerPaul E. McKenney <paulmck@linux.vnet.ibm.com>2017-05-02 12:21:59 -0400
commit4b27f20b40a23f03df682eb1f69e9dc3da7d3b93 (patch)
tree13dd72ff209b6ea79f84da0bcfa8642ac4181222
parent8ef0f37efb7863a04b1e4102d42b7c0b1a59d40f (diff)
rcu: Open-code the rcu_cblist_n_cbs() function
Because the rcu_cblist_n_cbs() just samples the ->len counter, and because the rcu_cblist structure is quite straightforward, it makes sense to open-code rcu_cblist_n_cbs(p) as p->len, cutting out a level of indirection. This commit makes this change. Reported-by: Ingo Molnar <mingo@kernel.org> Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: Linus Torvalds <torvalds@linux-foundation.org>
-rw-r--r--kernel/rcu/rcu_segcblist.h6
-rw-r--r--kernel/rcu/tree.c9
-rw-r--r--kernel/rcu/tree_plugin.h2
-rw-r--r--kernel/rcu/tree_trace.c2
4 files changed, 6 insertions, 13 deletions
diff --git a/kernel/rcu/rcu_segcblist.h b/kernel/rcu/rcu_segcblist.h
index 7d18d41f0116..424a6b230921 100644
--- a/kernel/rcu/rcu_segcblist.h
+++ b/kernel/rcu/rcu_segcblist.h
@@ -22,12 +22,6 @@
22 22
23#include <linux/rcu_segcblist.h> 23#include <linux/rcu_segcblist.h>
24 24
25/* Return number of callbacks in simple callback list. */
26static inline long rcu_cblist_n_cbs(struct rcu_cblist *rclp)
27{
28 return rclp->len;
29}
30
31/* Return number of lazy callbacks in simple callback list. */ 25/* Return number of lazy callbacks in simple callback list. */
32static inline long rcu_cblist_n_lazy_cbs(struct rcu_cblist *rclp) 26static inline long rcu_cblist_n_lazy_cbs(struct rcu_cblist *rclp)
33{ 27{
diff --git a/kernel/rcu/tree.c b/kernel/rcu/tree.c
index 35152414760d..942d529fccbc 100644
--- a/kernel/rcu/tree.c
+++ b/kernel/rcu/tree.c
@@ -2633,9 +2633,8 @@ static void rcu_adopt_orphan_cbs(struct rcu_state *rsp, unsigned long flags)
2633 return; 2633 return;
2634 2634
2635 /* Do the accounting first. */ 2635 /* Do the accounting first. */
2636 rdp->n_cbs_adopted += rcu_cblist_n_cbs(&rsp->orphan_done); 2636 rdp->n_cbs_adopted += rsp->orphan_done.len;
2637 if (rcu_cblist_n_lazy_cbs(&rsp->orphan_done) != 2637 if (rcu_cblist_n_lazy_cbs(&rsp->orphan_done) != rsp->orphan_done.len)
2638 rcu_cblist_n_cbs(&rsp->orphan_done))
2639 rcu_idle_count_callbacks_posted(); 2638 rcu_idle_count_callbacks_posted();
2640 rcu_segcblist_insert_count(&rdp->cblist, &rsp->orphan_done); 2639 rcu_segcblist_insert_count(&rdp->cblist, &rsp->orphan_done);
2641 2640
@@ -2792,14 +2791,14 @@ static void rcu_do_batch(struct rcu_state *rsp, struct rcu_data *rdp)
2792 * Stop only if limit reached and CPU has something to do. 2791 * Stop only if limit reached and CPU has something to do.
2793 * Note: The rcl structure counts down from zero. 2792 * Note: The rcl structure counts down from zero.
2794 */ 2793 */
2795 if (-rcu_cblist_n_cbs(&rcl) >= bl && 2794 if (-rcl.len >= bl &&
2796 (need_resched() || 2795 (need_resched() ||
2797 (!is_idle_task(current) && !rcu_is_callbacks_kthread()))) 2796 (!is_idle_task(current) && !rcu_is_callbacks_kthread())))
2798 break; 2797 break;
2799 } 2798 }
2800 2799
2801 local_irq_save(flags); 2800 local_irq_save(flags);
2802 count = -rcu_cblist_n_cbs(&rcl); 2801 count = -rcl.len;
2803 trace_rcu_batch_end(rsp->name, count, !!rcl.head, need_resched(), 2802 trace_rcu_batch_end(rsp->name, count, !!rcl.head, need_resched(),
2804 is_idle_task(current), rcu_is_callbacks_kthread()); 2803 is_idle_task(current), rcu_is_callbacks_kthread());
2805 2804
diff --git a/kernel/rcu/tree_plugin.h b/kernel/rcu/tree_plugin.h
index 6b4b1f8a272d..7ebe357df155 100644
--- a/kernel/rcu/tree_plugin.h
+++ b/kernel/rcu/tree_plugin.h
@@ -1934,7 +1934,7 @@ static bool __maybe_unused rcu_nocb_adopt_orphan_cbs(struct rcu_state *rsp,
1934 struct rcu_data *rdp, 1934 struct rcu_data *rdp,
1935 unsigned long flags) 1935 unsigned long flags)
1936{ 1936{
1937 long ql = rcu_cblist_n_cbs(&rsp->orphan_done); 1937 long ql = rsp->orphan_done.len;
1938 long qll = rcu_cblist_n_lazy_cbs(&rsp->orphan_done); 1938 long qll = rcu_cblist_n_lazy_cbs(&rsp->orphan_done);
1939 1939
1940 /* If this is not a no-CBs CPU, tell the caller to do it the old way. */ 1940 /* If this is not a no-CBs CPU, tell the caller to do it the old way. */
diff --git a/kernel/rcu/tree_trace.c b/kernel/rcu/tree_trace.c
index 30c5bf89ee58..b7743aa2965f 100644
--- a/kernel/rcu/tree_trace.c
+++ b/kernel/rcu/tree_trace.c
@@ -278,7 +278,7 @@ static void print_one_rcu_state(struct seq_file *m, struct rcu_state *rsp)
278 rsp->n_force_qs - rsp->n_force_qs_ngp, 278 rsp->n_force_qs - rsp->n_force_qs_ngp,
279 READ_ONCE(rsp->n_force_qs_lh), 279 READ_ONCE(rsp->n_force_qs_lh),
280 rcu_cblist_n_lazy_cbs(&rsp->orphan_done), 280 rcu_cblist_n_lazy_cbs(&rsp->orphan_done),
281 rcu_cblist_n_cbs(&rsp->orphan_done)); 281 rsp->orphan_done.len);
282 for (rnp = &rsp->node[0]; rnp - &rsp->node[0] < rcu_num_nodes; rnp++) { 282 for (rnp = &rsp->node[0]; rnp - &rsp->node[0] < rcu_num_nodes; rnp++) {
283 if (rnp->level != level) { 283 if (rnp->level != level) {
284 seq_puts(m, "\n"); 284 seq_puts(m, "\n");