mirror of git://gcc.gnu.org/git/gcc.git
![]() cselim (and the phiopt's cselim-limited) can commonalize a single store which makes this too limited in some/many cases. Instead let's commonalize all trailing stores as much as possible (only in the same order). The change is smallish, basically the restriction on being the only store is removed from single_trailing_store_in_bb (renamed too). And also looping to remove all of the trailing stores instead of just doing one for the pass. Note sink will do the same optimization so doing it earlier seems like a good idea because it improve change inlining size estimates. For an example with this change, early inlining can happen for min_cmp<long int> in g++.dg/opt/pr122083-1.C now; that avoids a -Wnonnull warning as the memcmp with the null argument is optimized early. It can also catch some min in phiopt1 in some cases. Bootstrapped and tested on x86_64-linux-gnu. Changes since v1: * v2: For !flag_expensive_optimizations, handle the only store rather than just the last store. PR tree-optimization/122083 gcc/ChangeLog: * tree-ssa-phiopt.cc (single_trailing_store_in_bb): Rename to ... (trailing_store_in_bb): This and take new argument to check for only store. (cond_if_else_store_replacement_limited): Update to use trailing_store_in_bb. (cond_if_else_store_replacement): Loop until cond_if_else_store_replacement_limited returns false. (pass_phiopt::execute): Instead of calling cond_if_else_store_replacement_limited once, also loop on it. gcc/testsuite/ChangeLog: * gcc.dg/tree-ssa/ssa-pre-19.c: Disable phiopt and cselim. * g++.dg/opt/pr122083-1.C: New test. * gcc.dg/tree-ssa/cselim-1.c: New test. * gcc.dg/tree-ssa/cselim-2.c: New test. Signed-off-by: Andrew Pinski <andrew.pinski@oss.qualcomm.com> |
||
---|---|---|
.forgejo | ||
.github | ||
INSTALL | ||
c++tools | ||
config | ||
contrib | ||
fixincludes | ||
gcc | ||
gnattools | ||
gotools | ||
include | ||
libada | ||
libatomic | ||
libbacktrace | ||
libcc1 | ||
libcody | ||
libcpp | ||
libdecnumber | ||
libffi | ||
libgcc | ||
libgcobol | ||
libgfortran | ||
libgm2 | ||
libgo | ||
libgomp | ||
libgrust | ||
libiberty | ||
libitm | ||
libobjc | ||
libphobos | ||
libquadmath | ||
libsanitizer | ||
libssp | ||
libstdc++-v3 | ||
libvtv | ||
lto-plugin | ||
maintainer-scripts | ||
zlib | ||
.b4-config | ||
.dir-locals.el | ||
.editorconfig | ||
.gitattributes | ||
.gitignore | ||
ABOUT-NLS | ||
COPYING | ||
COPYING.LIB | ||
COPYING.RUNTIME | ||
COPYING3 | ||
COPYING3.LIB | ||
ChangeLog | ||
ChangeLog.jit | ||
ChangeLog.tree-ssa | ||
MAINTAINERS | ||
Makefile.def | ||
Makefile.in | ||
Makefile.tpl | ||
README | ||
SECURITY.txt | ||
ar-lib | ||
compile | ||
config-ml.in | ||
config.guess | ||
config.rpath | ||
config.sub | ||
configure | ||
configure.ac | ||
depcomp | ||
install-sh | ||
libtool-ldflags | ||
libtool.m4 | ||
ltgcc.m4 | ||
ltmain.sh | ||
ltoptions.m4 | ||
ltsugar.m4 | ||
ltversion.m4 | ||
lt~obsolete.m4 | ||
missing | ||
mkdep | ||
mkinstalldirs | ||
move-if-change | ||
multilib.am | ||
symlink-tree | ||
test-driver | ||
ylwrap |
README
This directory contains the GNU Compiler Collection (GCC). The GNU Compiler Collection is free software. See the files whose names start with COPYING for copying permission. The manuals, and some of the runtime libraries, are under different terms; see the individual source files for details. The directory INSTALL contains copies of the installation information as HTML and plain text. The source of this information is gcc/doc/install.texi. The installation information includes details of what is included in the GCC sources and what files GCC installs. See the file gcc/doc/gcc.texi (together with other files that it includes) for usage and porting information. An online readable version of the manual is in the files gcc/doc/gcc.info*. See http://gcc.gnu.org/bugs/ for how to report bugs usefully. Copyright years on GCC source files may be listed using range notation, e.g., 1987-2012, indicating that every year in the range, inclusive, is a copyrightable year that could otherwise be listed individually.