[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Qemu-devel] MTTCG memory ordering
From: |
Stefan Hajnoczi |
Subject: |
Re: [Qemu-devel] MTTCG memory ordering |
Date: |
Fri, 14 Oct 2016 17:29:19 +0100 |
User-agent: |
Mutt/1.7.0 (2016-08-17) |
On Wed, Oct 12, 2016 at 10:58:43AM +0200, Stefan Hajnoczi wrote:
> I was curious about the status of your MTTCG GSoC work:
>
> I saw your fence series which implements the noop memory barrier/fence
> instructions on various architectures, but I wasn't sure if that also
> covers the case where a strong target is emulated on a weak host.
>
> Did you make TCG automatically emit barriers so stronger targets (x86)
> run correctly on weaker targets (ARM)?
Thanks for the responses!
I'm putting together 3 minutes of slides to present at the Google Summer
of Code Mentor Summit. This project is a good example of the technical
challenges in QEMU so I wanted to showcase it.
Glad I asked for clarification because originally I thought this project
was about emulating strong on weak memory ordering :).
Stefan
signature.asc
Description: PGP signature