Re: Memory Barrier Definitions

Justin Carlson (justinca@ri.cmu.edu)
08 May 2002 09:54:24 -0400


On Tue, 2002-05-07 at 22:49, Dave Engebretsen wrote:

> PPC also guarantees every ordering when using the 'sync' instruction, so
> that will give correctness at the price of a 1000 cycles or so. You
> refer to different rules for cached vs uncached on other implementations
> -- that is the essence of our problem. Are there different barrier
> instructions in MIPS which provide different levels of performance for
> different ordering enforcements?
>
> Dave.

No, there aren't. The implementation details can affect which
primitives need to explicitly sync, though.

For instance, the BRCM1250 makes some guarantees about visibility of
uncached writes that aren't strictly required by the architecture spec.

-Justin

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/