[lkml]   [2011]   [Dec]   [21]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH for-3.3] mempool: clean up and document synchronization and memory barrier usage
Ooh, missed something.

On Wed, Dec 21, 2011 at 08:37:15AM -0800, Tejun Heo wrote:
> Yes, that's another way to put it. It's much easier to understand if
> you draw a graph with time on x axis and curr_nr on y and mark which
> curr_nr values are guaranteed to be visible to whom. If at any point
> of time, a freeing task sees curr_nr == min_nr, it's guaranteed that
> either it's staying that way or, if not, someone else will see the
> newly decremented value.

And there will be enough "someone elses" to restore curr_nr == min_nr.



 \ /
  Last update: 2011-12-21 17:47    [W:0.033 / U:5.388 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site