* Re: Question:Lockdep
[not found] <663A5575A842324DA6D21D04D5A49941F0B318@dggemm501-mbs.china.huawei.com>
@ 2018-01-19 16:44 ` Peter Zijlstra
0 siblings, 0 replies; only message in thread
From: Peter Zijlstra @ 2018-01-19 16:44 UTC (permalink / raw)
To: yangerkun; +Cc: miaoxie (A), linux-kernel@vger.kernel.org
On Fri, Jan 19, 2018 at 12:49:04PM +0000, yangerkun wrote:
> Hi,
> There is a problem confuses me while reading the soure code about lockdep:
> If thread get a lock first time, kernel will add a hash node in chainhash_table, then
> Copy and paste the lock chain and add the new one to tail. But, while checking deadlock,
> I have never seen the effects about the lock chain, instead, kernel will build the
> dependency graph for the checking. Does there some problems about this?
I'm not sure I fully understand your question. But the purpose of the
lock chain hash is to avoid work, its an optimization.
If we've already observed this lock chain before (hash hit), we'll not
do all the dependency checking.
Without this lockdep would be terribly slow.
^ permalink raw reply [flat|nested] only message in thread