Nick Piggin writes: > So your readl can pass an earlier cacheable store or earlier writel?
No. It's quite gross at the moment, it has a sync before the access (i.e. a full mb()) and a twi; isync sequence after the access that stalls execution until the data comes back. > > We don't provide meaningless ones like writel + cacheable store for > > example. (PCI posting would defeat it anyway). > > What do you mean by meaningless? Ordering of writel followed by a > cacheable store is meaningful eg. for retaining io operations within > locks. OK, you explicitly have some extra code for spin_unlock, but > not for bit locks, mutexes, etc. It would make sense to have the > default operations _very_ strongly ordered IMO, and then move drivers > to be more relaxed when they are verified. It's meaningless in the sense that nothing guarantees that the writel has actually hit the device, even if we put a full mb() barrier in between the writel and the cacheable write. That would guarantee that the writel had got to the PCI host bridge, and couldn't be reordered with other accesses to the device, but not that the device had actually seen it. I don't mind adding code to the mutex unlock to do the same as spin_unlock, but I really don't want to have *two* sync instructions for every MMIO write. One is bad enough. Paul. _______________________________________________ Linuxppc-dev mailing list Linuxppc-dev@ozlabs.org https://ozlabs.org/mailman/listinfo/linuxppc-dev
