|Subject:||Re: Lots of bugs with current->state = TASK_*INTERRUPTIBLE|
|From:||David Daney <firstname.lastname@example.org>|
|Date:||Thu, 21 Jan 2010 12:21:45 -0800|
|Cc:||LKML <email@example.com>, kernel-janitors <firstname.lastname@example.org>, Peter Zijlstra <email@example.com>, Andrew Morton <firstname.lastname@example.org>, email@example.com, Greg KH <firstname.lastname@example.org>, Andy Whitcroft <email@example.com>, Ralf Baechle <firstname.lastname@example.org>, linux-mips <email@example.com>|
|References:||<firstname.lastname@example.org> <4B58A89A.email@example.com> <firstname.lastname@example.org> <4B58B1B3.email@example.com> <firstname.lastname@example.org>|
|User-agent:||Thunderbird 126.96.36.199 (X11/20090320)|
This is what I thought.My cpu (Cavium Octeon) does not have out of order reads, so my wmb() isCan you have reads that are out of order wrt writes? Because the above does not have out of order reads. It just had a read that came before a write. The above code could look like: (hypothetical assembly language) ld r2, TASK_UNINTERRUPTIBLE st r2, (current->state) wmb ld r1, (x) cmp r1, 0 Is it possible for the CPU to do the load of r1 before storing r2? If so, then the bug still exists.
Indeed it is. Lockless operations make my head hurt. Thanks for clarifying. David Daney
-- Stevein fact a full mb() from the point of view of the current CPU. So I think I could weaken my bariers in set_current_state() and still get correct operation. However as you say...
|<Prev in Thread]||Current Thread||[Next in Thread>|
|Previous by Date:||Re: [PATCH 1/3] resources: introduce generic page_is_ram(), Xiaotian Feng|
|Next by Date:||Re: Lots of bugs with current->state = TASK_*INTERRUPTIBLE, David Daney|
|Previous by Thread:||Re: Lots of bugs with current->state = TASK_*INTERRUPTIBLE, Steven Rostedt|
|Next by Thread:||[PATCH 1/3] resources: introduce generic page_is_ram(), Wu Fengguang|
|Indexes:||[Date] [Thread] [Top] [All Lists]|