From: Richard Biener Date: Wed, 4 Dec 2019 12:23:58 +0000 (+0000) Subject: tree-ssa-sccvn.c (vn_walk_cb_data::push_partial_def): Handle non-constant defs in... X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=0849cdae714ddf056a4944f31eef53a465f1bcd0;p=gcc.git tree-ssa-sccvn.c (vn_walk_cb_data::push_partial_def): Handle non-constant defs in the most trivial way. 2019-12-04 Richard Biener * tree-ssa-sccvn.c (vn_walk_cb_data::push_partial_def): Handle non-constant defs in the most trivial way. (vn_reference_lookup_3): Also push down SSA partial defs. * gcc.dg/tree-ssa/ssa-fre-84.c: New testcase. From-SVN: r278963 --- diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 97e2c97a851..6b69111ebc0 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +2019-12-04 Richard Biener + + * tree-ssa-sccvn.c (vn_walk_cb_data::push_partial_def): Handle + non-constant defs in the most trivial way. + (vn_reference_lookup_3): Also push down SSA partial defs. + 2019-12-04 Martin Liska * tree-switch-conversion.c (switch_decision_tree::try_switch_expansion): diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index e012bddef8c..2e6597e8b50 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,7 @@ +2019-12-04 Richard Biener + + * gcc.dg/tree-ssa/ssa-fre-84.c: New testcase. + 2019-12-12 Tobias Burnus PR fortran/92754 diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ssa-fre-84.c b/gcc/testsuite/gcc.dg/tree-ssa/ssa-fre-84.c new file mode 100644 index 00000000000..6c3832bc294 --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/ssa-fre-84.c @@ -0,0 +1,19 @@ +/* { dg-do compile } */ +/* { dg-options "-O -fdump-tree-fre1" } */ + +typedef int v4si __attribute__((vector_size(16))); + +void foo (v4si *dst, int x) +{ + v4si v[2]; + v[0][0] = 1; + v[0][1] = x; + v[0][2] = 2; + v[0][3] = 3; + v[0][1] = 0; + *dst = v[0]; +} + +/* The shadowed non-constant assign to v[0][1] shouldn't prevent us from + value-numbering the load to a constant. */ +/* { dg-final { scan-tree-dump "\\*dst_\[0-9\]*\\\(D\\) = { 1, 0, 2, 3 };" "fre1" } } */ diff --git a/gcc/tree-ssa-sccvn.c b/gcc/tree-ssa-sccvn.c index 8fbdb5163d6..b90ce37286d 100644 --- a/gcc/tree-ssa-sccvn.c +++ b/gcc/tree-ssa-sccvn.c @@ -1759,11 +1759,15 @@ vn_walk_cb_data::push_partial_def (const pd_data &pd, tree vuse, if (maxsizei > bufsize * BITS_PER_UNIT) return (void *)-1; + bool pd_constant_p = (TREE_CODE (pd.rhs) == CONSTRUCTOR + || CONSTANT_CLASS_P (pd.rhs)); if (partial_defs.is_empty ()) { /* If we get a clobber upfront, fail. */ if (TREE_CLOBBER_P (pd.rhs)) return (void *)-1; + if (!pd_constant_p) + return (void *)-1; partial_defs.safe_push (pd); first_range.offset = pd.offset; first_range.size = pd.size; @@ -1824,6 +1828,9 @@ vn_walk_cb_data::push_partial_def (const pd_data &pd, tree vuse, /* If we get a clobber, fail. */ if (TREE_CLOBBER_P (pd.rhs)) return (void *)-1; + /* Non-constants are OK as long as they are shadowed by a constant. */ + if (!pd_constant_p) + return (void *)-1; partial_defs.safe_push (pd); /* Now we have merged newr into the range tree. When we have covered @@ -2653,21 +2660,17 @@ vn_reference_lookup_3 (ao_ref *ref, tree vuse, void *data_, } /* 4) Assignment from an SSA name which definition we may be able - to access pieces from. */ + to access pieces from or we can combine to a larger entity. */ else if (known_eq (ref->size, maxsize) && is_gimple_reg_type (vr->type) && !contains_storage_order_barrier_p (vr->operands) && gimple_assign_single_p (def_stmt) - && TREE_CODE (gimple_assign_rhs1 (def_stmt)) == SSA_NAME - /* A subset of partial defs from non-constants can be handled - by for example inserting a CONSTRUCTOR, a COMPLEX_EXPR or - even a (series of) BIT_INSERT_EXPR hoping for simplifications - downstream, not so much for actually doing the insertion. */ - && data->partial_defs.is_empty ()) + && TREE_CODE (gimple_assign_rhs1 (def_stmt)) == SSA_NAME) { tree lhs = gimple_assign_lhs (def_stmt); tree base2; poly_int64 offset2, size2, maxsize2; + HOST_WIDE_INT offset2i, size2i, offseti; bool reverse; if (lhs_ref_ok) { @@ -2685,34 +2688,54 @@ vn_reference_lookup_3 (ao_ref *ref, tree vuse, void *data_, && known_size_p (maxsize2) && known_eq (maxsize2, size2) && adjust_offsets_for_equal_base_address (base, &offset, - base2, &offset2) - && known_subrange_p (offset, maxsize, offset2, size2) - /* ??? We can't handle bitfield precision extracts without - either using an alternate type for the BIT_FIELD_REF and - then doing a conversion or possibly adjusting the offset - according to endianness. */ - && (! INTEGRAL_TYPE_P (vr->type) - || known_eq (ref->size, TYPE_PRECISION (vr->type))) - && multiple_p (ref->size, BITS_PER_UNIT)) + base2, &offset2)) { - if (known_eq (ref->size, size2)) - return vn_reference_lookup_or_insert_for_pieces - (vuse, get_alias_set (lhs), vr->type, vr->operands, - SSA_VAL (def_rhs)); - else if (! INTEGRAL_TYPE_P (TREE_TYPE (def_rhs)) - || type_has_mode_precision_p (TREE_TYPE (def_rhs))) + if (data->partial_defs.is_empty () + && known_subrange_p (offset, maxsize, offset2, size2) + /* ??? We can't handle bitfield precision extracts without + either using an alternate type for the BIT_FIELD_REF and + then doing a conversion or possibly adjusting the offset + according to endianness. */ + && (! INTEGRAL_TYPE_P (vr->type) + || known_eq (ref->size, TYPE_PRECISION (vr->type))) + && multiple_p (ref->size, BITS_PER_UNIT)) { - gimple_match_op op (gimple_match_cond::UNCOND, - BIT_FIELD_REF, vr->type, - vn_valueize (def_rhs), - bitsize_int (ref->size), - bitsize_int (offset - offset2)); - tree val = vn_nary_build_or_lookup (&op); - if (val - && (TREE_CODE (val) != SSA_NAME - || ! SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val))) + if (known_eq (ref->size, size2)) return vn_reference_lookup_or_insert_for_pieces - (vuse, get_alias_set (lhs), vr->type, vr->operands, val); + (vuse, get_alias_set (lhs), vr->type, vr->operands, + SSA_VAL (def_rhs)); + else if (! INTEGRAL_TYPE_P (TREE_TYPE (def_rhs)) + || type_has_mode_precision_p (TREE_TYPE (def_rhs))) + { + gimple_match_op op (gimple_match_cond::UNCOND, + BIT_FIELD_REF, vr->type, + SSA_VAL (def_rhs), + bitsize_int (ref->size), + bitsize_int (offset - offset2)); + tree val = vn_nary_build_or_lookup (&op); + if (val + && (TREE_CODE (val) != SSA_NAME + || ! SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val))) + return vn_reference_lookup_or_insert_for_pieces + (vuse, get_alias_set (lhs), vr->type, + vr->operands, val); + } + } + else if (maxsize.is_constant (&maxsizei) + && maxsizei % BITS_PER_UNIT == 0 + && offset.is_constant (&offseti) + && offseti % BITS_PER_UNIT == 0 + && offset2.is_constant (&offset2i) + && offset2i % BITS_PER_UNIT == 0 + && size2.is_constant (&size2i) + && size2i % BITS_PER_UNIT == 0 + && ranges_known_overlap_p (offset, maxsize, offset2, size2)) + { + pd_data pd; + pd.rhs = SSA_VAL (def_rhs); + pd.offset = (offset2i - offseti) / BITS_PER_UNIT; + pd.size = size2i / BITS_PER_UNIT; + return data->push_partial_def (pd, vuse, maxsizei); } } }