[LLVMdev] [PATCH] Re: Pluggable Register Coalescers
David Greene
dag at cray.com
Wed Jul 18 13:51:16 PDT 2007
On Wednesday 18 July 2007 13:08, Evan Cheng wrote:
> > As a proof of concept, I have an example of what the linear scan
> > algorithm
> > might provide. It's very inefficient and in practice linear scan
> > probably
> > won't ever interact with a coalescer that partners with the
> > allocator but
> > it serves to show that the interface can be met by something that
> > doesn't
> > use a graph.
>
> Is this something you are going to contribute back to the repository?
Yes, that's the plan.
> Ok. I am willing to be flexible if it helps moving things along. Just
> make sure you pick decorative names for the entry points. For
> example, rather than invoke(), use something like CoalesceFunction().
> And please try to limit the number of such entries.
Agreed.
> > I'm still working out getting things to build, etc. and will post a
> > patch when
> > I've got through all that. But does this sound like something
> > closer to what
> > we want?
>
> Ok. Thanks!
Great. I'll keep working at it and post when ready.
-Dave
More information about the llvm-dev
mailing list