On Tuesday 03 June 2008 16:53, Paul Mackerras wrote:OK. OK, but I think fits OK with our SMP ordering model for cacheable stores: no amount of barriers on CPU0 will guarantee that CPU1 has seen the store, you actually have to observe a causual effect of the store before you can say that. So you can't provide iostore/store ordering without another sync after the writel store? I guess the problem with providing exceptions is that it makes it hard for people who absolutely don't know or care about ordering. I don't like having to think about it "hmm, we can allow this type of reordering... oh, unless some silly device does X...". If we come up with a sane set of weakly ordered accessors (including io_*mb()), it will make it easier to go through the important drivers and improve them. We don't have to enforce the the new semantics strictly until then if they'll slow you down too much in the meantime. --
| Mariusz Kozlowski | [PATCH 01] kmalloc + memset conversion co kzalloc |
| Rafael J. Wysocki | [Bug #10629] 2.6.26-rc1-$sha1: RIP __d_lookup+0x8c/0x160 |
| Vladislav Bolkhovitin | Re: Integration of SCST in the mainstream Linux kernel |
| Jeff Garzik | Re: [RFC] Heads up on sys_fallocate() |
git: | |
| Linus Torvalds | Re: [GIT]: Networking |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| Jarek Poplawski | [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| Andrew Morton | Re: [BUG] New Kernel Bugs |
