lkml.org 
[lkml]   [2008]   [Apr]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH] Replace completions with semaphores
On Wed, Apr 16, 2008 at 06:42:50PM +0200, Oliver Neukum wrote:
> Am Mittwoch, 16. April 2008 18:34:14 schrieb Matthew Wilcox:
> > On Wed, Apr 16, 2008 at 06:31:08PM +0200, Oliver Neukum wrote:
> > > Am Mittwoch, 16. April 2008 18:16:52 schrieb Matthew Wilcox:
> > > > The basic idea is that you get back a cookie from the kcounter_claim()
> > > > which you have to hand to the kcounter_release() function so it
> > > > knows which one you released. ?It's similar to mutex debugging except
> > >
> > > So in addition to the kcounter we need to save a token in a data structure?
> > > In fact, there must be a data structure that can house that token. So you
> > > can no longer live with a pointer just to a device descriptor, but every
> > > individual use of a resource must have an associated data structure?
> >
> > That's right. Do you have an example where this would be inconvenient?
> > I couldn't find one. For example, with USB, you could place one in the
> > struct urb.
>
> That's a data structure we really want to shrink. And furthermore, the needs
> of the use cases should shape the locking primitives, not the reverse.

The cookies aren't checked by the kcounter implementation if
CONFIG_DEBUG_KCOUNTER isn't set. So you can avoid storing them if it's
*really* that important to shrink your data structures.

You'll still have to check the return value from the various
kcounter_claim* APIs for errors, of course.

--
Intel are signing my paycheques ... these opinions are still mine
"Bill, look, we understand that you're interested in selling us this
operating system, but compare it to ours. We can't possibly take such
a retrograde step."


\
 
 \ /
  Last update: 2008-04-16 18:47    [W:0.094 / U:0.640 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site