From mboxrd@z Thu Jan 1 00:00:00 1970 From: Benjamin Herrenschmidt Subject: Re: memory barrier question Date: Sat, 18 Sep 2010 07:49:08 +1000 Message-ID: <1284760148.30449.107.camel@pasglop> References: <3777.1284638136@redhat.com> <6383.1284647456@redhat.com> <20100916150356.GD2462@linux.vnet.ibm.com> <20100916163708.GG2462@linux.vnet.ibm.com> <1284656978.26423.11.camel@mulgrave.site> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 7bit Return-path: Received: from gate.crashing.org ([63.228.1.57]:42686 "EHLO gate.crashing.org" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1752125Ab0IQVtm (ORCPT ); Fri, 17 Sep 2010 17:49:42 -0400 In-Reply-To: Sender: linux-arch-owner@vger.kernel.org List-ID: To: Miklos Szeredi Cc: James Bottomley , paulmck@linux.vnet.ibm.com, dhowells@redhat.com, linux-kernel@vger.kernel.org, linux-arch@vger.kernel.org > Right but in the concrete namei example I can't see how a compiler > optimization can make a difference. The order of the loads is quite > clear: > > LOAD inode = next.dentry->inode > if (inode != NULL) > LOAD inode->f_op > > What is there the compiler can optimize? Those two loads depend on each other, I don't think any implementation can re-order them. In fact, such data dependency is typically what is used to avoid having barriers in some cases. The second load cannot be issued until the value from the first one is returned. Cheers, Ben.