<feed xmlns='http://www.w3.org/2005/Atom'>
<title>llvm/test/Transforms/InstSimplify, branch release_30</title>
<subtitle>http://llvm.org</subtitle>
<id>https://git.amat.us/llvm/atom/test/Transforms/InstSimplify?h=release_30</id>
<link rel='self' href='https://git.amat.us/llvm/atom/test/Transforms/InstSimplify?h=release_30'/>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/'/>
<updated>2011-09-05T18:16:19Z</updated>
<entry>
<title>InstSimplify: Don't try to replace an extractvalue/insertvalue pair with the original value if types don't match.</title>
<updated>2011-09-05T18:16:19Z</updated>
<author>
<name>Benjamin Kramer</name>
<email>benny.kra@googlemail.com</email>
</author>
<published>2011-09-05T18:16:19Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=ae707bd5594e52a8b385760f99ff58aa8fede948'/>
<id>urn:sha1:ae707bd5594e52a8b385760f99ff58aa8fede948</id>
<content type='text'>
Fixes clang selfhost.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@139120 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Add some simple insertvalue simplifications, for the purpose of cleaning</title>
<updated>2011-09-05T06:52:48Z</updated>
<author>
<name>Duncan Sands</name>
<email>baldrick@free.fr</email>
</author>
<published>2011-09-05T06:52:48Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=dabc2806726a286b00313419fac8461ebe0f774c'/>
<id>urn:sha1:dabc2806726a286b00313419fac8461ebe0f774c</id>
<content type='text'>
up do-nothing exception handling code produced by dragonegg.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@139113 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Remove bogus test: for all possible inputs of %X, the 'sub nsw' is guaranteed</title>
<updated>2011-07-19T08:22:57Z</updated>
<author>
<name>Nick Lewycky</name>
<email>nicholas@mxc.ca</email>
</author>
<published>2011-07-19T08:22:57Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=bb2518c71671cf7962f8b5e9ab0f0eec9784a2c1'/>
<id>urn:sha1:bb2518c71671cf7962f8b5e9ab0f0eec9784a2c1</id>
<content type='text'>
to perform a signed wrap. Don't rely on any particular handling of that case.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@135471 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Improve constant folding of undef for cmp and select operators.</title>
<updated>2011-07-01T01:03:43Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2011-07-01T01:03:43Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=68c0dbc14fb7599987fb3e27be4e12c1ac36535e'/>
<id>urn:sha1:68c0dbc14fb7599987fb3e27be4e12c1ac36535e</id>
<content type='text'>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134223 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Improve constant folding of undef for binary operators.</title>
<updated>2011-07-01T00:42:17Z</updated>
<author>
<name>Dan Gohman</name>
<email>gohman@apple.com</email>
</author>
<published>2011-07-01T00:42:17Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=30cb6dda5ae441f27edef302cbb33936fbafba6d'/>
<id>urn:sha1:30cb6dda5ae441f27edef302cbb33936fbafba6d</id>
<content type='text'>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134221 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>The comparision "max(x,y)==x" is equivalent to "x&gt;=y".  Since the max is</title>
<updated>2011-05-07T16:56:49Z</updated>
<author>
<name>Duncan Sands</name>
<email>baldrick@free.fr</email>
</author>
<published>2011-05-07T16:56:49Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=e864b5b840c58d0b04324082ec94a7156743ed60'/>
<id>urn:sha1:e864b5b840c58d0b04324082ec94a7156743ed60</id>
<content type='text'>
often expressed as "x &gt;= y ? x : y", there is a good chance we can extract
the existing "x &gt;= y" from it and use that as a replacement for "max(x,y)==x".


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@131049 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Add variations on: max(x,y) &gt;= min(x,z) folds to true.  This isn't that common,</title>
<updated>2011-05-04T16:05:05Z</updated>
<author>
<name>Duncan Sands</name>
<email>baldrick@free.fr</email>
</author>
<published>2011-05-04T16:05:05Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=8140ad32ce45281ed2bc4f6ca388a6ed9f806550'/>
<id>urn:sha1:8140ad32ce45281ed2bc4f6ca388a6ed9f806550</id>
<content type='text'>
but according to my super-optimizer there are only two missed simplifications
of -instsimplify kind when compiling bzip2, and this is one of them.  It amuses
me to have bzip2 be perfectly optimized as far as instsimplify goes!


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@130840 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Implement some basic simplifications involving min/max, for example</title>
<updated>2011-05-03T19:53:10Z</updated>
<author>
<name>Duncan Sands</name>
<email>baldrick@free.fr</email>
</author>
<published>2011-05-03T19:53:10Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=ad20681cdeaf72383891b153b925624aa585be4d'/>
<id>urn:sha1:ad20681cdeaf72383891b153b925624aa585be4d</id>
<content type='text'>
max(a,b) &gt;= a -&gt; true.  According to my super-optimizer, these are
by far the most common simplifications (of the -instsimplify kind)
that occur in the testsuite and aren't caught by -std-compile-opts.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@130780 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Move some rem transforms out of instcombine and into instsimplify.</title>
<updated>2011-05-02T16:27:02Z</updated>
<author>
<name>Duncan Sands</name>
<email>baldrick@free.fr</email>
</author>
<published>2011-05-02T16:27:02Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=f24ed77d2416b66178d8ff1d807858dfab37ca18'/>
<id>urn:sha1:f24ed77d2416b66178d8ff1d807858dfab37ca18</id>
<content type='text'>
This automagically provides a transform noticed by my super-optimizer
as occurring quite often: "rem x, (select cond, x, 1)" -&gt; 0.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@130694 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
<entry>
<title>Teach ComputeMaskedBits about sub nsw.</title>
<updated>2011-03-12T17:18:11Z</updated>
<author>
<name>Benjamin Kramer</name>
<email>benny.kra@googlemail.com</email>
</author>
<published>2011-03-12T17:18:11Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/llvm/commit/?id=14b2a59301e9e4065c7b9b07a0c68462b6037a4f'/>
<id>urn:sha1:14b2a59301e9e4065c7b9b07a0c68462b6037a4f</id>
<content type='text'>
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@127548 91177308-0d34-0410-b5e6-96231b3b80d8
</content>
</entry>
</feed>
