<feed xmlns='http://www.w3.org/2005/Atom'>
<title>llvm-project.git/llvm/test/Transforms/LoopBoundSplit, branch users/nico/python-2</title>
<subtitle>Unnamed repository; edit this file 'description' to name the repository.
</subtitle>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/'/>
<entry>
<title>[LoopBoundSplit] Convert tests to opaque pointers (NFC)</title>
<updated>2022-12-27T11:52:22+00:00</updated>
<author>
<name>Nikita Popov</name>
<email>npopov@redhat.com</email>
</author>
<published>2022-12-27T11:52:22+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=dfc4a956f3df59287e0cf6652c0f72621aca6a6f'/>
<id>dfc4a956f3df59287e0cf6652c0f72621aca6a6f</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>[NFC] Port all LoopBoundSplit tests to `-passes=` syntax</title>
<updated>2022-12-07T23:38:45+00:00</updated>
<author>
<name>Roman Lebedev</name>
<email>lebedev.ri@gmail.com</email>
</author>
<published>2022-12-07T23:27:26+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=dec3a92eee3e3e7e43c61e54855e32665ea743a9'/>
<id>dec3a92eee3e3e7e43c61e54855e32665ea743a9</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>[LoopBoundSplit] Handle the case in which exiting block is loop header</title>
<updated>2021-10-08T08:13:41+00:00</updated>
<author>
<name>Jingu Kang</name>
<email>jingu.kang@arm.com</email>
</author>
<published>2021-10-04T09:23:54+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=4c98070cce2a4cfd769be47c316e44a254ffacf7'/>
<id>4c98070cce2a4cfd769be47c316e44a254ffacf7</id>
<content type='text'>
Update the incoming value of phi nodes in header of post-loop correctly.

Differential Revision: https://reviews.llvm.org/D110060
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Update the incoming value of phi nodes in header of post-loop correctly.

Differential Revision: https://reviews.llvm.org/D110060
</pre>
</div>
</content>
</entry>
<entry>
<title>[LoopBoundSplit] Check the start value of split cond AddRec</title>
<updated>2021-09-13T09:32:35+00:00</updated>
<author>
<name>Jingu Kang</name>
<email>jingu.kang@arm.com</email>
</author>
<published>2021-09-07T09:19:41+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=2a26d47a2d8295f4555f615feb86d599ae2c3af7'/>
<id>2a26d47a2d8295f4555f615feb86d599ae2c3af7</id>
<content type='text'>
After transformation, we assume the split condition of the pre-loop is always
true. In order to guarantee it, we need to check the start value of the split
cond AddRec satisfies the split condition.

Differential Revision: https://reviews.llvm.org/D109354
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
After transformation, we assume the split condition of the pre-loop is always
true. In order to guarantee it, we need to check the start value of the split
cond AddRec satisfies the split condition.

Differential Revision: https://reviews.llvm.org/D109354
</pre>
</div>
</content>
</entry>
<entry>
<title>[test] precommit a test for D109354</title>
<updated>2021-09-07T15:02:53+00:00</updated>
<author>
<name>Jingu Kang</name>
<email>jingu.kang@arm.com</email>
</author>
<published>2021-09-07T15:01:18+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=61d8e2719351ad0277a13d57c160962ba2d54976'/>
<id>61d8e2719351ad0277a13d57c160962ba2d54976</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>[LoopBoundSplit] Update phi node in exit block</title>
<updated>2021-09-03T08:10:50+00:00</updated>
<author>
<name>Jingu Kang</name>
<email>jingu.kang@arm.com</email>
</author>
<published>2021-09-02T14:47:24+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=562521e2d15aff38587aef8c6ea1baf3ed87513c'/>
<id>562521e2d15aff38587aef8c6ea1baf3ed87513c</id>
<content type='text'>
It fixes https://bugs.llvm.org/show_bug.cgi?id=51700

Differential Revision:
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
It fixes https://bugs.llvm.org/show_bug.cgi?id=51700

Differential Revision:
</pre>
</div>
</content>
</entry>
<entry>
<title>[LoopBoundSplit] Ignore phi node which is not scevable</title>
<updated>2021-06-09T08:44:36+00:00</updated>
<author>
<name>Jingu Kang</name>
<email>jingu.kang@arm.com</email>
</author>
<published>2021-06-08T17:24:38+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=8eee02020b92d986b6d089dbe5f1e312ecb4575c'/>
<id>8eee02020b92d986b6d089dbe5f1e312ecb4575c</id>
<content type='text'>
There was a bug in LoopBoundSplit. The pass should ignore phi node which is not
scevable.

Differential Revision: https://reviews.llvm.org/D103913
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
There was a bug in LoopBoundSplit. The pass should ignore phi node which is not
scevable.

Differential Revision: https://reviews.llvm.org/D103913
</pre>
</div>
</content>
</entry>
<entry>
<title>[SimpleLoopBoundSplit] Split Bound of Loop which has conditional branch with IV</title>
<updated>2021-06-07T09:55:25+00:00</updated>
<author>
<name>Jingu Kang</name>
<email>jingu.kang@arm.com</email>
</author>
<published>2021-05-06T14:53:00+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=a2a0ac42abcb57bd982a94534c219ac983572ac3'/>
<id>a2a0ac42abcb57bd982a94534c219ac983572ac3</id>
<content type='text'>
This pass transforms loops that contain a conditional branch with induction
variable. For example, it transforms left code to right code:

                             newbound = min(n, c)
 while (iv &lt; n) {            while(iv &lt; newbound) {
   A                           A
   if (iv &lt; c)                 B
     B                         C
   C                         }
 }                           if (iv != n) {
                               while (iv &lt; n) {
                                 A
                                 C
                               }
                             }

Differential Revision: https://reviews.llvm.org/D102234
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This pass transforms loops that contain a conditional branch with induction
variable. For example, it transforms left code to right code:

                             newbound = min(n, c)
 while (iv &lt; n) {            while(iv &lt; newbound) {
   A                           A
   if (iv &lt; c)                 B
     B                         C
   C                         }
 }                           if (iv != n) {
                               while (iv &lt; n) {
                                 A
                                 C
                               }
                             }

Differential Revision: https://reviews.llvm.org/D102234
</pre>
</div>
</content>
</entry>
</feed>
