search for: e0c2a2c1

Displaying 2 results from an estimated 2 matches for "e0c2a2c1".

2020 Feb 08
2
Writing loop transformations on the right representation is more productive
...ist. 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). Michael -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20200208/e0c2a2c1/attachment.html>
2020 Feb 06
2
Writing loop transformations on the right representation is more productive
Am Mi., 5. Feb. 2020 um 18:13 Uhr schrieb Chris Lattner <clattner at nondot.org>: > If I understand your claims, you are claiming both that red/green trees are essential for a loop optimizer, and that this essential nature “justifies” the cost of reinventing an entire compiler infrastructure is lower than the benefit of using (e.g.) MLIR to do this. I haven’t seen evidence of either