Displaying 3 results from an estimated 3 matches for "kildal".
Did you mean:
kildall
2017 Aug 01
7
[RFC] Add IR level interprocedural outliner for code size.
...")
>
>
This assumes, strongly, that this reduction is the way to do it, and also
that SSA/etc imparts no structure in the reduction that enables you to
solve it faster (IE restricts the types of graphs, etc)
FWIW, the exact argument above holds for value numbering, and since the
days of kildall, it was believed not solvable in a complete fashion in less
than exponential time due to the need to do graph isomorphism on large
value graphs at join points.
Except, much like RA and other things, it turns out this is not right for
SSA, and in the past few years, it was proved you could do comp...
2016 Aug 31
3
[RFC] Interprocedural MIR-level outlining pass
On Tue, Aug 30, 2016 at 7:28 PM, Daniel Berlin <dberlin at dberlin.org> wrote:
> I tend to agree with Hal -- value numbering computes equivalent *values*,
>>
> Sorry, but this is just flat out wrong
>
> "A Global Value Numbering(GVN) algorithm is considered to be complete (or
> precise), if it can detect all Herbrand equivalences among expressions in a
>
2017 Aug 01
4
[RFC] Add IR level interprocedural outliner for code size.
2017-07-28 21:58 GMT-07:00 Chris Bieneman via llvm-dev <
llvm-dev at lists.llvm.org>:
> Apologies for delayed joining of this discussion, but I had a few notes
> from this thread that I really wanted to chime in about.
>
> River,
>
> I don't mean to put you on the spot, but I do want to start on a semantic
> issue. In several places in the thread you used the words