MatCat.OpenSource/8sa1-gcc
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

slp: Add complex operations class to share first match among all matchers

Browse Source 
This introduces a common class complex_operations_pattern which encapsulates
the complex add, mul, fma and fms pattern in such a way so that the first match
is shared.

gcc/ChangeLog:

	* tree-vect-slp-patterns.c (class complex_operations_pattern,
	complex_operations_pattern::matches,
	complex_operations_pattern::recognize,
	complex_operations_pattern::build): New.
	(slp_patterns): Use it.
This commit is contained in:
Tamar Christina 2021-01-14 21:00:10 +00:00
parent 478e571a3e
commit b50df1e749
1 changed files with 78 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

79
gcc/tree-vect-slp-patterns.c
View File

@ -1445,6 +1445,83 @@ complex_fms_pattern::build (vec_info *vinfo)
complex_pattern::build (vinfo);
}
/*******************************************************************************
* complex_operations_pattern class
******************************************************************************/
/* This function combines all the existing pattern matchers above into one class
that shares the functionality between them. The initial match is shared
between all complex operations. */
class complex_operations_pattern : public complex_pattern
{
protected:
complex_operations_pattern (slp_tree *node, vec<slp_tree> *m_ops,
internal_fn ifn)
: complex_pattern (node, m_ops, ifn)
{
this->m_num_args = 0;
}
public:
void build (vec_info *);
static internal_fn
matches (complex_operation_t op, slp_tree_to_load_perm_map_t *, slp_tree *,
vec<slp_tree> *);
static vect_pattern*
recognize (slp_tree_to_load_perm_map_t *, slp_tree *);
};
/* Dummy matches implementation for proxy object. */
internal_fn
complex_operations_pattern::
matches (complex_operation_t /* op */,
slp_tree_to_load_perm_map_t * /* perm_cache */,
slp_tree * /* ref_node */, vec<slp_tree> * /* ops */)
{
return IFN_LAST;
}
/* Attempt to recognize a complex mul pattern. */
vect_pattern*
complex_operations_pattern::recognize (slp_tree_to_load_perm_map_t *perm_cache,
slp_tree *node)
{
auto_vec<slp_tree> ops;
complex_operation_t op
= vect_detect_pair_op (*node, true, &ops);
internal_fn ifn = IFN_LAST;
ifn = complex_fms_pattern::matches (op, perm_cache, node, &ops);
if (ifn != IFN_LAST)
return complex_fms_pattern::mkInstance (node, &ops, ifn);
ifn = complex_mul_pattern::matches (op, perm_cache, node, &ops);
if (ifn != IFN_LAST)
return complex_mul_pattern::mkInstance (node, &ops, ifn);
ifn = complex_fma_pattern::matches (op, perm_cache, node, &ops);
if (ifn != IFN_LAST)
return complex_fma_pattern::mkInstance (node, &ops, ifn);
ifn = complex_add_pattern::matches (op, perm_cache, node, &ops);
if (ifn != IFN_LAST)
return complex_add_pattern::mkInstance (node, &ops, ifn);
return NULL;
}
/* Dummy implementation of build. */
void
complex_operations_pattern::build (vec_info * /* vinfo */)
{
gcc_unreachable ();
}
/*******************************************************************************
* Pattern matching definitions
******************************************************************************/
@ -1456,7 +1533,7 @@ vect_pattern_decl_t slp_patterns[]
order patterns from the largest to the smallest. Especially if they
overlap in what they can detect. */
SLP_PATTERN (complex_add_pattern),
SLP_PATTERN (complex_operations_pattern),
};
#undef SLP_PATTERN