From: Jeff Law Date: Wed, 26 Jun 2019 21:36:27 +0000 (-0600) Subject: re PR tree-optimization/90883 (Generated code is worse if returned struct is unnamed) X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=3fe0ddc88334f9afd622458653a6d103948994bd;p=gcc.git re PR tree-optimization/90883 (Generated code is worse if returned struct is unnamed) PR tree-optimization/90883 * tree-ssa-alias.c (stmt_kills_ref_p): Handle BUILT_IN_CALLOC. * tree-ssa-dse.c: Update various comments to distinguish between dead and redundant stores. (initialize_ao_ref_for_dse): Handle BUILT_IN_CALLOC. (dse_optimize_redundant_stores): New function. (delete_dead_or_redundant_call): Renamed from delete_dead_call. Distinguish between dead and redundant calls in dump output. All callers updated. (delete_dead_or_redundant_assignment): Similarly for assignments. (dse_optimize_stmt): Handle _CHK variants. For statements which store 0 into multiple memory locations, try to prove a subsequent store is redundant. PR tree-optimization/90883 * g++.dg/tree-ssa/pr90883.C: New test. * gcc.dg/tree-ssa/ssa-dse-36.c: New test. From-SVN: r272717 --- diff --git a/gcc/ChangeLog b/gcc/ChangeLog index a27a189670b..eacda19dff1 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,19 @@ +2019-06-26 Jeff Law + + PR tree-optimization/90883 + * tree-ssa-alias.c (stmt_kills_ref_p): Handle BUILT_IN_CALLOC. + * tree-ssa-dse.c: Update various comments to distinguish between + dead and redundant stores. + (initialize_ao_ref_for_dse): Handle BUILT_IN_CALLOC. + (dse_optimize_redundant_stores): New function. + (delete_dead_or_redundant_call): Renamed from delete_dead_call. + Distinguish between dead and redundant calls in dump output. All + callers updated. + (delete_dead_or_redundant_assignment): Similarly for assignments. + (dse_optimize_stmt): Handle _CHK variants. For statements which + store 0 into multiple memory locations, try to prove a subsequent + store is redundant. + 2019-06-26 Uroš Bizjak PR target/89021 diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index e9fade55b67..eb5340122a4 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,9 @@ +2019-06-26 Jeff Law + + PR tree-optimization/90883 + * g++.dg/tree-ssa/pr90883.C: New test. + * gcc.dg/tree-ssa/ssa-dse-36.c: New test. + 2019-06-26 Uroš Bizjak PR target/89021 diff --git a/gcc/testsuite/g++.dg/tree-ssa/pr90883.C b/gcc/testsuite/g++.dg/tree-ssa/pr90883.C new file mode 100644 index 00000000000..005b2103b4b --- /dev/null +++ b/gcc/testsuite/g++.dg/tree-ssa/pr90883.C @@ -0,0 +1,19 @@ +// { dg-options "-O2 -fdump-tree-dse1-details -std=c++11" } + + + class C + { + char a[7]{}; + int b{}; + }; + + C slow() + { + return {}; + } + + +// We want to match enough here to capture that we deleted an empty +// constructor store +// { dg-final { scan-tree-dump "Deleted redundant store: .*\.a = {}" "dse1" } } + diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ssa-dse-36.c b/gcc/testsuite/gcc.dg/tree-ssa/ssa-dse-36.c new file mode 100644 index 00000000000..23a53bb4ad2 --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/ssa-dse-36.c @@ -0,0 +1,65 @@ +/* { dg-options "-O2 -fdump-tree-dse-details -fno-tree-fre" } */ +#include +#include + +struct X +{ + char mem0[10]; + char mem1[10]; +}; + + +void blah (struct X); + + +void +foo1() +{ + struct X x = { }; + memset (x.mem1, 0, sizeof x.mem1); + blah (x); +} + +void +foo2() +{ + struct X x = { }; + x.mem1[5] = 0; + blah (x); +} + +void +bar1 () +{ + struct X x; + memset (&x, 0, sizeof x); + memset (&x.mem1, 0, sizeof x.mem1); + blah (x); +} +void +bar2 () +{ + struct X x; + memset (&x, 0, sizeof x); + x.mem1[5] = 0; + blah (x); +} + +void +baz1 () +{ + struct X *x = calloc (sizeof (struct X), 1); + memset (&x->mem1, 0, sizeof x->mem1); + blah (*x); +} + +void +baz2 () +{ + struct X *x = calloc (sizeof (struct X), 1); + x->mem1[5] = 0; + blah (*x); +} +/* { dg-final { scan-tree-dump-times "Deleted redundant call" 3 "dse1" } } */ +/* { dg-final { scan-tree-dump-times "Deleted redundant store" 3 "dse1" } } */ + diff --git a/gcc/tree-ssa-alias.c b/gcc/tree-ssa-alias.c index 48f7364db2a..6e7db2b03a6 100644 --- a/gcc/tree-ssa-alias.c +++ b/gcc/tree-ssa-alias.c @@ -2849,13 +2849,36 @@ stmt_kills_ref_p (gimple *stmt, ao_ref *ref) case BUILT_IN_MEMSET_CHK: case BUILT_IN_STRNCPY: case BUILT_IN_STPNCPY: + case BUILT_IN_CALLOC: { /* For a must-alias check we need to be able to constrain the access properly. */ if (!ref->max_size_known_p ()) return false; - tree dest = gimple_call_arg (stmt, 0); - tree len = gimple_call_arg (stmt, 2); + tree dest; + tree len; + + /* In execution order a calloc call will never kill + anything. However, DSE will (ab)use this interface + to ask if a calloc call writes the same memory locations + as a later assignment, memset, etc. So handle calloc + in the expected way. */ + if (DECL_FUNCTION_CODE (callee) == BUILT_IN_CALLOC) + { + tree arg0 = gimple_call_arg (stmt, 0); + tree arg1 = gimple_call_arg (stmt, 1); + if (TREE_CODE (arg0) != INTEGER_CST + || TREE_CODE (arg1) != INTEGER_CST) + return false; + + dest = gimple_call_lhs (stmt); + len = fold_build2 (MULT_EXPR, TREE_TYPE (arg0), arg0, arg1); + } + else + { + dest = gimple_call_arg (stmt, 0); + len = gimple_call_arg (stmt, 2); + } if (!poly_int_tree_p (len)) return false; tree rbase = ref->base; diff --git a/gcc/tree-ssa-dse.c b/gcc/tree-ssa-dse.c index ea71f49ef8c..9b4d19232ee 100644 --- a/gcc/tree-ssa-dse.c +++ b/gcc/tree-ssa-dse.c @@ -1,4 +1,4 @@ -/* Dead store elimination +/* Dead and redundant store elimination Copyright (C) 2004-2019 Free Software Foundation, Inc. This file is part of GCC. @@ -41,12 +41,20 @@ along with GCC; see the file COPYING3. If not see A dead store is a store into a memory location which will later be overwritten by another store without any intervening loads. In this - case the earlier store can be deleted. + case the earlier store can be deleted or trimmed if the store + was partially dead. + + A redundant store is a store into a memory location which stores + the exact same value as a prior store to the same memory location. + While this can often be handled by dead store elimination, removing + the redundant store is often better than removing or trimming the + dead store. In our SSA + virtual operand world we use immediate uses of virtual - operands to detect dead stores. If a store's virtual definition + operands to detect these cases. If a store's virtual definition is used precisely once by a later store to the same location which - post dominates the first store, then the first store is dead. + post dominates the first store, then the first store is dead. If + the data stored is the same, then the second store is redundant. The single use of the store's virtual definition ensures that there are no intervening aliased loads and the requirement that @@ -58,7 +66,9 @@ along with GCC; see the file COPYING3. If not see the point immediately before the later store. Again, the single use of the virtual definition and the post-dominance relationship ensure that such movement would be safe. Clearly if there are - back to back stores, then the second is redundant. + back to back stores, then the second is makes the first dead. If + the second store stores the same value, then the second store is + redundant. Reviewing section 10.7.2 in Morgan's "Building an Optimizing Compiler" may also help in understanding this code since it discusses the @@ -66,6 +76,8 @@ along with GCC; see the file COPYING3. If not see fact, they are the same transformation applied to different views of the CFG. */ +static void delete_dead_or_redundant_assignment (gimple_stmt_iterator *, char []); +static void delete_dead_or_redundant_call (gimple_stmt_iterator *, char []); /* Bitmap of blocks that have had EH statements cleaned. We should remove their dead edges eventually. */ @@ -109,6 +121,25 @@ initialize_ao_ref_for_dse (gimple *stmt, ao_ref *write) ao_ref_init_from_ptr_and_size (write, ptr, size); return true; } + + /* A calloc call can never be dead, but it can make + subsequent stores redundant if they store 0 into + the same memory locations. */ + case BUILT_IN_CALLOC: + { + tree nelem = gimple_call_arg (stmt, 0); + tree selem = gimple_call_arg (stmt, 1); + if (TREE_CODE (nelem) == INTEGER_CST + && TREE_CODE (selem) == INTEGER_CST) + { + tree lhs = gimple_call_lhs (stmt); + tree size = fold_build2 (MULT_EXPR, TREE_TYPE (nelem), + nelem, selem); + ao_ref_init_from_ptr_and_size (write, lhs, size); + return true; + } + } + default: break; } @@ -557,6 +588,74 @@ check_name (tree, tree *idx, void *data) return true; } +/* STMT stores the value 0 into one or more memory locations + (via memset, empty constructor, calloc call, etc). + + See if there is a subsequent store of the value 0 to one + or more of the same memory location(s). If so, the subsequent + store is redundant and can be removed. + + The subsequent stores could be via memset, empty constructors, + simple MEM stores, etc. */ + +static void +dse_optimize_redundant_stores (gimple *stmt) +{ + int cnt = 0; + + /* We could do something fairly complex and look through PHIs + like DSE_CLASSIFY_STORE, but it doesn't seem to be worth + the effort. + + Look at all the immediate uses of the VDEF (which are obviously + dominated by STMT). See if one or more stores 0 into the same + memory locations a STMT, if so remove the immediate use statements. */ + tree defvar = gimple_vdef (stmt); + imm_use_iterator ui; + gimple *use_stmt; + FOR_EACH_IMM_USE_STMT (use_stmt, ui, defvar) + { + /* Limit stmt walking. */ + if (++cnt > PARAM_VALUE (PARAM_DSE_MAX_ALIAS_QUERIES_PER_STORE)) + BREAK_FROM_IMM_USE_STMT (ui); + + /* If USE_STMT stores 0 into one or more of the same locations + as STMT and STMT would kill USE_STMT, then we can just remove + USE_STMT. */ + tree fndecl; + if ((is_gimple_assign (use_stmt) + && gimple_vdef (use_stmt) + && ((gimple_assign_rhs_code (use_stmt) == CONSTRUCTOR + && CONSTRUCTOR_NELTS (gimple_assign_rhs1 (use_stmt)) == 0 + && !gimple_clobber_p (stmt)) + || (gimple_assign_rhs_code (use_stmt) == INTEGER_CST + && integer_zerop (gimple_assign_rhs1 (use_stmt))))) + || (gimple_call_builtin_p (use_stmt, BUILT_IN_NORMAL) + && (fndecl = gimple_call_fndecl (use_stmt)) != NULL + && (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_MEMSET + || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_MEMSET_CHK) + && integer_zerop (gimple_call_arg (use_stmt, 1)))) + { + ao_ref write; + + if (!initialize_ao_ref_for_dse (use_stmt, &write)) + BREAK_FROM_IMM_USE_STMT (ui) + + if (valid_ao_ref_for_dse (&write) + && stmt_kills_ref_p (stmt, &write)) + { + gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt); + if (is_gimple_assign (use_stmt)) + delete_dead_or_redundant_assignment (&gsi, "redundant"); + else if (is_gimple_call (use_stmt)) + delete_dead_or_redundant_call (&gsi, "redundant"); + else + gcc_unreachable (); + } + } + } +} + /* A helper of dse_optimize_stmt. Given a GIMPLE_ASSIGN in STMT that writes to REF, classify it according to downstream uses and defs. Sets *BY_CLOBBER_P to true @@ -769,12 +868,12 @@ private: /* Delete a dead call at GSI, which is mem* call of some kind. */ static void -delete_dead_call (gimple_stmt_iterator *gsi) +delete_dead_or_redundant_call (gimple_stmt_iterator *gsi, char *type) { gimple *stmt = gsi_stmt (*gsi); if (dump_file && (dump_flags & TDF_DETAILS)) { - fprintf (dump_file, " Deleted dead call: "); + fprintf (dump_file, " Deleted %s call: ", type); print_gimple_stmt (dump_file, stmt, 0, dump_flags); fprintf (dump_file, "\n"); } @@ -803,12 +902,12 @@ delete_dead_call (gimple_stmt_iterator *gsi) /* Delete a dead store at GSI, which is a gimple assignment. */ static void -delete_dead_assignment (gimple_stmt_iterator *gsi) +delete_dead_or_redundant_assignment (gimple_stmt_iterator *gsi, char *type) { gimple *stmt = gsi_stmt (*gsi); if (dump_file && (dump_flags & TDF_DETAILS)) { - fprintf (dump_file, " Deleted dead store: "); + fprintf (dump_file, " Deleted %s store: ", type); print_gimple_stmt (dump_file, stmt, 0, dump_flags); fprintf (dump_file, "\n"); } @@ -861,7 +960,8 @@ dse_dom_walker::dse_optimize_stmt (gimple_stmt_iterator *gsi) some builtin calls. */ if (gimple_call_builtin_p (stmt, BUILT_IN_NORMAL)) { - switch (DECL_FUNCTION_CODE (gimple_call_fndecl (stmt))) + tree fndecl = gimple_call_fndecl (stmt); + switch (DECL_FUNCTION_CODE (fndecl)) { case BUILT_IN_MEMCPY: case BUILT_IN_MEMMOVE: @@ -876,10 +976,18 @@ dse_dom_walker::dse_optimize_stmt (gimple_stmt_iterator *gsi) tree size = gimple_call_arg (stmt, 2); if (integer_zerop (size)) { - delete_dead_call (gsi); + delete_dead_or_redundant_call (gsi, "dead"); return; } + /* If this is a memset call that initializes an object + to zero, it may be redundant with an earlier memset + or empty CONSTRUCTOR of a larger object. */ + if ((DECL_FUNCTION_CODE (fndecl) == BUILT_IN_MEMSET + || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_MEMSET_CHK) + && integer_zerop (gimple_call_arg (stmt, 1))) + dse_optimize_redundant_stores (stmt); + enum dse_store_status store_status; m_byte_tracking_enabled = setup_live_bytes_from_ref (&ref, m_live_bytes); @@ -896,10 +1004,14 @@ dse_dom_walker::dse_optimize_stmt (gimple_stmt_iterator *gsi) } if (store_status == DSE_STORE_DEAD) - delete_dead_call (gsi); + delete_dead_or_redundant_call (gsi, "dead"); return; } + case BUILT_IN_CALLOC: + /* We already know the arguments are integer constants. */ + dse_optimize_redundant_stores (stmt); + default: return; } @@ -909,6 +1021,18 @@ dse_dom_walker::dse_optimize_stmt (gimple_stmt_iterator *gsi) { bool by_clobber_p = false; + /* First see if this store is a CONSTRUCTOR and if there + are subsequent CONSTRUCTOR stores which are totally + subsumed by this statement. If so remove the subsequent + CONSTRUCTOR store. + + This will tend to make fewer calls into memset with longer + arguments. */ + if (gimple_assign_rhs_code (stmt) == CONSTRUCTOR + && CONSTRUCTOR_NELTS (gimple_assign_rhs1 (stmt)) == 0 + && !gimple_clobber_p (stmt)) + dse_optimize_redundant_stores (stmt); + /* Self-assignments are zombies. */ if (operand_equal_p (gimple_assign_rhs1 (stmt), gimple_assign_lhs (stmt), 0)) @@ -939,7 +1063,7 @@ dse_dom_walker::dse_optimize_stmt (gimple_stmt_iterator *gsi) && !by_clobber_p) return; - delete_dead_assignment (gsi); + delete_dead_or_redundant_assignment (gsi, "dead"); } }