Received-SPF: pass (google.com: best guess record for domain of linux-kernel-owner@vger.kernel.org designates 209.132.180.67 as permitted sender) client-ip=209.132.180.67;
Date:   Wed, 10 Jul 2019 13:18:30 +0800
From:   Boqun Feng <boqun.feng@gmail.com>
To:     Yuyang Du <duyuyang@gmail.com>
Cc:     peterz@infradead.org, will.deacon@arm.com, mingo@kernel.org,
        bvanassche@acm.org, ming.lei@redhat.com, frederic@kernel.org,
        tglx@linutronix.de, linux-kernel@vger.kernel.org,
        longman@redhat.com, paulmck@linux.vnet.ibm.com
Subject: Re: [PATCH v3 17/30] locking/lockdep: Add read-write type for a lock
 dependency
Message-ID: <20190710051830.GB14490@tardis>
References: <20190628091528.17059-1-duyuyang@gmail.com>
 <20190628091528.17059-18-duyuyang@gmail.com>
MIME-Version: 1.0
Content-Type: multipart/signed; micalg=pgp-sha256;
        protocol="application/pgp-signature"; boundary="Pd0ReVV5GZGQvF3a"
Content-Disposition: inline
In-Reply-To: <20190628091528.17059-18-duyuyang@gmail.com>
User-Agent: Mutt/1.12.0 (2019-05-25)
Sender: linux-kernel-owner@vger.kernel.org
Precedence: bulk


--Pd0ReVV5GZGQvF3a
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable

On Fri, Jun 28, 2019 at 05:15:15PM +0800, Yuyang Du wrote:
> Direct dependencies need to keep track of their read-write lock types.
> Two bit fields, which share the distance field, are added to lock_list
> struct so the types are stored there.
>=20
> With a dependecy lock1 -> lock2, lock_type1 has the type for lock1 and
> lock_type2 has the type for lock2, where the values are one of the
> lock_type enums.
>=20
> Signed-off-by: Yuyang Du <duyuyang@gmail.com>
> ---
>  include/linux/lockdep.h  | 15 ++++++++++++++-
>  kernel/locking/lockdep.c | 25 +++++++++++++++++++++++--
>  2 files changed, 37 insertions(+), 3 deletions(-)
>=20
> diff --git a/include/linux/lockdep.h b/include/linux/lockdep.h
> index eb26e93..fd619ac 100644
> --- a/include/linux/lockdep.h
> +++ b/include/linux/lockdep.h
> @@ -185,6 +185,8 @@ static inline void lockdep_copy_map(struct lockdep_ma=
p *to,
>  		to->class_cache[i] =3D NULL;
>  }
> =20
> +#define LOCK_TYPE_BITS	2
> +
>  /*
>   * Every lock has a list of other locks that were taken after or before
>   * it as lock dependencies. These dependencies constitute a graph, which
> @@ -207,7 +209,17 @@ struct lock_list {
>  	struct list_head		chains;
>  	struct lock_class		*class[2];
>  	struct lock_trace		trace;
> -	int				distance;
> +
> +	/*
> +	 * The lock_type fields keep track of the lock type of this
> +	 * dependency.
> +	 *
> +	 * With L1 -> L2, lock_type1 stores the lock type of L1, and
> +	 * lock_type2 stores that of L2.
> +	 */
> +	unsigned int			lock_type1 : LOCK_TYPE_BITS,
> +					lock_type2 : LOCK_TYPE_BITS,

Bad names ;-) Maybe fw_dep_type and bw_dep_type? Which seems to be
aligned with the naming schema other functions.

Regards,
Boqun

> +					distance   : 32 - 2*LOCK_TYPE_BITS;
> =20
>  	/*
>  	 * The parent field is used to implement breadth-first search.
> @@ -362,6 +374,7 @@ enum lock_type {
>  	LOCK_TYPE_WRITE		=3D 0,
>  	LOCK_TYPE_READ,
>  	LOCK_TYPE_RECURSIVE,
> +	NR_LOCK_TYPE,
>  };
> =20
>  /*
> diff --git a/kernel/locking/lockdep.c b/kernel/locking/lockdep.c
> index 3c97d71..1805017 100644
> --- a/kernel/locking/lockdep.c
> +++ b/kernel/locking/lockdep.c
> @@ -1307,9 +1307,17 @@ static struct lock_list *alloc_list_entry(void)
>   */
>  static int add_lock_to_list(struct lock_class *lock1, struct lock_class =
*lock2,
>  			    unsigned long ip, int distance,
> -			    struct lock_trace *trace, struct lock_chain *chain)
> +			    struct lock_trace *trace, struct lock_chain *chain,
> +			    int lock_type1, int lock_type2)
>  {
>  	struct lock_list *entry;
> +
> +	/*
> +	 * The distance bit field in struct lock_list must be large
> +	 * enough to hold the maximum lock depth.
> +	 */
> +	BUILD_BUG_ON((1 << (32 - 2*LOCK_TYPE_BITS)) < MAX_LOCK_DEPTH);
> +
>  	/*
>  	 * Lock not present yet - get a new dependency struct and
>  	 * add it to the list:
> @@ -1322,6 +1330,8 @@ static int add_lock_to_list(struct lock_class *lock=
1, struct lock_class *lock2,
>  	entry->class[1] =3D lock2;
>  	entry->distance =3D distance;
>  	entry->trace =3D *trace;
> +	entry->lock_type1 =3D lock_type1;
> +	entry->lock_type2 =3D lock_type2;
> =20
>  	/*
>  	 * Both allocation and removal are done under the graph lock; but
> @@ -1465,6 +1475,16 @@ static inline struct list_head *get_dep_list(struc=
t lock_list *lock, int forward
>  	return &class->dep_list[forward];
>  }
> =20
> +static inline int get_lock_type1(struct lock_list *lock)
> +{
> +	return lock->lock_type1;
> +}
> +
> +static inline int get_lock_type2(struct lock_list *lock)
> +{
> +	return lock->lock_type2;
> +}
> +
>  /*
>   * Forward- or backward-dependency search, used for both circular depend=
ency
>   * checking and hardirq-unsafe/softirq-unsafe checking.
> @@ -2503,7 +2523,8 @@ static inline void inc_chains(void)
>  	 * dependency list of the previous lock <prev>:
>  	 */
>  	ret =3D add_lock_to_list(hlock_class(prev), hlock_class(next),
> -			       next->acquire_ip, distance, trace, chain);
> +			       next->acquire_ip, distance, trace, chain,
> +			       prev->read, next->read);
>  	if (!ret)
>  		return 0;
> =20
> --=20
> 1.8.3.1
>=20

--Pd0ReVV5GZGQvF3a
Content-Type: application/pgp-signature; name="signature.asc"

-----BEGIN PGP SIGNATURE-----

iQEzBAABCAAdFiEEj5IosQTPz8XU1wRHSXnow7UH+rgFAl0ldSIACgkQSXnow7UH
+rjUfggAs1tL8SMEN1es3pqMdMCh4YkM/Q+DN5cPWAvNlxYbK0LyCsB988gqbRat
kI7VxYNptg622sloQjAToQkRsgU8CtjnpZHAvZRa16KmCz6xgXK0GkoM8IE5eQwH
ICZDAEEuUyXknzRKlMNlhZmkmXwfEidPni+wVUb2Lhaa4N2rGQIFNjphlKYVVzEp
EMw9gvEgyZ64Bu8517WvRKWCOS8AmaoMGWSODKjUEpHcp7PWIqILoSiyE9tvE5kh
nVvcIcgzf+fUu8qM4qEFgwVInfLiFa/YMx7HWv5nJ3RWbDS5OVulg3zJn9DYGeF/
8QSvp2ieavFbUfCjoSeqydd+je6rYw==
=akAy
-----END PGP SIGNATURE-----

--Pd0ReVV5GZGQvF3a--