KJ16609/gcc-reflection
1
0
Fork 0
mirror of https://forge.sourceware.org/marek/gcc.git synced 2026-02-22 03:47:02 -05:00
Code Issues Packages Projects Releases Wiki Activity

middle-end/123573 - fix VEC_PERM folding more

Browse Source 
The following fixes the fix from r16-6709-ga4716ece529dfd some
more by making sure permute to one operand folding faces same
element number vectors but also insert a VIEW_CONVERT_EXPR for
the case one is VLA and one is VLS (when the VLA case is actually
constant, like with -msve-vector-bits=128).  It also makes the
assert that output and input element numbers match done in
fold_vec_perm which this pattern eventually dispatches to into
a check (as the comment already indicates).

Testcases are in the target specific aarch64 testsuite already.

	PR middle-end/123573
	* fold-const.cc (fold_vec_perm): Actually check, not assert,
	that input and output vector element numbers agree.
	* match.pd (vec_perm @0 @1 @2): Make sure element numbers
	are the same when folding to an input vector and wrap that
	inside a VIEW_CONVERT_EXPR.
This commit is contained in:
Richard Biener
2026-01-13 12:59:41 +01:00
committed by Richard Biener
parent 939dd2324e
commit e787d5ace5
2 changed files with 5 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/fold-const.cc
View File

@@ -10704,11 +10704,10 @@ fold_vec_perm (tree type, tree arg0, tree arg1, const vec_perm_indices &sel)
/* For fall back case, we want to ensure we have VLS vectors
with equal length. */
if (!sel.length ().is_constant (&nelts))
if (!sel.length ().is_constant (&nelts)
|| !known_eq (sel.length (), TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0))))
return NULL_TREE;
gcc_assert (known_eq (sel.length (),
TYPE_VECTOR_SUBPARTS (TREE_TYPE (arg0))));
tree *in_elts = XALLOCAVEC (tree, nelts * 2);
if (!vec_cst_ctor_to_array (arg0, nelts, in_elts)
|| !vec_cst_ctor_to_array (arg1, nelts, in_elts + nelts))

6
gcc/match.pd
View File

@@ -11528,9 +11528,9 @@ and,
vec_perm_indices sel (builder, single_arg ? 1 : 2, nelts_in);
}
(if (known_eq (nelts, nelts_in) && sel.series_p (0, 1, 0, 1))
{ op0; }
(if (sel.series_p (0, 1, nelts_in, 1))
{ op1; }
(view_convert @0)
(if (known_eq (nelts, nelts_in) && sel.series_p (0, 1, nelts_in, 1))
(view_convert @1)
(with
{
if (!single_arg)