diff options
author | Hans-Peter Nilsson <hp@axis.com> | 2023-05-22 04:12:15 +0200 |
---|---|---|
committer | Hans-Peter Nilsson <hp@bitrange.com> | 2023-06-04 03:13:03 +0200 |
commit | 3991b2f623d22dea19c2558852a96e313a521a44 (patch) | |
tree | b0c8f2c3410512aaac9ddae37bdfdb624a247b71 /gcc/cp/cp-tree.h | |
parent | 8bdfa8a67a54545be1d90c46fb88a676695f25dc (diff) | |
download | gcc-3991b2f623d22dea19c2558852a96e313a521a44.zip gcc-3991b2f623d22dea19c2558852a96e313a521a44.tar.gz gcc-3991b2f623d22dea19c2558852a96e313a521a44.tar.bz2 |
reload_cse_move2add: Handle trivial single_set:s
The reload_cse_move2add part of "postreload" handled only
insns whose PATTERN was a SET. That excludes insns that
e.g. clobber a flags register, which it does only for
"simplicity". The patch extends the "simplicity" to most
single_set insns. For a subset of those insns there's still
an assumption; that the single_set of a PARALLEL insn is the
first element in the PARALLEL. If the assumption fails,
it's no biggie; the optimization just isn't performed.
Don't let the name deceive you, this optimization doesn't
hit often, but as often (or as rarely) for LRA as for reload
at least on e.g. cris-elf where the biggest effect was seen
in reducing repeated addresses in copies from fixed-address
arrays, like in gcc.c-torture/compile/pr78694.c.
* postreload.cc (move2add_use_add2_insn): Handle
trivial single_sets. Rename variable PAT to SET.
(move2add_use_add3_insn, reload_cse_move2add): Similar.
Diffstat (limited to 'gcc/cp/cp-tree.h')
0 files changed, 0 insertions, 0 deletions