| From | Bart Van Assche <> | Subject | [PATCH v7 05/23] locking/lockdep: Reorder struct lock_class members | Date | Thu, 14 Feb 2019 15:00:40 -0800 |
| |
This patch does not change any functionality but makes the patch that frees lock classes that are no longer in use easier to read.
Cc: Peter Zijlstra <peterz@infradead.org> Cc: Waiman Long <longman@redhat.com> Cc: Johannes Berg <johannes@sipsolutions.net> Signed-off-by: Bart Van Assche <bvanassche@acm.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: -- 2.21.0.rc0.258.g878e2cd30e-goog
|