[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <tip-09329d1c2024522308ca4de977fc6bba753bab1a@git.kernel.org>
Date: Wed, 27 Feb 2019 23:05:18 -0800
From: tip-bot for Bart Van Assche <tipbot@...or.com>
To: linux-tip-commits@...r.kernel.org
Cc: will.deacon@....com, peterz@...radead.org,
johannes@...solutions.net, paulmck@...ux.vnet.ibm.com,
tglx@...utronix.de, mingo@...nel.org, linux-kernel@...r.kernel.org,
akpm@...ux-foundation.org, torvalds@...ux-foundation.org,
longman@...hat.com, hpa@...or.com, bvanassche@....org
Subject: [tip:locking/core] locking/lockdep: Reorder struct lock_class
members
Commit-ID: 09329d1c2024522308ca4de977fc6bba753bab1a
Gitweb: https://git.kernel.org/tip/09329d1c2024522308ca4de977fc6bba753bab1a
Author: Bart Van Assche <bvanassche@....org>
AuthorDate: Thu, 14 Feb 2019 15:00:40 -0800
Committer: Ingo Molnar <mingo@...nel.org>
CommitDate: Thu, 28 Feb 2019 07:55:40 +0100
locking/lockdep: Reorder struct lock_class members
This patch does not change any functionality but makes the patch that
frees lock classes that are no longer in use easier to read.
Signed-off-by: Bart Van Assche <bvanassche@....org>
Signed-off-by: Peter Zijlstra (Intel) <peterz@...radead.org>
Cc: Andrew Morton <akpm@...ux-foundation.org>
Cc: Johannes Berg <johannes@...solutions.net>
Cc: Linus Torvalds <torvalds@...ux-foundation.org>
Cc: Paul E. McKenney <paulmck@...ux.vnet.ibm.com>
Cc: Peter Zijlstra <peterz@...radead.org>
Cc: Thomas Gleixner <tglx@...utronix.de>
Cc: Waiman Long <longman@...hat.com>
Cc: Will Deacon <will.deacon@....com>
Cc: johannes.berg@...el.com
Cc: tj@...nel.org
Link: https://lkml.kernel.org/r/20190214230058.196511-6-bvanassche@acm.org
Signed-off-by: Ingo Molnar <mingo@...nel.org>
---
include/linux/lockdep.h | 14 +++++++-------
1 file changed, 7 insertions(+), 7 deletions(-)
diff --git a/include/linux/lockdep.h b/include/linux/lockdep.h
index c5335df2372f..0c38bade84b7 100644
--- a/include/linux/lockdep.h
+++ b/include/linux/lockdep.h
@@ -76,6 +76,13 @@ struct lock_class {
*/
struct list_head lock_entry;
+ /*
+ * These fields represent a directed graph of lock dependencies,
+ * to every node we attach a list of "forward" and a list of
+ * "backward" graph nodes.
+ */
+ struct list_head locks_after, locks_before;
+
struct lockdep_subclass_key *key;
unsigned int subclass;
unsigned int dep_gen_id;
@@ -86,13 +93,6 @@ struct lock_class {
unsigned long usage_mask;
struct stack_trace usage_traces[XXX_LOCK_USAGE_STATES];
- /*
- * These fields represent a directed graph of lock dependencies,
- * to every node we attach a list of "forward" and a list of
- * "backward" graph nodes.
- */
- struct list_head locks_after, locks_before;
-
/*
* Generation counter, when doing certain classes of graph walking,
* to ensure that we check one node only once:
Powered by blists - more mailing lists