lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date:	Thu, 17 Apr 2008 12:11:53 -0400 (EDT)
From:	Alan Stern <stern@...land.harvard.edu>
To:	Peter Zijlstra <peterz@...radead.org>
cc:	Kernel development list <linux-kernel@...r.kernel.org>,
	Ingo Molnar <mingo@...e.hu>,
	Paul E McKenney <paulmck@...ux.vnet.ibm.com>
Subject: Re: Semphore -> mutex in the device tree

On Thu, 17 Apr 2008, Peter Zijlstra wrote:

> On Thu, 2008-04-17 at 11:22 -0400, Alan Stern wrote:
> > Peter:
> > 
> > The obstacle to converting the semaphore in struct device to a mutex 
> > has been that its tree-oriented usage pattern isn't compatible with 
> > lockdep.
> > 
> > In order to get around this and at least begin the conversion process,
> > how about adding a provision for making some classes of mutex invisible
> > to lockdep?  I know it doesn't solve the fundamental problem, but maybe
> > it's a step in the right direction.
> 
> the device lock has two problems with lockdep:
> 
>  1) on suspend it takes more than MAX_LOCK_DEPTH (48) locks

This isn't true any more.  Not in Greg KH's development tree.

>  2) tree nesting
> 
> 
> Lets start with the easy one first; would a similar solution to the
> radix tree locking as found in -rt work?
> 
> http://programming.kicks-ass.net/kernel-patches/concurrent-pagecache/23-rc1-rt/radix-concurrent-lockdep.patch
> 
> That does mean you have to set an effective max depth to the tree, is
> that a practical issue?

I don't know.  But I suspect it wouldn't be sufficient to solve the 
problems associated with tree nesting.

For example, it's quite likely that some code somewhere needs to hold
two sibling nodes' locks at the same time.  Provided the parent node is
already locked, this operation is perfectly safe.  But is lockdep able
to handle it?

There are other, more subtle problems too; this is just one example.

> The harder part is 1), holding _that_ many locks. Would something
> obscene like this work for you:

This is no longer needed, fortunately.  :-)

Alan Stern

--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ