<feed xmlns='http://www.w3.org/2005/Atom'>
<title>llvm-project.git/llvm/test/Transforms/PhaseOrdering, 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>Pre-commit PhaseOrdering/always-inline-alloca-promotion.ll</title>
<updated>2025-07-03T02:51:01+00:00</updated>
<author>
<name>Amara Emerson</name>
<email>amara@apple.com</email>
</author>
<published>2025-07-03T02:48:54+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=c9babbc2065dabd892150085f24cbe660990c8c1'/>
<id>c9babbc2065dabd892150085f24cbe660990c8c1</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>[InstCombine] Rewrite multi-use GEPs when simplifying comparison (#146100)</title>
<updated>2025-07-01T12:26:47+00:00</updated>
<author>
<name>Nikita Popov</name>
<email>npopov@redhat.com</email>
</author>
<published>2025-07-01T12:26:47+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=b8b74945514358f1ebeac0874172f37fc7bfa38e'/>
<id>b8b74945514358f1ebeac0874172f37fc7bfa38e</id>
<content type='text'>
We already do this when both sides are a GEP, but not if only one is.
This ensures that the offset arithmetic is not duplicated.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
We already do this when both sides are a GEP, but not if only one is.
This ensures that the offset arithmetic is not duplicated.</pre>
</div>
</content>
</entry>
<entry>
<title>[PhaseOrdering] Add test for memset DSE (NFC)</title>
<updated>2025-06-27T15:04:04+00:00</updated>
<author>
<name>Nikita Popov</name>
<email>npopov@redhat.com</email>
</author>
<published>2025-06-27T15:03:12+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=ec150a9944b2ce447c94944043fe1b87234e971f'/>
<id>ec150a9944b2ce447c94944043fe1b87234e971f</id>
<content type='text'>
This checks for the interaction with #145474.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This checks for the interaction with #145474.
</pre>
</div>
</content>
</entry>
<entry>
<title>[CostModel] getInstructionCost - match SK_InsertSubvector shuffle patterns before SK_Select (#145920)</title>
<updated>2025-06-26T19:15:51+00:00</updated>
<author>
<name>Simon Pilgrim</name>
<email>llvm-dev@redking.me.uk</email>
</author>
<published>2025-06-26T19:15:51+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=e25db2f6b30d805ef9095a3c72ab0618f4f3bef9'/>
<id>e25db2f6b30d805ef9095a3c72ab0618f4f3bef9</id>
<content type='text'>
More closely match improveShuffleKindFromMask's shuffle ordering by
trying to match a SK_InsertSubvector shuffles patterns before SK_Select
- both can match many of the same patterns, but its much easier to
recognise when a SK_InsertSubvector can be converted to SK_Select than
vice-versa.

Another step towards #145335 - which I'm hoping will allow us to
generalise improveShuffleKindFromMask and remove getInstructionCost's
shuffle matching entirely.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
More closely match improveShuffleKindFromMask's shuffle ordering by
trying to match a SK_InsertSubvector shuffles patterns before SK_Select
- both can match many of the same patterns, but its much easier to
recognise when a SK_InsertSubvector can be converted to SK_Select than
vice-versa.

Another step towards #145335 - which I'm hoping will allow us to
generalise improveShuffleKindFromMask and remove getInstructionCost's
shuffle matching entirely.</pre>
</div>
</content>
</entry>
<entry>
<title>[CostModel][X86] SK_InsertSubvector inserted into the lowest subvector should be treated as SK_Select blend (#145892)</title>
<updated>2025-06-26T15:00:51+00:00</updated>
<author>
<name>Simon Pilgrim</name>
<email>llvm-dev@redking.me.uk</email>
</author>
<published>2025-06-26T15:00:51+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=1a60c74c131ab1cde2206b3aa13b6aba9174776d'/>
<id>1a60c74c131ab1cde2206b3aa13b6aba9174776d</id>
<content type='text'>
X86 uses implicit widening and BLEND/MOV shuffles in these cases - otherwise we still treat it as a SK_PermuteTwoSrc</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
X86 uses implicit widening and BLEND/MOV shuffles in these cases - otherwise we still treat it as a SK_PermuteTwoSrc</pre>
</div>
</content>
</entry>
<entry>
<title>[VectorCombine] Fold bitwise operations of bitcasts into bitcast of bitwise operation (#137322)</title>
<updated>2025-06-26T13:57:22+00:00</updated>
<author>
<name>Narayan</name>
<email>nsreekumar6@gmail.com</email>
</author>
<published>2025-06-26T13:57:22+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=d05634d5cdc55f0a637259b10941a8591aa665e3'/>
<id>d05634d5cdc55f0a637259b10941a8591aa665e3</id>
<content type='text'>
Currently, LLVM fails to convert certain pblendvb intrinsics into select
instructions when the blend mask is derived from complex boolean logic
operations. This occurs even when the mask is ultimately based on
sign-extended comparison results, preventing further optimization
opportunities.

Fixes #66513

---------

Co-authored-by: Simon Pilgrim &lt;llvm-dev@redking.me.uk&gt;</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Currently, LLVM fails to convert certain pblendvb intrinsics into select
instructions when the blend mask is derived from complex boolean logic
operations. This occurs even when the mask is ultimately based on
sign-extended comparison results, preventing further optimization
opportunities.

Fixes #66513

---------

Co-authored-by: Simon Pilgrim &lt;llvm-dev@redking.me.uk&gt;</pre>
</div>
</content>
</entry>
<entry>
<title>[VectorCombine][X86] fmaddsub.ll - add test variants without any undef elements</title>
<updated>2025-06-23T11:18:32+00:00</updated>
<author>
<name>Simon Pilgrim</name>
<email>llvm-dev@redking.me.uk</email>
</author>
<published>2025-06-23T11:18:32+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=1d907c28b64b870e5075b7ded5fbd660f1e3ed58'/>
<id>1d907c28b64b870e5075b7ded5fbd660f1e3ed58</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>[LLVM][IRBuilder] Use NUW arithmetic for Create{ElementCount,TypeSize}. (#143532)</title>
<updated>2025-06-19T12:24:39+00:00</updated>
<author>
<name>Paul Walker</name>
<email>paul.walker@arm.com</email>
</author>
<published>2025-06-19T12:24:39+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=e478a22d540d336632fb3c110c5377447cd7f3b2'/>
<id>e478a22d540d336632fb3c110c5377447cd7f3b2</id>
<content type='text'>
This put the onus on the caller to ensure the result type is big enough.
In the unlikely event a cropped result is required then explicitly
truncate a safe value.</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This put the onus on the caller to ensure the result type is big enough.
In the unlikely event a cropped result is required then explicitly
truncate a safe value.</pre>
</div>
</content>
</entry>
<entry>
<title>[PhaseOrdering][X86] Copy FMUL+ADDSUB/FMADDSUB build vector patterns from codegen tests</title>
<updated>2025-06-18T07:17:08+00:00</updated>
<author>
<name>Simon Pilgrim</name>
<email>llvm-dev@redking.me.uk</email>
</author>
<published>2025-06-17T17:38:40+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=44b715293fcad79ef4a54474627ac574a759fa5a'/>
<id>44b715293fcad79ef4a54474627ac574a759fa5a</id>
<content type='text'>
As detailed on #144489 - confirm the vectorisation of scalar FMUL+ADDSUB/FMADDSUB on various targets
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
As detailed on #144489 - confirm the vectorisation of scalar FMUL+ADDSUB/FMADDSUB on various targets
</pre>
</div>
</content>
</entry>
<entry>
<title>[SLP]Fix a crash on an subvector size calculation for non-power-of-2 vector</title>
<updated>2025-06-17T15:58:07+00:00</updated>
<author>
<name>Alexey Bataev</name>
<email>a.bataev@outlook.com</email>
</author>
<published>2025-06-17T14:55:52+00:00</published>
<link rel='alternate' type='text/html' href='https://git.belthelziquor.com/llvm-project.git/commit/?id=0108a5908cab5e418c683ef9b6e1810755344b5e'/>
<id>0108a5908cab5e418c683ef9b6e1810755344b5e</id>
<content type='text'>
Patch fixes cost estimation for the extractelements from non-power-of-2
vectors, defined as subvector extracts. In this case the subvector size
might be not adjusted to a whole register size, need to get the minimum
between whole vector size and the actual difference to prevent compiler
crash.

Fixes #143513
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Patch fixes cost estimation for the extractelements from non-power-of-2
vectors, defined as subvector extracts. In this case the subvector size
might be not adjusted to a whole register size, need to get the minimum
between whole vector size and the actual difference to prevent compiler
crash.

Fixes #143513
</pre>
</div>
</content>
</entry>
</feed>
