[llvm-dev] beneficial optimization of undef examples needed

David Blaikie via llvm-dev llvm-dev at lists.llvm.org
Mon Jun 19 08:25:11 PDT 2017


On Mon, Jun 19, 2017 at 7:36 AM Peter Lawrence via llvm-dev <
llvm-dev at lists.llvm.org> wrote:

> Sanjoy,
>             You have changed the subject.  We still need real world
> examples
> showing how taking advantage of “undef” results in beneficial optimization.
>
> My belief is that they don’t exist, my reasoning is this: real world
> programmers
> are likely to run UBSan before compiling (or if they don’t they should),
> therefore
> it is highly unlikely that any “undef” will actually exist during
> compilation of their
> source code.
>

Wait - that ^ doesn't seem to follow. The point of undefined behavior
optimizations isn't to only break programs that would trigger UBSan. The
point is to optimize on the assumption that they won't break UBSan/exhibit
undefined behavior.


> Yes, “Undef” can be created during SSA construction, but we already
> discussed
> That in a previous email (its a register allocation problem).
>
>
> The only other way I can see of “undef” occurring in IR is if we go out of
> our
> way to optimize for example
>
>         if (   ((i64)X + (i64)Y)) < INT_MIN   ||    ((i64)X) + (i64)Y) >
> INT_MAX   ) {
>                 . . .
>                 Z = X  "+nsw”  Y;
>                 . . .
>         }
>
> Here “Z” could in theory be replaced with “undef”, but there is no point
> in doing so.
>
> Similarly with provably out-of-bounds GEP, similarly with provably invalid
> pointers,
> etc, but again there is no point in doing so.
>

Why isn't there any point in doing so? One common situation where
exploiting UB (aka: "assuming UB can't happen") may be beneficial is when
the code in isolation is fine, but when inlined it's possible to prove
certain paths create contradictions. That way even if the conditions for
those paths can't be analyzed to prove they are unreachable (or values are
not needed, etc), the compiler can skip all that and just collapse the code
(remove the unreachable code, delete the value computation, etc) anyway.


>
>
> So is there any other way of having “undef” appear in the IR ?
>
>
> Peter Lawrence.
>
>
>
> > On Jun 16, 2017, at 7:45 PM, Sanjoy Das <sanjoy at playingwithpointers.com>
> wrote:
> >
> > Hi Peter,
> >
> > Why we need an undef value is covered here:
> > http://sunfishcode.github.io/blog/2014/07/14/undef-introduction.html
> > (in short, to do SSA construction well).
> >
> > For a while we did not have a literal representation for poison.
> > However, in practice having both undef and poison was problematic (see
> > the paper), so we decided to ditch undef and keep poison.
> >
> > However for the new poison to provide the same functionality as the
> > old undef (which is now going away), we need a literal representation
> > for the new poison.
> >
> > -- Sanjoy
> >
> > On Fri, Jun 16, 2017 at 3:03 PM, Peter Lawrence via llvm-dev
> > <llvm-dev at lists.llvm.org> wrote:
> >> All,
> >>     These discussions seem to be based on the premise that there is a
> >> need for the compiler to exploit undefined behavior for performance
> >> optimization reasons.
> >>
> >> So far the only beneficial optimization I am aware of that relies on
> some
> >> form of “undefined” is Dan Gohman’s original project for LP64 targets of
> >> promoting i32 induction variables to i64 and hoisting sign-extension out
> >> of the loop.
> >>
> >> But “undef” / “poison” never appears in either the original or the
> transformed
> >> IR for these types of loops, instead properties of “+nsw” are used to
> >> justify the transformation.  The transformation does not just fall out
> because
> >> we’ve done a good job at defining “undef” / “poison” IR nodes.
> >>
> >> So I’d like to see some concrete examples of where the compiler can
> >> do useful optimization based on “undef” / “poison” appearing explicitly
> >> In the IR,  finding some would surely advance this discussion.
> >>
> >>
> >>
> >> Peter Lawrence.
> >>
> >>
> >> _______________________________________________
> >> LLVM Developers mailing list
> >> llvm-dev at lists.llvm.org
> >> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev
>
> _______________________________________________
> LLVM Developers mailing list
> llvm-dev at lists.llvm.org
> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20170619/34772196/attachment.html>


More information about the llvm-dev mailing list