[llvm-dev] Writing loop transformations on the right representation is more productive

[Chris Lattner via llvm-dev]

> On Feb 7, 2020, at 10:16 PM, Michael Kruse <llvmdev at meinersbur.de> wrote:
> 
> Am Fr., 7. Feb. 2020 um 17:03 Uhr schrieb Chris Lattner <clattner at nondot.org <mailto:clattner at nondot.org>>:
> > The discussion here is valuable for me, helping me to make my
> > presentation about it at EuroLLVM as relevant as possible. My current
> > idea is to take a complex loop nest, and compare optimizing it using
> > red/green DAGs and traditional pass-based optimizers.
> 
> Cool.  I’d really recommend you connect with some of the loop optimization people working on MLIR to learn more about what they are doing, because it is directly related to this and I’d love for there to be more communication.
> 
> I’ve cc'd Nicolas Vasilache, Uday Bondhugula, and Albert Cohen as examples that would be great to connect with.
> 
> You may have already seen my discussion with Uday on the mailing list. I would like to discuss approaches with all 3 of them, at latest at EuroLLVM (or contact be before that, e.g. on this mailing-list thread).

Great!  I’d be happy to join a discussion about this at EuroLLVM too.  I think it is really important to improve the loop optimizer in LLVM, and I’m glad you’re pushing on it!

-Chris

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20200208/3a7e3541/attachment.html>