<html>
<head>
<base href="http://bugs.llvm.org/">
</head>
<body><span class="vcard"><a class="email" href="mailto:davide@freebsd.org" title="Davide Italiano <davide@freebsd.org>"> <span class="fn">Davide Italiano</span></a>
</span> changed
<a class="bz_bug_link
bz_status_RESOLVED bz_closed"
title="RESOLVED FIXED - llc takes forever on a test with lots of spills"
href="http://bugs.llvm.org/show_bug.cgi?id=32767">bug 32767</a>
<br>
<table border="1" cellspacing="0" cellpadding="8">
<tr>
<th>What</th>
<th>Removed</th>
<th>Added</th>
</tr>
<tr>
<td style="text-align:right;">Resolution</td>
<td>---
</td>
<td>FIXED
</td>
</tr>
<tr>
<td style="text-align:right;">Status</td>
<td>REOPENED
</td>
<td>RESOLVED
</td>
</tr></table>
<p>
<div>
<b><a class="bz_bug_link
bz_status_RESOLVED bz_closed"
title="RESOLVED FIXED - llc takes forever on a test with lots of spills"
href="http://bugs.llvm.org/show_bug.cgi?id=32767#c12">Comment # 12</a>
on <a class="bz_bug_link
bz_status_RESOLVED bz_closed"
title="RESOLVED FIXED - llc takes forever on a test with lots of spills"
href="http://bugs.llvm.org/show_bug.cgi?id=32767">bug 32767</a>
from <span class="vcard"><a class="email" href="mailto:davide@freebsd.org" title="Davide Italiano <davide@freebsd.org>"> <span class="fn">Davide Italiano</span></a>
</span></b>
<pre>The commit that fixed the compile time regression is
```
commit 30a921f62a8444a478e456d99022ea847f48336c
Author: Nirav Dave <<a href="mailto:niravd@google.com">niravd@google.com</a>>
Date: Tue Mar 14 00:34:14 2017 +0000
In visitSTORE, always use FindBetterChain, rather than only when UseAA is
enabled.
Recommiting with compiler time improvements
Recommitting after fixup of 32-bit aliasing sign offset bug in
DAGCombiner.
* Simplify Consecutive Merge Store Candidate Search
Now that address aliasing is much less conservative, push through
simplified store merging search and chain alias analysis which only
checks for parallel stores through the chain subgraph. This is cleaner
as the separation of non-interfering loads/stores from the
store-merging logic.
When merging stores search up the chain through a single load, and
finds all possible stores by looking down from through a load and a
TokenFactor to all stores visited.
This improves the quality of the output SelectionDAG and the output
Codegen (save perhaps for some ARM cases where we correctly constructs
wider loads, but then promotes them to float operations which appear
but requires more expensive constant generation).
Some minor peephole optimizations to deal with improved SubDAG shapes
(listed below)
[...]
```</pre>
</div>
</p>
<hr>
<span>You are receiving this mail because:</span>
<ul>
<li>You are on the CC list for the bug.</li>
</ul>
</body>
</html>