[PATCH] Add a fence elimination pass

[Daniel Berlin]

Hey, if you can get it to work fast with a min-cut formulation on programs
with lots of fences, that would be awesome :)
As I told JF, I haven't played with such formulations in about 7 years, so
it's entirely possible the world is a better place now.

They are certainly conceptually simpler to work with and reason about :)


On Wed Nov 05 2014 at 8:08:15 AM JF Bastien <jfb at chromium.org> wrote:

> (Discussing this offline with Danny)
>
> I'd like measurements for your approach. I'm not sure it'll be slow on big
> functions because your graph is a subset of all the IR in the function.
>
> As we discussed, csmith should be able to generate big functions with lots
> of fences. Measuring runtime at different CFG size and fence+surrounding
> memory size would be useful, and basic profiling would show where overheads
> are in the current code.
>
> I think that should inform whether another algorithm should be tried.
>
> http://reviews.llvm.org/D5758
>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20141105/fd0f077c/attachment.html>