<div dir="ltr"><div><div><div><div><div>A completely non-technical point, but what's the current "polly" license? Does integrating that code conflict in any way with the work being done to relicense llvm?<br><br></div>Does adding polly expose any additional legal risks? Some people from Reservoir labs have explicitly stated to me that some of their patents target polyhedral optimizations. You should almost certainly review their portfolio or contact them.<br><br></div>If at some point someone wants to add real loop optimizations - will there be a conflict?<br><br></div>What's the DWARF look like after poly transformations?<br><br></div>The talk about performance is pretty light - It would be good to get something besides just a handful of spotlight known codes. Also code size, compilation speed. etc<br>------------<br></div>flag bikeshed - If it's not ready for -O3 - create specific flags to specific poly passes. Creating yet another micro flag like -O3poly just doesn't make sense to me. (keep it simple.) When it's really really ready, enable it with the rest of the loop heavy passes.<br><br><br><br></div><div class="gmail_extra"><br><div class="gmail_quote">On Wed, Sep 13, 2017 at 11:26 AM, Gerolf Hoflehner via llvm-dev <span dir="ltr"><<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div style="word-wrap:break-word;line-break:after-white-space"><div dir="auto" style="word-wrap:break-word;line-break:after-white-space"><br><div><div><div class="h5"><br><blockquote type="cite"><div>On Sep 11, 2017, at 10:47 PM, Hal Finkel via llvm-dev <<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a>> wrote:</div><br class="m_9191371802820001155Apple-interchange-newline"><div>
<div bgcolor="#FFFFFF" text="#000000"><p><br>
</p>
<div class="m_9191371802820001155moz-cite-prefix">On 09/11/2017 12:26 PM, Adam Nemet
wrote:<br>
</div>
<blockquote type="cite">
Hi Hal, Tobias, Michael and others,
<div><br>
<div>
<blockquote type="cite">
<div>On Sep 1, 2017, at 11:47 AM, Hal Finkel via
llvm-dev <<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a>>
wrote:</div>
<br class="m_9191371802820001155Apple-interchange-newline">
<div>
<div bgcolor="#FFFFFF" text="#000000"><div> <br class="m_9191371802820001155webkit-block-placeholder"></div><p> <b style="font-weight:normal" id="m_9191371802820001155docs-internal-guid-2e372c58-3ebe-fc55-3349-ab4430850fbc"> </b></p>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><b style="font-weight:normal" id="m_9191371802820001155docs-internal-guid-2e372c58-3ebe-fc55-3349-ab4430850fbc"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Hi everyone,</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">As you may know, stock LLVM does not provide the kind of advanced loop transformations necessary to provide good performance on many applications. LLVM's Polly project provides many of the required capabilities, including loop transformations such as fission, fusion, skewing, blocking/tiling, and interchange, all powered by state-of-the-art dependence analysis. Polly also provides automated parallelization and targeting of GPUs and other</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap"></span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap"><b> </b>accelerators.</span></b></div>
<b style="font-weight:normal" id="m_9191371802820001155docs-internal-guid-2e372c58-3ebe-fc55-3349-ab4430850fbc"> <br>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Over the past year, Polly’s development has focused on robustness, correctness, and closer integration with LLVM. To highlight a few accomplishments:</span></div>
<br>
<ul style="margin-top:0pt;margin-bottom:0pt">
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Polly now runs, by default, in the conceptually-proper place in LLVM’s pass pipeline (just before the loop vectorizer). Importantly, this means that its loop transformations are performed after inlining and other canonicalization, greatly increasing its robustness, and enabling its use on C++ code (where [] is often a function call before inlining).</span></div>
</li>
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Polly’s cost-modeling parameters, such as those describing the target’s memory hierarchy, are being integrated with TargetTransformInfo. This allows targets to properly override the modeling parameters and allows reuse of these parameters by other clients.</span></div>
</li>
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Polly’s method of handling signed division/remainder operations, which worked around lack of support in ScalarEvolution, is being replaced thanks to improvements being contributed to ScalarEvolution itself (see D34598). Polly’s core delinearization routines have long been a part of LLVM itself.</span></div>
</li>
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">PolyhedralInfo, which exposes a subset of Polly’s loop analysis for use by other clients, is now available.</span></div>
</li>
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Polly is now part of the LLVM release process and is being included with LLVM by various packagers (e.g., Debian).</span></div>
</li>
</ul>
<br>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">I believe that the LLVM community would benefit from beginning the process of integrating Polly with LLVM itself and continuing its development as part of our main code base. This will:</span></div>
<ul style="margin-top:0pt;margin-bottom:0pt">
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Allow for wider adoption of LLVM within communities relying on advanced loop transformations.</span></div>
</li>
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Provide for better community feedback on, and testing of, the code developed (although the story in this regard is already fairly solid).</span></div>
</li>
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Better motivate targets to provide accurate, comprehensive, modeling parameters for use by advanced loop transformations.</span></div>
</li>
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Perhaps most importantly, this will allow us to develop and tune the rest of the optimizer assuming that Polly’s capabilities are present (the underlying analysis, and eventually, the transformations themselves).</span></div>
</li>
</ul>
<br>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">The largest issue on which community consensus is required, in order to move forward at all, is what to do with isl. isl, the Integer Set Library, provides core functionality on which Polly depends. It is a C library, and while some Polly/LLVM developers are also isl developers, it has a large user community outside of LLVM/Polly. A C++ interface was recently added, and Polly is transitioning to use the C++ interface. Nevertheless, options here include rewriting the needed functionality, forking isl and transitioning our fork toward LLVM coding conventions (and data structures) over time, and incorporating isl more-or-less as-is to avoid partitioning its development.</span></div>
<br>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">That having been said, isl is internally modular, and regardless of the overall integration strategy, the Polly developers anticipate specializing, or even replacing, some of these components with LLVM-specific solutions. This is especially true for anything that touches performance-related heuristics and modeling. LLVM-specific, or even target-specific, loop schedulers may be developed as well.</span></div>
<br>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Even though some developers in the LLVM community already have a background in polyhedral-modeling techniques, the Polly developers have developed, and are still developing, extensive tutorials on this topic </span><a href="http://pollylabs.org/education.html" style="text-decoration:none" target="_blank"><span style="font-size:11pt;font-family:Arial;color:#1155cc;background-color:transparent;font-weight:400;font-style:normal;font-variant:normal;text-decoration:underline;vertical-align:baseline;white-space:pre-wrap">http://pollylabs.org/<wbr>education.html</span></a><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap"> and especially </span><a href="http://playground.pollylabs.org/" style="text-decoration:none" target="_blank"><span style="font-size:11pt;font-family:Arial;color:#1155cc;background-color:transparent;font-weight:400;font-style:normal;font-variant:normal;text-decoration:underline;vertical-align:baseline;white-space:pre-wrap">http://playground.pollylabs.<wbr>org</span></a><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">. </span></div>
<br>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Finally, let me highlight a few ongoing development efforts in Polly that are potentially relevant to this discussion. Polly’s loop analysis is sound and technically superior to what’s in LLVM currently (i.e. in LoopAccessAnalysis and DependenceAnalysis). There are, however, two known reasons why Polly’s transformations could not yet be enabled by default:</span></div>
<ul style="margin-top:0pt;margin-bottom:0pt">
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">A correctness issue: Currently, Polly assumes that 64 bits is large enough for all new loop-induction variables and index expressions. In rare cases, transformations could be performed where more bits are required. Preconditions need to be generated preventing this (e.g., D35471).</span></div>
</li>
<li dir="ltr" style="list-style-type:disc;font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline">
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">A performance issue: Polly currently models temporal locality (i.e., it tries to get better reuse in time), but does not model spatial locality (i.e., it does not model cache-line reuse). As a result, it can sometimes introduce performance regressions. Polly Labs is currently working on integrating spatial locality modeling into the loop optimization model.</span></div>
</li>
</ul>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Polly can already split apart basic blocks in order to implement loop fusion. Heuristics to choose at which granularity are still being implemented (e.g., PR12402).</span></div>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">I believe that we can now develop a concrete plan for moving state-of-the-art loop optimizations, based on the technology in the Polly project, into LLVM. Doing so will enable LLVM to be competitive with proprietary compilers in high-performance computing, machine learning, and other important application domains. I’d like community feedback on what</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap"></span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap"><b> </b>should be part of that plan.</span></div>
</b></div>
</div>
</blockquote>
<div><br>
</div>
<div>One thing that I’d like to see more details on is what
this means for the evolution of loop transformations in
LLVM.</div>
<div><br>
</div>
<div>Our more-or-less established direction was so far to
incrementally improve and generalize the required analyses
(e.g. the LoopVectorizer’s dependence analysis + loop
versioning analysis into a stand-alone analysis pass
(LoopAccessAnalysis)) and then build new transformations
(e.g. LoopDistribution, LoopLoadElimination,
LICMLoopVersioning) on top of these.</div>
<div><br>
</div>
<div>The idea was that infrastructure would be incrementally
improved from two directions:</div>
<div><br>
</div>
<div>- As new transformations are built analyses have to be
improved (e.g. past improvements to LAA to support the
LoopVersioning utility, future improvements for full
LoopSROA beyond just store->load forwarding [1] or the
improvements to LAA for the LoopFusion proposal[2])</div>
<div><br>
</div>
<div>- As more complex loops would have to be analyzed we
either improve LAA or make DependenceAnalysis a drop-in
replacement for the memory analysis part in LAA</div>
</div>
</div>
</blockquote>
<br>
Or we could use Polly's dependence analysis, which I believe to be
more powerful, more robust, and more correct than
DependenceAnalysis. I believe that the difficult part here is
actually the pairing with predicated SCEV or whatever mechanism we
want to use generate runtime predicates (this applies to use of
DependenceAnalysis too).<br></div></div></blockquote><div><br></div></div></div>What is a good way to measure these assertions (More powerful, more robust)? Are you saying the LLVM Dependence Analysis is incorrect or do you actually mean less conservative (or "more accurate" or something like that)?<span class=""><br><blockquote type="cite"><div><div bgcolor="#FFFFFF" text="#000000">
<br>
<blockquote type="cite">
<div>
<div>
<div><br>
</div>
<div>While this model may be slow it has all the benefits of
the incremental development model.</div>
</div>
</div>
</blockquote>
<br>
The current model may have been slow in many areas, but I think
that's mostly a question of development effort. My largest concern
about the current model is that, to the extent that we're
implementing classic loop transformations (e.g., fusion,
distribution, interchange, skewing, tiling, and so on), we're
repeating a historical design that is known to have several
suboptimal properties. Chief among them is the lack of integration:
many of these transformations are interconnected, and there's no
good pass ordering in which to make independent decisions. Many of
these transformations can be captured in a single model and we can
get much better results by integrating them. There's also the matter
of whether building these transformation on SCEV (or IR directly) is
the best underlying infrastructure, or whether parts of Polly would
be better.<br></div></div></blockquote><div><br></div></span>I believe that is true. What I wonder is is there a good method to reason about it? Perhaps concrete examples or perhaps opt-viewer based comparisons on large sets of benchmarks? In the big picture you could make such a modeling argument for all compiler optimizations.<span class=""><br><blockquote type="cite"><div><div bgcolor="#FFFFFF" text="#000000">
<br>
That having been said, I think that integrating this technology into
LLVM will also mean applying appropriate modularity. I think that
we'll almost definitely want to make use of the dependence analysis
separately as an analysis. We'll want to decide which of these
transformations will be considered canonicalization (and run in the
iterative pipeline) and which will be lowering (and run near the
vectorizer). LoopSROA certainly sounds to me like canonicalization,
but loop fusion might also fall into that category (i.e., we might
want to fuse early to enable optimizations and then split late).<br>
<br>
<blockquote type="cite">
<div>
<div>
<div><br>
</div>
<div>Then there is the question of use cases. It’s fairly
obvious that anybody wanting to optimize a 5-deep highly
regular loop-nest operating on arrays should use Polly. On
the other hand it’s way less clear that we should use it for
singly or doubly nested not-so-regular loops which are the
norm in non-HPC workloads.</div>
</div>
</div>
</blockquote>
<br>
This is clearly a good question, but thinking about Polly as a set
of components, not as a monolithic transformation component, I think
that polyhedral analysis and transformations can underlie a lot of
the transformations we need for non-HPC code (and, which I'll point
out, we need for modern HPC code too). In practice, the loops that
we can actually analyze have affine dependencies, and Polly does, or
can do, a better job at generating runtime predicates and dealing
with piecewise-linear expressions than our current infrastructure.<br>
<br>
In short, I look at Polly as two things: First, an infrastructure
for dealing with loop analysis and transformation. I view this as
being broadly applicable. Second, an application of that to apply
cost-model-driven classic loop transformations. To some extent this
is going to be more useful for HPC codes, but also applies to
machine learning, signal processing, graphics, and other areas. <br></div></div></blockquote></span>I’m wondering if it could be used for pointing out headroom for the existing LLVM ecosystem (*)<span class=""><br><br><blockquote type="cite"><div><div bgcolor="#FFFFFF" text="#000000">
<br>
<blockquote type="cite">
<div>
<div>
<div><br>
</div>
<div>And this brings me to the maintenance question. Is it
reasonable to expect people to fix Polly when they have a
seemingly unrelated change that happens to break a Polly
bot.</div>
</div>
</div>
</blockquote>
<br>
The eventual goal here is to have this technology in appropriate
parts of the main pipeline, and so the question here is not really
about breaking a "Polly bot", but just about a "bot" in general.
I've given this question some thought and I think it sits in a
reasonable place in the risk-reward space. The answer would be, yes,
we'd need to treat this like any other part of the pipeline.
However, I believe that Polly has as many, or more, active
contributors than essentially any other individual part of the
mid-level optimizer or CodeGen. As a result, there will be people
around in many time zones to help with problems with Polly-related
code.<br>
<br>
<blockquote type="cite">
<div>
<div>
<div> As far as I know, there were companies in the past that
tried Polly without a whole lot of prior experience. It
would be great to hear what the experience was before
adopting Polly at a much larger scale.</div>
</div>
</div>
</blockquote>
<br>
I'm also interested, although I'll caution against over-interpreting
any evidence here (positive or negative). Before a few weeks ago,
Polly didn't effectively run in the pipeline after inlining, and so
I doubt it would have been much use outside of embedded environments
(and maybe some HPC environments) with straightforwardly-presented C
code. It's only now that this has been fixed that I find the
possibility of integrating this in production interesting.<br></div></div></blockquote><div><br></div></span>That is a good point. There are also biases independent of past experiences (for disclosure mine is (*) above). But I think it is objective to say a Polly integration is a big piece to swallow.Your pro-Polly argument lists a number of categories that I think could be reasoned about individually and partly evaluated with a data-driven approach:</div><div>A) Architecture</div><div>- support for autoparallelism</div><div>- support for accelerators</div><div>- isl- rewrite? etc</div><div>...</div><div>B) Modelling</div><div>- polyhedral model</div><div>- temporal locality</div><div>- spatial locality </div><div>…</div><div>C) Analysis/Optimizations</div><div>- Dependence Analysis</div><div>- Transformation effective/power (loop nests, quality of transformations, #vectorizable loops etc)</div><div><br></div><div>A) is mostly Polly independent (except for the isl question I guess). For B and C performance/ compile-time /opt-viewer data on a decent/wide range of benchmarks possibly at different optimization levels (O2, O3, LTO, PGO etc and combinations) should provide data-driven insight into costs/benefits. </div><div><br></div><div>Cheers</div><div>Gerolf</div><div><div class="h5"><div><br></div><div><br></div><div><br></div><div><br><blockquote type="cite"><div><div bgcolor="#FFFFFF" text="#000000">
<br>
Thanks again,<br>
Hal <br>
<br>
<blockquote type="cite">
<div>
<div>
<div><br>
</div>
<div>Adam</div>
<div><br>
</div>
<div>[1] <a href="http://lists.llvm.org/pipermail/llvm-dev/2015-November/092017.html" target="_blank">http://lists.llvm.org/<wbr>pipermail/llvm-dev/2015-<wbr>November/092017.html</a></div>
<div>
<div>[2] <a href="http://lists.llvm.org/pipermail/llvm-dev/2016-March/096266.html" target="_blank">http://lists.llvm.org/<wbr>pipermail/llvm-dev/2016-March/<wbr>096266.html</a></div>
<div><br>
</div>
<div><br>
</div>
</div>
<blockquote type="cite">
<div>
<div bgcolor="#FFFFFF" text="#000000"><b style="font-weight:normal" id="m_9191371802820001155docs-internal-guid-2e372c58-3ebe-fc55-3349-ab4430850fbc"> <br>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Sincerely,</span></div>
<div style="line-height:1.38;margin-top:0pt;margin-bottom:0pt"><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Hal (on behalf of myself, Tobias Grosser, and Michael Kruse, with feedback from<b> </b>several other active Polly developers)</span></div>
<br>
<span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">We thank the numerous people who have contributed to the Polly infrastructure:</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Alexandre Isoard, Andreas Simbuerger, Andy Gibbs, Annanay Agarwal, Armin</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Groesslinger, Ajith Pandel, Baranidharan Mohan, Benjamin Kramer, Bill</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Wendling, Chandler Carruth, Craig Topper, Chris Jenneisch, Christian</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Bielert, Daniel Dunbar, Daniel Jasper, David Blaikie, David Peixotto,</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Dmitry N. Mikushin, Duncan P. N. Exon Smith, Eli Friedman, Eugene</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Zelenko, George Burgess IV, Hans Wennborg, Hongbin Zheng, Huihui Zhang,</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Jakub Kuderski, Johannes Doerfert, Justin Bogner, Karthik Senthil, Logan</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Chien, Lawrence Hu, Mandeep Singh Grang, Matt Arsenault, Matthew</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Simpson, Mehdi Amini, Micah Villmow, Michael Kruse, Matthias Reisinger,</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Maximilian Falkenstein, Nakamura Takumi, Nandini Singhal, Nicolas</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Bonfante, Patrik Hägglund, Paul Robinson, Philip Pfaffe, Philipp Schaad,</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Peter Conn, Pratik Bhatu, Rafael Espindola, Raghesh Aloor, Reid</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Kleckner, Roal Jordans, Richard Membarth, Roman Gareev, Saleem</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Abdulrasool, Sameer Sahasrabuddhe, Sanjoy Das, Sameer AbuAsal, Sam</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Novak, Sebastian Pop, Siddharth Bhat, Singapuram Sanjay Srivallabh,</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Sumanth Gundapaneni, Sunil Srivastava, Sylvestre Ledru, Star Tan, Tanya</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Lattner, Tim Shen, Tarun Ranjendran, Theodoros Theodoridis, Utpal Bora,</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">
</span><span style="font-size:11pt;font-family:Arial;background-color:transparent;font-weight:400;font-style:normal;font-variant-ligatures:normal;font-variant-caps:normal;font-variant-east-asian:normal;text-decoration:none;vertical-align:baseline;white-space:pre-wrap">Wei Mi, Weiming Zhao, and Yabin Hu.</span></b>
<div><br class="m_9191371802820001155webkit-block-placeholder">
</div>
<pre class="m_9191371802820001155moz-signature" cols="72">--
Hal Finkel
Lead, Compiler Technology and Programming Languages
Leadership Computing Facility
Argonne National Laboratory</pre>
</div>
______________________________<wbr>_________________<br>
LLVM Developers mailing list<br>
<a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a><br>
<a class="m_9191371802820001155moz-txt-link-freetext" href="http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev" target="_blank">http://lists.llvm.org/cgi-bin/<wbr>mailman/listinfo/llvm-dev</a><br>
</div>
</blockquote>
</div>
<br>
</div>
</blockquote>
<br>
<pre class="m_9191371802820001155moz-signature" cols="72">--
Hal Finkel
Lead, Compiler Technology and Programming Languages
Leadership Computing Facility
Argonne National Laboratory</pre>
</div>
______________________________<wbr>_________________<br>LLVM Developers mailing list<br><a href="mailto:llvm-dev@lists.llvm.org" target="_blank">llvm-dev@lists.llvm.org</a><br><a href="http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev" target="_blank">http://lists.llvm.org/cgi-bin/<wbr>mailman/listinfo/llvm-dev</a><br></div></blockquote></div><br></div></div></div></div><br>______________________________<wbr>_________________<br>
LLVM Developers mailing list<br>
<a href="mailto:llvm-dev@lists.llvm.org">llvm-dev@lists.llvm.org</a><br>
<a href="http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev" rel="noreferrer" target="_blank">http://lists.llvm.org/cgi-bin/<wbr>mailman/listinfo/llvm-dev</a><br>
<br></blockquote></div><br></div>