[llvm-dev] [RFC] Interprocedural MIR-level outlining pass

[Daniel Berlin via llvm-dev]

>
>
> Yes, this was exactly my point. We want to recognize
> structurally-equivalent sequences of instructions on inequivalent operands.
>

Yes, and my point is "none of the vn and vn-dag generating algorithms care".

you can define equivalent to be "structural", you can define it to be
"these two variables are equivalent if they both start with "a"", you can
define it however you want.
They will still give you the dags you want.

This is as simple as substituting a hash and equality function.

To whit: Actual compilers do it this way.

So i'm entirely unsure why there is such an argument that it hard or
impossible, or even strange.

It is in fact quite easy, the same way GCC has had the VN pass that
produces expression DAG output, and had it used to  code hoisting, to do
PRE, to do folding, to do whatever.  It has been used for all of these
thing.

Some of these use a more standard  VN definition of equivalence that is
useful for redundancy elimination.
Some of them use one that is meant for folding (and would be illegal to use
for straight redundancy elimination).

If you want to build a pass that basically does the same thing, it seems
silly, but feel free!
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160831/05c3c5c8/attachment.html>