<feed xmlns='http://www.w3.org/2005/Atom'>
<title>llvm/test/Transforms/IndVarSimplify, branch release_27</title>
<subtitle>http://llvm.org</subtitle>
<id>https://git.amat.us/llvm/atom/test/Transforms/IndVarSimplify?h=release_27</id>
<link rel='self' href='https://git.amat.us/llvm/atom/test/Transforms/IndVarSimplify?h=release_27'/>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/'/>
<updated>2010-02-25T06:57:05Z</updated>
<entry>
<title>Make LoopSimplify change conditional branches in loop exiting blocks</title>
<updated>2010-02-25T06:57:05Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2010-02-25T06:57:05Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=85669637139089eaed8def1583ac04266c9654e2'/>
<id>urn:sha1:85669637139089eaed8def1583ac04266c9654e2</id>
<content type='text'>
which branch on undef to branch on a boolean constant for the edge
exiting the loop. This helps ScalarEvolution compute trip counts for
loops.

Teach ScalarEvolution to recognize single-value PHIs, when safe, and
ForgetSymbolicName to forget such single-value PHI nodes as apprpriate
in ForgetSymbolicName.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@97126 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Teach ScalarEvolution how to compute a tripcount for a loop with</title>
<updated>2010-02-19T18:12:07Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2010-02-19T18:12:07Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=00cb5b724547a821516292fe5cded7c6a5358bda'/>
<id>urn:sha1:00cb5b724547a821516292fe5cded7c6a5358bda</id>
<content type='text'>
true or false as its exit condition. These are usually eliminated by
SimplifyCFG, but the may be left around during a pass which wishes
to preserve the CFG.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@96683 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Reapply the new LoopStrengthReduction code, with compile time and</title>
<updated>2010-02-12T10:34:29Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2010-02-12T10:34:29Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=572645cf84060c0fc25cb91d38cb9079918b3a88'/>
<id>urn:sha1:572645cf84060c0fc25cb91d38cb9079918b3a88</id>
<content type='text'>
bug fixes, and with improved heuristics for analyzing foreign-loop
addrecs.

This change also flattens IVUsers, eliminating the stride-oriented
groupings, which makes it easier to work with.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@95975 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>-disable-output is no longer needed with -analyze.</title>
<updated>2010-01-26T19:25:59Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2010-01-26T19:25:59Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=8a977e2edd2ca182851cea96262ed9ba0c854c52'/>
<id>urn:sha1:8a977e2edd2ca182851cea96262ed9ba0c854c52</id>
<content type='text'>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@94574 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Re-implement the main strength-reduction portion of LoopStrengthReduction.</title>
<updated>2010-01-21T02:09:26Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2010-01-21T02:09:26Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=a10756ee657a4d43a48cca5c166919093930ed6b'/>
<id>urn:sha1:a10756ee657a4d43a48cca5c166919093930ed6b</id>
<content type='text'>
This new version is much more aggressive about doing "full" reduction in
cases where it reduces register pressure, and also more aggressive about
rewriting induction variables to count down (or up) to zero when doing so
reduces register pressure.

It currently uses fairly simplistic algorithms for finding reuse
opportunities, but it introduces a new framework allows it to combine
multiple strategies at once to form hybrid solutions, instead of doing
all full-reduction or all base+index.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@94061 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Use WriteAsOperand instead of getName() to print loop header names,</title>
<updated>2010-01-09T18:17:45Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2010-01-09T18:17:45Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=3073329c532aab96b58a322f2ac8bf93abefc60e'/>
<id>urn:sha1:3073329c532aab96b58a322f2ac8bf93abefc60e</id>
<content type='text'>
so that unnamed blocks are handled.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@93059 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Move this test from test/Transforms/IndVarSimplify to</title>
<updated>2010-01-05T22:52:54Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2010-01-05T22:52:54Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=d7d1a290034c0d991a22ecf4e94e66bfd9a3c8a1'/>
<id>urn:sha1:d7d1a290034c0d991a22ecf4e94e66bfd9a3c8a1</id>
<content type='text'>
test/CodeGen/X86, as doesn't use -indvars, and it does use
llc -march=x86-64.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@92799 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Make getUniqueExitBlocks's precondition assert more precise, to</title>
<updated>2009-12-11T20:05:23Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2009-12-11T20:05:23Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=050959cd08db6c0efb8208271a1d64ce58893e20'/>
<id>urn:sha1:050959cd08db6c0efb8208271a1d64ce58893e20</id>
<content type='text'>
avoid spurious failures. This fixes PR5758.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@91147 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Make opt default to not adding a target data string and update tests that depend on target data to supply it within the test</title>
<updated>2009-11-03T15:29:06Z</updated>
<author>
<name>Kenneth Uildriks</name>
<email>kennethuil@gmail.com</email>
</author>
<published>2009-11-03T15:29:06Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=b908f8ad6a38d989c7f769e329d778e563c398f4'/>
<id>urn:sha1:b908f8ad6a38d989c7f769e329d778e563c398f4</id>
<content type='text'>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@85900 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Add a testcase for r83011.</title>
<updated>2009-09-28T21:03:02Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2009-09-28T21:03:02Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=ff2483a109b84c4be66ea8d6e66db25162cd350c'/>
<id>urn:sha1:ff2483a109b84c4be66ea8d6e66db25162cd350c</id>
<content type='text'>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@83012 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
</feed>
