Cc: Christoph Lameter <clameter@...>, Paul Mackerras <paulus@...>, <heiko.carstens@...>, <horms@...>, Stefan Richter <stefanr@...>, Linux Kernel Mailing List <linux-kernel@...>, David Miller <davem@...>, Paul E. McKenney <paulmck@...>, Ilpo Järvinen <ilpo.jarvinen@...>, <ak@...>, <cfriesen@...>, <rpjday@...>, Netdev <netdev@...>, <jesper.juhl@...>, <linux-arch@...>, Andrew Morton <akpm@...>, <zlynx@...>, <schwidefsky@...>, Chris Snook <csnook@...>, Herbert Xu <herbert@...>, Linus Torvalds <torvalds@...>, <wensong@...>, <wjiang@...>
If you're talking of "volatile" the type-qualifier keyword, then
http://lkml.org/lkml/2007/8/16/231 (and sub-thread below it) shows
otherwise.
I don't think an atomic_dec() implemented as an inline "asm volatile"
or one that uses a "forget" macro would have the same re-ordering
guarantees as an atomic_dec() that uses a volatile access cast.
-