> > In Cat speak, > > > > diff --git a/tools/memory-model/linux-kernel.cat b/tools/memory-model/linux-kernel.cat > > index 59b5cbe6b6240..fd9c0831adf0a 100644 > > --- a/tools/memory-model/linux-kernel.cat > > +++ b/tools/memory-model/linux-kernel.cat > > @@ -38,7 +38,7 @@ let strong-fence = mb | gp > > (* Release Acquire *) > > let acq-po = [Acquire] ; po ; [M] > > let po-rel = [M] ; po ; [Release] > > -let rfi-rel-acq = [Release] ; rfi ; [Acquire] > > +let po-rel-rf-acq-po = po ; [Release] ; rf ; [Acquire] ; po > > > > (**********************************) > > (* Fundamental coherence ordering *) > > @@ -60,13 +60,13 @@ let dep = addr | data > > let rwdep = (dep | ctrl) ; [W] > > let overwrite = co | fr > > let to-w = rwdep | (overwrite & int) > > -let to-r = addr | (dep ; rfi) | rfi-rel-acq > > +let to-r = addr | (dep ; rfi) > > let fence = strong-fence | wmb | po-rel | rmb | acq-po > > -let ppo = to-r | to-w | fence > > +let ppo = to-r | to-w | fence | (po-rel-rf-acq-po & int) > > > > (* Propagation: Ordering from release operations and strong fences. *) > > let A-cumul(r) = rfe? ; r > > -let cumul-fence = A-cumul(strong-fence | po-rel) | wmb > > +let cumul-fence = A-cumul(strong-fence | po-rel) | wmb | po-rel-rf-acq-po > > let prop = (overwrite & ext)? ; cumul-fence* ; rfe? > > > > (* > > Isn't the job of the memory model to formalise the guarantees provided by > the implementation? Your diff appears to do exactly the opposite. This wouldn't be the first time..., but what am I missing? > > > I take this opportunity to summarize my viewpoint on these matters: > > > > Someone would have to write the commit message for the above diff ... > > that is, to describe -why- we should go RCtso (and update the documen- > > tation accordingly); by now, the only argument for this appears to be: > > "(most) people expect strong ordering" _and they will be "lazy enough" > > to not check their expectations by using the LKMM tool (paraphrasing > > from [1]); IAC, Linux "might work" better if we add this ordering to > > the LKMM. Agreeing on such an approach would mean agreeing that this > > argument "wins" over: > > > > "We want new architectures to implement acquire/release efficiently, > > and it's not unlikely that they will have acquire loads that are > > similar in semantics to LDAPR." [2] > > > > "RISC-V probably would have been RCpc [...] it takes extra fences > > to go from RCpc to either "RCtso" or RCsc." [3] > > > > (or similar instances) since, of course, there is no such thing as a > > "free strong ordering"; and I'm not only talking about "efficiency", > > I'm also thinking at the fact that someone will have to maintain that > > ordering across all the architectures and in the LKMM. > > > > If, OTOH, we agree that the above "win"/assumption is valid only for > > locks or, in other/better words, if we agree that we should maintain > > _two_ distinct release-acquire orderings (a first one for unlock-lock > > sequences and a second one for ordinary/atomic release-acquire, say, > > as proposed in the patch under RFC), I ask that we audit and modify > > the generic code accordingly/as suggested in other posts _before_ we > > upstream the changes for the LKMM: we should identify those places > > where (the newly introduced) _gap_ between unlock-lock and the other > > release-acquire is not admissible and fix those places (notice that > > this entails, in part., agreeing on what/where the generic code is). > > This is completely unrealistic. Have we already audited the kernel for the > current definition of the memory model? Should we revert it until we have? ?? The fact that we've not audited the entire kernel does not mean that we should throw away what has been already audited and verified (over time). IIUC, you're telling that we have a bunch of acquire/release spread across generic locking code _and_ responsible for providing the lock /unlock ordering guarantees, BUT we have no means to identify them. I would have said "hard", but hear you say "unrealistic" represents for me a very strong ARGUMENT AGAINST that "let us have two release- acquire..." > > Of course not. > > Right now, LKMM offers stronger guarantees that can portably be relied upon > in the codebase. Alan's patch fixes that, and holding back a fix for a known > issue runs counter to kernel development best practices. Then say so (and explain) in the commit message; AFAICT, failing to do so would also run counter best practices. > > > Finally, if we don't agree with the above assumption at all (that is, > > no matter if we are considering unlock-lock or other release-acquire > > sequences), then we should go RCpc [4]. > > > > I described three different approaches (which are NOT "independent", > > clearly; let us find an agreement...); even though some of them look > > insane to me, I'm currently open to all of them: thoughts? > > I'm very confused by your statements hypothesising about where our opinions > may lie. We've discussed this to death, and it's clear that everybody who's > commented apart from you is happy to weaken acquire/release but leave > locking alone. Alan's written a patch to that effect which, again, only you > seem to have a problem with. Heh, your confusion might be the reflection of mine... ;-) That was indeed a long and not conclusive discussion (meaning there're pending issues); and I cannot claim to find "arguments" such as: "More than one kernel developer has expressed the opinion that the LKMM should enforce ordering of writes by locking." particularly helpful (I do tend to be convinced by arguments rather than by opinions). In fact, you can take the following as my only current "constructive argument" against the patch [1,2]: THE COMMIT MESSAGE IS RIDICULOUS; PLEASE EXPAND ON IT, AND DO SO BY LEVERAGING BOTH PROS AND CONS OF THE APPLIED CHANGES > > The problem isn't about "if we agree foo" or "if we don't agree bar", the > problem is that you're the only person raising an objection, so please can > you provide a constructive argument against Alan's patch, rather than a > confusing monologue of "what-if"s and unreasonable demands of anonymous > contributors? We don't have to solve all of our problems before we can > make any progress. Hope the above can help, Andrea [1] http://lkml.kernel.org/r/20180710093821.GA5414@andrea [2] http://lkml.kernel.org/r/20180830125045.GA6936@andrea > > Thanks, > > Will
