aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-ssa-forwprop.c
diff options
context:
space:
mode:
authorMartin Liska <mliska@suse.cz>2022-01-14 16:56:44 +0100
committerMartin Liska <mliska@suse.cz>2022-01-17 22:12:04 +0100
commit5c69acb32329d49e58c26fa41ae74229a52b9106 (patch)
treeddb05f9d73afb6f998457d2ac4b720e3b3b60483 /gcc/tree-ssa-forwprop.c
parent490e23032baaece71f2ec09fa1805064b150fbc2 (diff)
downloadgcc-5c69acb32329d49e58c26fa41ae74229a52b9106.zip
gcc-5c69acb32329d49e58c26fa41ae74229a52b9106.tar.gz
gcc-5c69acb32329d49e58c26fa41ae74229a52b9106.tar.bz2
Rename .c files to .cc files.
gcc/ada/ChangeLog: * adadecode.c: Moved to... * adadecode.cc: ...here. * affinity.c: Moved to... * affinity.cc: ...here. * argv-lynxos178-raven-cert.c: Moved to... * argv-lynxos178-raven-cert.cc: ...here. * argv.c: Moved to... * argv.cc: ...here. * aux-io.c: Moved to... * aux-io.cc: ...here. * cio.c: Moved to... * cio.cc: ...here. * cstreams.c: Moved to... * cstreams.cc: ...here. * env.c: Moved to... * env.cc: ...here. * exit.c: Moved to... * exit.cc: ...here. * expect.c: Moved to... * expect.cc: ...here. * final.c: Moved to... * final.cc: ...here. * gcc-interface/cuintp.c: Moved to... * gcc-interface/cuintp.cc: ...here. * gcc-interface/decl.c: Moved to... * gcc-interface/decl.cc: ...here. * gcc-interface/misc.c: Moved to... * gcc-interface/misc.cc: ...here. * gcc-interface/targtyps.c: Moved to... * gcc-interface/targtyps.cc: ...here. * gcc-interface/trans.c: Moved to... * gcc-interface/trans.cc: ...here. * gcc-interface/utils.c: Moved to... * gcc-interface/utils.cc: ...here. * gcc-interface/utils2.c: Moved to... * gcc-interface/utils2.cc: ...here. * init.c: Moved to... * init.cc: ...here. * initialize.c: Moved to... * initialize.cc: ...here. * libgnarl/thread.c: Moved to... * libgnarl/thread.cc: ...here. * link.c: Moved to... * link.cc: ...here. * locales.c: Moved to... * locales.cc: ...here. * mkdir.c: Moved to... * mkdir.cc: ...here. * raise.c: Moved to... * raise.cc: ...here. * rtfinal.c: Moved to... * rtfinal.cc: ...here. * rtinit.c: Moved to... * rtinit.cc: ...here. * seh_init.c: Moved to... * seh_init.cc: ...here. * sigtramp-armdroid.c: Moved to... * sigtramp-armdroid.cc: ...here. * sigtramp-ios.c: Moved to... * sigtramp-ios.cc: ...here. * sigtramp-qnx.c: Moved to... * sigtramp-qnx.cc: ...here. * sigtramp-vxworks.c: Moved to... * sigtramp-vxworks.cc: ...here. * socket.c: Moved to... * socket.cc: ...here. * tracebak.c: Moved to... * tracebak.cc: ...here. * version.c: Moved to... * version.cc: ...here. * vx_stack_info.c: Moved to... * vx_stack_info.cc: ...here. gcc/ChangeLog: * adjust-alignment.c: Moved to... * adjust-alignment.cc: ...here. * alias.c: Moved to... * alias.cc: ...here. * alloc-pool.c: Moved to... * alloc-pool.cc: ...here. * asan.c: Moved to... * asan.cc: ...here. * attribs.c: Moved to... * attribs.cc: ...here. * auto-inc-dec.c: Moved to... * auto-inc-dec.cc: ...here. * auto-profile.c: Moved to... * auto-profile.cc: ...here. * bb-reorder.c: Moved to... * bb-reorder.cc: ...here. * bitmap.c: Moved to... * bitmap.cc: ...here. * btfout.c: Moved to... * btfout.cc: ...here. * builtins.c: Moved to... * builtins.cc: ...here. * caller-save.c: Moved to... * caller-save.cc: ...here. * calls.c: Moved to... * calls.cc: ...here. * ccmp.c: Moved to... * ccmp.cc: ...here. * cfg.c: Moved to... * cfg.cc: ...here. * cfganal.c: Moved to... * cfganal.cc: ...here. * cfgbuild.c: Moved to... * cfgbuild.cc: ...here. * cfgcleanup.c: Moved to... * cfgcleanup.cc: ...here. * cfgexpand.c: Moved to... * cfgexpand.cc: ...here. * cfghooks.c: Moved to... * cfghooks.cc: ...here. * cfgloop.c: Moved to... * cfgloop.cc: ...here. * cfgloopanal.c: Moved to... * cfgloopanal.cc: ...here. * cfgloopmanip.c: Moved to... * cfgloopmanip.cc: ...here. * cfgrtl.c: Moved to... * cfgrtl.cc: ...here. * cgraph.c: Moved to... * cgraph.cc: ...here. * cgraphbuild.c: Moved to... * cgraphbuild.cc: ...here. * cgraphclones.c: Moved to... * cgraphclones.cc: ...here. * cgraphunit.c: Moved to... * cgraphunit.cc: ...here. * collect-utils.c: Moved to... * collect-utils.cc: ...here. * collect2-aix.c: Moved to... * collect2-aix.cc: ...here. * collect2.c: Moved to... * collect2.cc: ...here. * combine-stack-adj.c: Moved to... * combine-stack-adj.cc: ...here. * combine.c: Moved to... * combine.cc: ...here. * common/common-targhooks.c: Moved to... * common/common-targhooks.cc: ...here. * common/config/aarch64/aarch64-common.c: Moved to... * common/config/aarch64/aarch64-common.cc: ...here. * common/config/alpha/alpha-common.c: Moved to... * common/config/alpha/alpha-common.cc: ...here. * common/config/arc/arc-common.c: Moved to... * common/config/arc/arc-common.cc: ...here. * common/config/arm/arm-common.c: Moved to... * common/config/arm/arm-common.cc: ...here. * common/config/avr/avr-common.c: Moved to... * common/config/avr/avr-common.cc: ...here. * common/config/bfin/bfin-common.c: Moved to... * common/config/bfin/bfin-common.cc: ...here. * common/config/bpf/bpf-common.c: Moved to... * common/config/bpf/bpf-common.cc: ...here. * common/config/c6x/c6x-common.c: Moved to... * common/config/c6x/c6x-common.cc: ...here. * common/config/cr16/cr16-common.c: Moved to... * common/config/cr16/cr16-common.cc: ...here. * common/config/cris/cris-common.c: Moved to... * common/config/cris/cris-common.cc: ...here. * common/config/csky/csky-common.c: Moved to... * common/config/csky/csky-common.cc: ...here. * common/config/default-common.c: Moved to... * common/config/default-common.cc: ...here. * common/config/epiphany/epiphany-common.c: Moved to... * common/config/epiphany/epiphany-common.cc: ...here. * common/config/fr30/fr30-common.c: Moved to... * common/config/fr30/fr30-common.cc: ...here. * common/config/frv/frv-common.c: Moved to... * common/config/frv/frv-common.cc: ...here. * common/config/gcn/gcn-common.c: Moved to... * common/config/gcn/gcn-common.cc: ...here. * common/config/h8300/h8300-common.c: Moved to... * common/config/h8300/h8300-common.cc: ...here. * common/config/i386/i386-common.c: Moved to... * common/config/i386/i386-common.cc: ...here. * common/config/ia64/ia64-common.c: Moved to... * common/config/ia64/ia64-common.cc: ...here. * common/config/iq2000/iq2000-common.c: Moved to... * common/config/iq2000/iq2000-common.cc: ...here. * common/config/lm32/lm32-common.c: Moved to... * common/config/lm32/lm32-common.cc: ...here. * common/config/m32r/m32r-common.c: Moved to... * common/config/m32r/m32r-common.cc: ...here. * common/config/m68k/m68k-common.c: Moved to... * common/config/m68k/m68k-common.cc: ...here. * common/config/mcore/mcore-common.c: Moved to... * common/config/mcore/mcore-common.cc: ...here. * common/config/microblaze/microblaze-common.c: Moved to... * common/config/microblaze/microblaze-common.cc: ...here. * common/config/mips/mips-common.c: Moved to... * common/config/mips/mips-common.cc: ...here. * common/config/mmix/mmix-common.c: Moved to... * common/config/mmix/mmix-common.cc: ...here. * common/config/mn10300/mn10300-common.c: Moved to... * common/config/mn10300/mn10300-common.cc: ...here. * common/config/msp430/msp430-common.c: Moved to... * common/config/msp430/msp430-common.cc: ...here. * common/config/nds32/nds32-common.c: Moved to... * common/config/nds32/nds32-common.cc: ...here. * common/config/nios2/nios2-common.c: Moved to... * common/config/nios2/nios2-common.cc: ...here. * common/config/nvptx/nvptx-common.c: Moved to... * common/config/nvptx/nvptx-common.cc: ...here. * common/config/or1k/or1k-common.c: Moved to... * common/config/or1k/or1k-common.cc: ...here. * common/config/pa/pa-common.c: Moved to... * common/config/pa/pa-common.cc: ...here. * common/config/pdp11/pdp11-common.c: Moved to... * common/config/pdp11/pdp11-common.cc: ...here. * common/config/pru/pru-common.c: Moved to... * common/config/pru/pru-common.cc: ...here. * common/config/riscv/riscv-common.c: Moved to... * common/config/riscv/riscv-common.cc: ...here. * common/config/rs6000/rs6000-common.c: Moved to... * common/config/rs6000/rs6000-common.cc: ...here. * common/config/rx/rx-common.c: Moved to... * common/config/rx/rx-common.cc: ...here. * common/config/s390/s390-common.c: Moved to... * common/config/s390/s390-common.cc: ...here. * common/config/sh/sh-common.c: Moved to... * common/config/sh/sh-common.cc: ...here. * common/config/sparc/sparc-common.c: Moved to... * common/config/sparc/sparc-common.cc: ...here. * common/config/tilegx/tilegx-common.c: Moved to... * common/config/tilegx/tilegx-common.cc: ...here. * common/config/tilepro/tilepro-common.c: Moved to... * common/config/tilepro/tilepro-common.cc: ...here. * common/config/v850/v850-common.c: Moved to... * common/config/v850/v850-common.cc: ...here. * common/config/vax/vax-common.c: Moved to... * common/config/vax/vax-common.cc: ...here. * common/config/visium/visium-common.c: Moved to... * common/config/visium/visium-common.cc: ...here. * common/config/xstormy16/xstormy16-common.c: Moved to... * common/config/xstormy16/xstormy16-common.cc: ...here. * common/config/xtensa/xtensa-common.c: Moved to... * common/config/xtensa/xtensa-common.cc: ...here. * compare-elim.c: Moved to... * compare-elim.cc: ...here. * config/aarch64/aarch64-bti-insert.c: Moved to... * config/aarch64/aarch64-bti-insert.cc: ...here. * config/aarch64/aarch64-builtins.c: Moved to... * config/aarch64/aarch64-builtins.cc: ...here. * config/aarch64/aarch64-c.c: Moved to... * config/aarch64/aarch64-c.cc: ...here. * config/aarch64/aarch64-d.c: Moved to... * config/aarch64/aarch64-d.cc: ...here. * config/aarch64/aarch64.c: Moved to... * config/aarch64/aarch64.cc: ...here. * config/aarch64/cortex-a57-fma-steering.c: Moved to... * config/aarch64/cortex-a57-fma-steering.cc: ...here. * config/aarch64/driver-aarch64.c: Moved to... * config/aarch64/driver-aarch64.cc: ...here. * config/aarch64/falkor-tag-collision-avoidance.c: Moved to... * config/aarch64/falkor-tag-collision-avoidance.cc: ...here. * config/aarch64/host-aarch64-darwin.c: Moved to... * config/aarch64/host-aarch64-darwin.cc: ...here. * config/alpha/alpha.c: Moved to... * config/alpha/alpha.cc: ...here. * config/alpha/driver-alpha.c: Moved to... * config/alpha/driver-alpha.cc: ...here. * config/arc/arc-c.c: Moved to... * config/arc/arc-c.cc: ...here. * config/arc/arc.c: Moved to... * config/arc/arc.cc: ...here. * config/arc/driver-arc.c: Moved to... * config/arc/driver-arc.cc: ...here. * config/arm/aarch-common.c: Moved to... * config/arm/aarch-common.cc: ...here. * config/arm/arm-builtins.c: Moved to... * config/arm/arm-builtins.cc: ...here. * config/arm/arm-c.c: Moved to... * config/arm/arm-c.cc: ...here. * config/arm/arm-d.c: Moved to... * config/arm/arm-d.cc: ...here. * config/arm/arm.c: Moved to... * config/arm/arm.cc: ...here. * config/arm/driver-arm.c: Moved to... * config/arm/driver-arm.cc: ...here. * config/avr/avr-c.c: Moved to... * config/avr/avr-c.cc: ...here. * config/avr/avr-devices.c: Moved to... * config/avr/avr-devices.cc: ...here. * config/avr/avr-log.c: Moved to... * config/avr/avr-log.cc: ...here. * config/avr/avr.c: Moved to... * config/avr/avr.cc: ...here. * config/avr/driver-avr.c: Moved to... * config/avr/driver-avr.cc: ...here. * config/avr/gen-avr-mmcu-specs.c: Moved to... * config/avr/gen-avr-mmcu-specs.cc: ...here. * config/avr/gen-avr-mmcu-texi.c: Moved to... * config/avr/gen-avr-mmcu-texi.cc: ...here. * config/bfin/bfin.c: Moved to... * config/bfin/bfin.cc: ...here. * config/bpf/bpf.c: Moved to... * config/bpf/bpf.cc: ...here. * config/bpf/coreout.c: Moved to... * config/bpf/coreout.cc: ...here. * config/c6x/c6x.c: Moved to... * config/c6x/c6x.cc: ...here. * config/cr16/cr16.c: Moved to... * config/cr16/cr16.cc: ...here. * config/cris/cris.c: Moved to... * config/cris/cris.cc: ...here. * config/csky/csky.c: Moved to... * config/csky/csky.cc: ...here. * config/darwin-c.c: Moved to... * config/darwin-c.cc: ...here. * config/darwin-d.c: Moved to... * config/darwin-d.cc: ...here. * config/darwin-driver.c: Moved to... * config/darwin-driver.cc: ...here. * config/darwin-f.c: Moved to... * config/darwin-f.cc: ...here. * config/darwin.c: Moved to... * config/darwin.cc: ...here. * config/default-c.c: Moved to... * config/default-c.cc: ...here. * config/default-d.c: Moved to... * config/default-d.cc: ...here. * config/dragonfly-d.c: Moved to... * config/dragonfly-d.cc: ...here. * config/epiphany/epiphany.c: Moved to... * config/epiphany/epiphany.cc: ...here. * config/epiphany/mode-switch-use.c: Moved to... * config/epiphany/mode-switch-use.cc: ...here. * config/epiphany/resolve-sw-modes.c: Moved to... * config/epiphany/resolve-sw-modes.cc: ...here. * config/fr30/fr30.c: Moved to... * config/fr30/fr30.cc: ...here. * config/freebsd-d.c: Moved to... * config/freebsd-d.cc: ...here. * config/frv/frv.c: Moved to... * config/frv/frv.cc: ...here. * config/ft32/ft32.c: Moved to... * config/ft32/ft32.cc: ...here. * config/gcn/driver-gcn.c: Moved to... * config/gcn/driver-gcn.cc: ...here. * config/gcn/gcn-run.c: Moved to... * config/gcn/gcn-run.cc: ...here. * config/gcn/gcn-tree.c: Moved to... * config/gcn/gcn-tree.cc: ...here. * config/gcn/gcn.c: Moved to... * config/gcn/gcn.cc: ...here. * config/gcn/mkoffload.c: Moved to... * config/gcn/mkoffload.cc: ...here. * config/glibc-c.c: Moved to... * config/glibc-c.cc: ...here. * config/glibc-d.c: Moved to... * config/glibc-d.cc: ...here. * config/h8300/h8300.c: Moved to... * config/h8300/h8300.cc: ...here. * config/host-darwin.c: Moved to... * config/host-darwin.cc: ...here. * config/host-hpux.c: Moved to... * config/host-hpux.cc: ...here. * config/host-linux.c: Moved to... * config/host-linux.cc: ...here. * config/host-netbsd.c: Moved to... * config/host-netbsd.cc: ...here. * config/host-openbsd.c: Moved to... * config/host-openbsd.cc: ...here. * config/host-solaris.c: Moved to... * config/host-solaris.cc: ...here. * config/i386/djgpp.c: Moved to... * config/i386/djgpp.cc: ...here. * config/i386/driver-i386.c: Moved to... * config/i386/driver-i386.cc: ...here. * config/i386/driver-mingw32.c: Moved to... * config/i386/driver-mingw32.cc: ...here. * config/i386/gnu-property.c: Moved to... * config/i386/gnu-property.cc: ...here. * config/i386/host-cygwin.c: Moved to... * config/i386/host-cygwin.cc: ...here. * config/i386/host-i386-darwin.c: Moved to... * config/i386/host-i386-darwin.cc: ...here. * config/i386/host-mingw32.c: Moved to... * config/i386/host-mingw32.cc: ...here. * config/i386/i386-builtins.c: Moved to... * config/i386/i386-builtins.cc: ...here. * config/i386/i386-c.c: Moved to... * config/i386/i386-c.cc: ...here. * config/i386/i386-d.c: Moved to... * config/i386/i386-d.cc: ...here. * config/i386/i386-expand.c: Moved to... * config/i386/i386-expand.cc: ...here. * config/i386/i386-features.c: Moved to... * config/i386/i386-features.cc: ...here. * config/i386/i386-options.c: Moved to... * config/i386/i386-options.cc: ...here. * config/i386/i386.c: Moved to... * config/i386/i386.cc: ...here. * config/i386/intelmic-mkoffload.c: Moved to... * config/i386/intelmic-mkoffload.cc: ...here. * config/i386/msformat-c.c: Moved to... * config/i386/msformat-c.cc: ...here. * config/i386/winnt-cxx.c: Moved to... * config/i386/winnt-cxx.cc: ...here. * config/i386/winnt-d.c: Moved to... * config/i386/winnt-d.cc: ...here. * config/i386/winnt-stubs.c: Moved to... * config/i386/winnt-stubs.cc: ...here. * config/i386/winnt.c: Moved to... * config/i386/winnt.cc: ...here. * config/i386/x86-tune-sched-atom.c: Moved to... * config/i386/x86-tune-sched-atom.cc: ...here. * config/i386/x86-tune-sched-bd.c: Moved to... * config/i386/x86-tune-sched-bd.cc: ...here. * config/i386/x86-tune-sched-core.c: Moved to... * config/i386/x86-tune-sched-core.cc: ...here. * config/i386/x86-tune-sched.c: Moved to... * config/i386/x86-tune-sched.cc: ...here. * config/ia64/ia64-c.c: Moved to... * config/ia64/ia64-c.cc: ...here. * config/ia64/ia64.c: Moved to... * config/ia64/ia64.cc: ...here. * config/iq2000/iq2000.c: Moved to... * config/iq2000/iq2000.cc: ...here. * config/linux.c: Moved to... * config/linux.cc: ...here. * config/lm32/lm32.c: Moved to... * config/lm32/lm32.cc: ...here. * config/m32c/m32c-pragma.c: Moved to... * config/m32c/m32c-pragma.cc: ...here. * config/m32c/m32c.c: Moved to... * config/m32c/m32c.cc: ...here. * config/m32r/m32r.c: Moved to... * config/m32r/m32r.cc: ...here. * config/m68k/m68k.c: Moved to... * config/m68k/m68k.cc: ...here. * config/mcore/mcore.c: Moved to... * config/mcore/mcore.cc: ...here. * config/microblaze/microblaze-c.c: Moved to... * config/microblaze/microblaze-c.cc: ...here. * config/microblaze/microblaze.c: Moved to... * config/microblaze/microblaze.cc: ...here. * config/mips/driver-native.c: Moved to... * config/mips/driver-native.cc: ...here. * config/mips/frame-header-opt.c: Moved to... * config/mips/frame-header-opt.cc: ...here. * config/mips/mips-d.c: Moved to... * config/mips/mips-d.cc: ...here. * config/mips/mips.c: Moved to... * config/mips/mips.cc: ...here. * config/mmix/mmix.c: Moved to... * config/mmix/mmix.cc: ...here. * config/mn10300/mn10300.c: Moved to... * config/mn10300/mn10300.cc: ...here. * config/moxie/moxie.c: Moved to... * config/moxie/moxie.cc: ...here. * config/msp430/driver-msp430.c: Moved to... * config/msp430/driver-msp430.cc: ...here. * config/msp430/msp430-c.c: Moved to... * config/msp430/msp430-c.cc: ...here. * config/msp430/msp430-devices.c: Moved to... * config/msp430/msp430-devices.cc: ...here. * config/msp430/msp430.c: Moved to... * config/msp430/msp430.cc: ...here. * config/nds32/nds32-cost.c: Moved to... * config/nds32/nds32-cost.cc: ...here. * config/nds32/nds32-fp-as-gp.c: Moved to... * config/nds32/nds32-fp-as-gp.cc: ...here. * config/nds32/nds32-intrinsic.c: Moved to... * config/nds32/nds32-intrinsic.cc: ...here. * config/nds32/nds32-isr.c: Moved to... * config/nds32/nds32-isr.cc: ...here. * config/nds32/nds32-md-auxiliary.c: Moved to... * config/nds32/nds32-md-auxiliary.cc: ...here. * config/nds32/nds32-memory-manipulation.c: Moved to... * config/nds32/nds32-memory-manipulation.cc: ...here. * config/nds32/nds32-pipelines-auxiliary.c: Moved to... * config/nds32/nds32-pipelines-auxiliary.cc: ...here. * config/nds32/nds32-predicates.c: Moved to... * config/nds32/nds32-predicates.cc: ...here. * config/nds32/nds32-relax-opt.c: Moved to... * config/nds32/nds32-relax-opt.cc: ...here. * config/nds32/nds32-utils.c: Moved to... * config/nds32/nds32-utils.cc: ...here. * config/nds32/nds32.c: Moved to... * config/nds32/nds32.cc: ...here. * config/netbsd-d.c: Moved to... * config/netbsd-d.cc: ...here. * config/netbsd.c: Moved to... * config/netbsd.cc: ...here. * config/nios2/nios2.c: Moved to... * config/nios2/nios2.cc: ...here. * config/nvptx/mkoffload.c: Moved to... * config/nvptx/mkoffload.cc: ...here. * config/nvptx/nvptx-c.c: Moved to... * config/nvptx/nvptx-c.cc: ...here. * config/nvptx/nvptx.c: Moved to... * config/nvptx/nvptx.cc: ...here. * config/openbsd-d.c: Moved to... * config/openbsd-d.cc: ...here. * config/or1k/or1k.c: Moved to... * config/or1k/or1k.cc: ...here. * config/pa/pa-d.c: Moved to... * config/pa/pa-d.cc: ...here. * config/pa/pa.c: Moved to... * config/pa/pa.cc: ...here. * config/pdp11/pdp11.c: Moved to... * config/pdp11/pdp11.cc: ...here. * config/pru/pru-passes.c: Moved to... * config/pru/pru-passes.cc: ...here. * config/pru/pru-pragma.c: Moved to... * config/pru/pru-pragma.cc: ...here. * config/pru/pru.c: Moved to... * config/pru/pru.cc: ...here. * config/riscv/riscv-builtins.c: Moved to... * config/riscv/riscv-builtins.cc: ...here. * config/riscv/riscv-c.c: Moved to... * config/riscv/riscv-c.cc: ...here. * config/riscv/riscv-d.c: Moved to... * config/riscv/riscv-d.cc: ...here. * config/riscv/riscv-shorten-memrefs.c: Moved to... * config/riscv/riscv-shorten-memrefs.cc: ...here. * config/riscv/riscv-sr.c: Moved to... * config/riscv/riscv-sr.cc: ...here. * config/riscv/riscv.c: Moved to... * config/riscv/riscv.cc: ...here. * config/rl78/rl78-c.c: Moved to... * config/rl78/rl78-c.cc: ...here. * config/rl78/rl78.c: Moved to... * config/rl78/rl78.cc: ...here. * config/rs6000/driver-rs6000.c: Moved to... * config/rs6000/driver-rs6000.cc: ...here. * config/rs6000/host-darwin.c: Moved to... * config/rs6000/host-darwin.cc: ...here. * config/rs6000/host-ppc64-darwin.c: Moved to... * config/rs6000/host-ppc64-darwin.cc: ...here. * config/rs6000/rbtree.c: Moved to... * config/rs6000/rbtree.cc: ...here. * config/rs6000/rs6000-c.c: Moved to... * config/rs6000/rs6000-c.cc: ...here. * config/rs6000/rs6000-call.c: Moved to... * config/rs6000/rs6000-call.cc: ...here. * config/rs6000/rs6000-d.c: Moved to... * config/rs6000/rs6000-d.cc: ...here. * config/rs6000/rs6000-gen-builtins.c: Moved to... * config/rs6000/rs6000-gen-builtins.cc: ...here. * config/rs6000/rs6000-linux.c: Moved to... * config/rs6000/rs6000-linux.cc: ...here. * config/rs6000/rs6000-logue.c: Moved to... * config/rs6000/rs6000-logue.cc: ...here. * config/rs6000/rs6000-p8swap.c: Moved to... * config/rs6000/rs6000-p8swap.cc: ...here. * config/rs6000/rs6000-pcrel-opt.c: Moved to... * config/rs6000/rs6000-pcrel-opt.cc: ...here. * config/rs6000/rs6000-string.c: Moved to... * config/rs6000/rs6000-string.cc: ...here. * config/rs6000/rs6000.c: Moved to... * config/rs6000/rs6000.cc: ...here. * config/rx/rx.c: Moved to... * config/rx/rx.cc: ...here. * config/s390/driver-native.c: Moved to... * config/s390/driver-native.cc: ...here. * config/s390/s390-c.c: Moved to... * config/s390/s390-c.cc: ...here. * config/s390/s390-d.c: Moved to... * config/s390/s390-d.cc: ...here. * config/s390/s390.c: Moved to... * config/s390/s390.cc: ...here. * config/sh/divtab-sh4-300.c: Moved to... * config/sh/divtab-sh4-300.cc: ...here. * config/sh/divtab-sh4.c: Moved to... * config/sh/divtab-sh4.cc: ...here. * config/sh/divtab.c: Moved to... * config/sh/divtab.cc: ...here. * config/sh/sh-c.c: Moved to... * config/sh/sh-c.cc: ...here. * config/sh/sh.c: Moved to... * config/sh/sh.cc: ...here. * config/sol2-c.c: Moved to... * config/sol2-c.cc: ...here. * config/sol2-cxx.c: Moved to... * config/sol2-cxx.cc: ...here. * config/sol2-d.c: Moved to... * config/sol2-d.cc: ...here. * config/sol2-stubs.c: Moved to... * config/sol2-stubs.cc: ...here. * config/sol2.c: Moved to... * config/sol2.cc: ...here. * config/sparc/driver-sparc.c: Moved to... * config/sparc/driver-sparc.cc: ...here. * config/sparc/sparc-c.c: Moved to... * config/sparc/sparc-c.cc: ...here. * config/sparc/sparc-d.c: Moved to... * config/sparc/sparc-d.cc: ...here. * config/sparc/sparc.c: Moved to... * config/sparc/sparc.cc: ...here. * config/stormy16/stormy16.c: Moved to... * config/stormy16/stormy16.cc: ...here. * config/tilegx/mul-tables.c: Moved to... * config/tilegx/mul-tables.cc: ...here. * config/tilegx/tilegx-c.c: Moved to... * config/tilegx/tilegx-c.cc: ...here. * config/tilegx/tilegx.c: Moved to... * config/tilegx/tilegx.cc: ...here. * config/tilepro/mul-tables.c: Moved to... * config/tilepro/mul-tables.cc: ...here. * config/tilepro/tilepro-c.c: Moved to... * config/tilepro/tilepro-c.cc: ...here. * config/tilepro/tilepro.c: Moved to... * config/tilepro/tilepro.cc: ...here. * config/v850/v850-c.c: Moved to... * config/v850/v850-c.cc: ...here. * config/v850/v850.c: Moved to... * config/v850/v850.cc: ...here. * config/vax/vax.c: Moved to... * config/vax/vax.cc: ...here. * config/visium/visium.c: Moved to... * config/visium/visium.cc: ...here. * config/vms/vms-c.c: Moved to... * config/vms/vms-c.cc: ...here. * config/vms/vms-f.c: Moved to... * config/vms/vms-f.cc: ...here. * config/vms/vms.c: Moved to... * config/vms/vms.cc: ...here. * config/vxworks-c.c: Moved to... * config/vxworks-c.cc: ...here. * config/vxworks.c: Moved to... * config/vxworks.cc: ...here. * config/winnt-c.c: Moved to... * config/winnt-c.cc: ...here. * config/xtensa/xtensa.c: Moved to... * config/xtensa/xtensa.cc: ...here. * context.c: Moved to... * context.cc: ...here. * convert.c: Moved to... * convert.cc: ...here. * coverage.c: Moved to... * coverage.cc: ...here. * cppbuiltin.c: Moved to... * cppbuiltin.cc: ...here. * cppdefault.c: Moved to... * cppdefault.cc: ...here. * cprop.c: Moved to... * cprop.cc: ...here. * cse.c: Moved to... * cse.cc: ...here. * cselib.c: Moved to... * cselib.cc: ...here. * ctfc.c: Moved to... * ctfc.cc: ...here. * ctfout.c: Moved to... * ctfout.cc: ...here. * data-streamer-in.c: Moved to... * data-streamer-in.cc: ...here. * data-streamer-out.c: Moved to... * data-streamer-out.cc: ...here. * data-streamer.c: Moved to... * data-streamer.cc: ...here. * dbgcnt.c: Moved to... * dbgcnt.cc: ...here. * dbxout.c: Moved to... * dbxout.cc: ...here. * dce.c: Moved to... * dce.cc: ...here. * ddg.c: Moved to... * ddg.cc: ...here. * debug.c: Moved to... * debug.cc: ...here. * df-core.c: Moved to... * df-core.cc: ...here. * df-problems.c: Moved to... * df-problems.cc: ...here. * df-scan.c: Moved to... * df-scan.cc: ...here. * dfp.c: Moved to... * dfp.cc: ...here. * diagnostic-color.c: Moved to... * diagnostic-color.cc: ...here. * diagnostic-show-locus.c: Moved to... * diagnostic-show-locus.cc: ...here. * diagnostic-spec.c: Moved to... * diagnostic-spec.cc: ...here. * diagnostic.c: Moved to... * diagnostic.cc: ...here. * dojump.c: Moved to... * dojump.cc: ...here. * dominance.c: Moved to... * dominance.cc: ...here. * domwalk.c: Moved to... * domwalk.cc: ...here. * double-int.c: Moved to... * double-int.cc: ...here. * dse.c: Moved to... * dse.cc: ...here. * dumpfile.c: Moved to... * dumpfile.cc: ...here. * dwarf2asm.c: Moved to... * dwarf2asm.cc: ...here. * dwarf2cfi.c: Moved to... * dwarf2cfi.cc: ...here. * dwarf2ctf.c: Moved to... * dwarf2ctf.cc: ...here. * dwarf2out.c: Moved to... * dwarf2out.cc: ...here. * early-remat.c: Moved to... * early-remat.cc: ...here. * edit-context.c: Moved to... * edit-context.cc: ...here. * emit-rtl.c: Moved to... * emit-rtl.cc: ...here. * errors.c: Moved to... * errors.cc: ...here. * et-forest.c: Moved to... * et-forest.cc: ...here. * except.c: Moved to... * except.cc: ...here. * explow.c: Moved to... * explow.cc: ...here. * expmed.c: Moved to... * expmed.cc: ...here. * expr.c: Moved to... * expr.cc: ...here. * fibonacci_heap.c: Moved to... * fibonacci_heap.cc: ...here. * file-find.c: Moved to... * file-find.cc: ...here. * file-prefix-map.c: Moved to... * file-prefix-map.cc: ...here. * final.c: Moved to... * final.cc: ...here. * fixed-value.c: Moved to... * fixed-value.cc: ...here. * fold-const-call.c: Moved to... * fold-const-call.cc: ...here. * fold-const.c: Moved to... * fold-const.cc: ...here. * fp-test.c: Moved to... * fp-test.cc: ...here. * function-tests.c: Moved to... * function-tests.cc: ...here. * function.c: Moved to... * function.cc: ...here. * fwprop.c: Moved to... * fwprop.cc: ...here. * gcc-ar.c: Moved to... * gcc-ar.cc: ...here. * gcc-main.c: Moved to... * gcc-main.cc: ...here. * gcc-rich-location.c: Moved to... * gcc-rich-location.cc: ...here. * gcc.c: Moved to... * gcc.cc: ...here. * gcov-dump.c: Moved to... * gcov-dump.cc: ...here. * gcov-io.c: Moved to... * gcov-io.cc: ...here. * gcov-tool.c: Moved to... * gcov-tool.cc: ...here. * gcov.c: Moved to... * gcov.cc: ...here. * gcse-common.c: Moved to... * gcse-common.cc: ...here. * gcse.c: Moved to... * gcse.cc: ...here. * genattr-common.c: Moved to... * genattr-common.cc: ...here. * genattr.c: Moved to... * genattr.cc: ...here. * genattrtab.c: Moved to... * genattrtab.cc: ...here. * genautomata.c: Moved to... * genautomata.cc: ...here. * gencfn-macros.c: Moved to... * gencfn-macros.cc: ...here. * gencheck.c: Moved to... * gencheck.cc: ...here. * genchecksum.c: Moved to... * genchecksum.cc: ...here. * gencodes.c: Moved to... * gencodes.cc: ...here. * genconditions.c: Moved to... * genconditions.cc: ...here. * genconfig.c: Moved to... * genconfig.cc: ...here. * genconstants.c: Moved to... * genconstants.cc: ...here. * genemit.c: Moved to... * genemit.cc: ...here. * genenums.c: Moved to... * genenums.cc: ...here. * generic-match-head.c: Moved to... * generic-match-head.cc: ...here. * genextract.c: Moved to... * genextract.cc: ...here. * genflags.c: Moved to... * genflags.cc: ...here. * gengenrtl.c: Moved to... * gengenrtl.cc: ...here. * gengtype-parse.c: Moved to... * gengtype-parse.cc: ...here. * gengtype-state.c: Moved to... * gengtype-state.cc: ...here. * gengtype.c: Moved to... * gengtype.cc: ...here. * genhooks.c: Moved to... * genhooks.cc: ...here. * genmatch.c: Moved to... * genmatch.cc: ...here. * genmddeps.c: Moved to... * genmddeps.cc: ...here. * genmddump.c: Moved to... * genmddump.cc: ...here. * genmodes.c: Moved to... * genmodes.cc: ...here. * genopinit.c: Moved to... * genopinit.cc: ...here. * genoutput.c: Moved to... * genoutput.cc: ...here. * genpeep.c: Moved to... * genpeep.cc: ...here. * genpreds.c: Moved to... * genpreds.cc: ...here. * genrecog.c: Moved to... * genrecog.cc: ...here. * gensupport.c: Moved to... * gensupport.cc: ...here. * gentarget-def.c: Moved to... * gentarget-def.cc: ...here. * genversion.c: Moved to... * genversion.cc: ...here. * ggc-common.c: Moved to... * ggc-common.cc: ...here. * ggc-none.c: Moved to... * ggc-none.cc: ...here. * ggc-page.c: Moved to... * ggc-page.cc: ...here. * ggc-tests.c: Moved to... * ggc-tests.cc: ...here. * gimple-builder.c: Moved to... * gimple-builder.cc: ...here. * gimple-expr.c: Moved to... * gimple-expr.cc: ...here. * gimple-fold.c: Moved to... * gimple-fold.cc: ...here. * gimple-iterator.c: Moved to... * gimple-iterator.cc: ...here. * gimple-laddress.c: Moved to... * gimple-laddress.cc: ...here. * gimple-loop-jam.c: Moved to... * gimple-loop-jam.cc: ...here. * gimple-low.c: Moved to... * gimple-low.cc: ...here. * gimple-match-head.c: Moved to... * gimple-match-head.cc: ...here. * gimple-pretty-print.c: Moved to... * gimple-pretty-print.cc: ...here. * gimple-ssa-backprop.c: Moved to... * gimple-ssa-backprop.cc: ...here. * gimple-ssa-evrp-analyze.c: Moved to... * gimple-ssa-evrp-analyze.cc: ...here. * gimple-ssa-evrp.c: Moved to... * gimple-ssa-evrp.cc: ...here. * gimple-ssa-isolate-paths.c: Moved to... * gimple-ssa-isolate-paths.cc: ...here. * gimple-ssa-nonnull-compare.c: Moved to... * gimple-ssa-nonnull-compare.cc: ...here. * gimple-ssa-split-paths.c: Moved to... * gimple-ssa-split-paths.cc: ...here. * gimple-ssa-sprintf.c: Moved to... * gimple-ssa-sprintf.cc: ...here. * gimple-ssa-store-merging.c: Moved to... * gimple-ssa-store-merging.cc: ...here. * gimple-ssa-strength-reduction.c: Moved to... * gimple-ssa-strength-reduction.cc: ...here. * gimple-ssa-warn-alloca.c: Moved to... * gimple-ssa-warn-alloca.cc: ...here. * gimple-ssa-warn-restrict.c: Moved to... * gimple-ssa-warn-restrict.cc: ...here. * gimple-streamer-in.c: Moved to... * gimple-streamer-in.cc: ...here. * gimple-streamer-out.c: Moved to... * gimple-streamer-out.cc: ...here. * gimple-walk.c: Moved to... * gimple-walk.cc: ...here. * gimple-warn-recursion.c: Moved to... * gimple-warn-recursion.cc: ...here. * gimple.c: Moved to... * gimple.cc: ...here. * gimplify-me.c: Moved to... * gimplify-me.cc: ...here. * gimplify.c: Moved to... * gimplify.cc: ...here. * godump.c: Moved to... * godump.cc: ...here. * graph.c: Moved to... * graph.cc: ...here. * graphds.c: Moved to... * graphds.cc: ...here. * graphite-dependences.c: Moved to... * graphite-dependences.cc: ...here. * graphite-isl-ast-to-gimple.c: Moved to... * graphite-isl-ast-to-gimple.cc: ...here. * graphite-optimize-isl.c: Moved to... * graphite-optimize-isl.cc: ...here. * graphite-poly.c: Moved to... * graphite-poly.cc: ...here. * graphite-scop-detection.c: Moved to... * graphite-scop-detection.cc: ...here. * graphite-sese-to-poly.c: Moved to... * graphite-sese-to-poly.cc: ...here. * graphite.c: Moved to... * graphite.cc: ...here. * haifa-sched.c: Moved to... * haifa-sched.cc: ...here. * hash-map-tests.c: Moved to... * hash-map-tests.cc: ...here. * hash-set-tests.c: Moved to... * hash-set-tests.cc: ...here. * hash-table.c: Moved to... * hash-table.cc: ...here. * hooks.c: Moved to... * hooks.cc: ...here. * host-default.c: Moved to... * host-default.cc: ...here. * hw-doloop.c: Moved to... * hw-doloop.cc: ...here. * hwint.c: Moved to... * hwint.cc: ...here. * ifcvt.c: Moved to... * ifcvt.cc: ...here. * inchash.c: Moved to... * inchash.cc: ...here. * incpath.c: Moved to... * incpath.cc: ...here. * init-regs.c: Moved to... * init-regs.cc: ...here. * input.c: Moved to... * input.cc: ...here. * internal-fn.c: Moved to... * internal-fn.cc: ...here. * intl.c: Moved to... * intl.cc: ...here. * ipa-comdats.c: Moved to... * ipa-comdats.cc: ...here. * ipa-cp.c: Moved to... * ipa-cp.cc: ...here. * ipa-devirt.c: Moved to... * ipa-devirt.cc: ...here. * ipa-fnsummary.c: Moved to... * ipa-fnsummary.cc: ...here. * ipa-icf-gimple.c: Moved to... * ipa-icf-gimple.cc: ...here. * ipa-icf.c: Moved to... * ipa-icf.cc: ...here. * ipa-inline-analysis.c: Moved to... * ipa-inline-analysis.cc: ...here. * ipa-inline-transform.c: Moved to... * ipa-inline-transform.cc: ...here. * ipa-inline.c: Moved to... * ipa-inline.cc: ...here. * ipa-modref-tree.c: Moved to... * ipa-modref-tree.cc: ...here. * ipa-modref.c: Moved to... * ipa-modref.cc: ...here. * ipa-param-manipulation.c: Moved to... * ipa-param-manipulation.cc: ...here. * ipa-polymorphic-call.c: Moved to... * ipa-polymorphic-call.cc: ...here. * ipa-predicate.c: Moved to... * ipa-predicate.cc: ...here. * ipa-profile.c: Moved to... * ipa-profile.cc: ...here. * ipa-prop.c: Moved to... * ipa-prop.cc: ...here. * ipa-pure-const.c: Moved to... * ipa-pure-const.cc: ...here. * ipa-ref.c: Moved to... * ipa-ref.cc: ...here. * ipa-reference.c: Moved to... * ipa-reference.cc: ...here. * ipa-split.c: Moved to... * ipa-split.cc: ...here. * ipa-sra.c: Moved to... * ipa-sra.cc: ...here. * ipa-utils.c: Moved to... * ipa-utils.cc: ...here. * ipa-visibility.c: Moved to... * ipa-visibility.cc: ...here. * ipa.c: Moved to... * ipa.cc: ...here. * ira-build.c: Moved to... * ira-build.cc: ...here. * ira-color.c: Moved to... * ira-color.cc: ...here. * ira-conflicts.c: Moved to... * ira-conflicts.cc: ...here. * ira-costs.c: Moved to... * ira-costs.cc: ...here. * ira-emit.c: Moved to... * ira-emit.cc: ...here. * ira-lives.c: Moved to... * ira-lives.cc: ...here. * ira.c: Moved to... * ira.cc: ...here. * jump.c: Moved to... * jump.cc: ...here. * langhooks.c: Moved to... * langhooks.cc: ...here. * lcm.c: Moved to... * lcm.cc: ...here. * lists.c: Moved to... * lists.cc: ...here. * loop-doloop.c: Moved to... * loop-doloop.cc: ...here. * loop-init.c: Moved to... * loop-init.cc: ...here. * loop-invariant.c: Moved to... * loop-invariant.cc: ...here. * loop-iv.c: Moved to... * loop-iv.cc: ...here. * loop-unroll.c: Moved to... * loop-unroll.cc: ...here. * lower-subreg.c: Moved to... * lower-subreg.cc: ...here. * lra-assigns.c: Moved to... * lra-assigns.cc: ...here. * lra-coalesce.c: Moved to... * lra-coalesce.cc: ...here. * lra-constraints.c: Moved to... * lra-constraints.cc: ...here. * lra-eliminations.c: Moved to... * lra-eliminations.cc: ...here. * lra-lives.c: Moved to... * lra-lives.cc: ...here. * lra-remat.c: Moved to... * lra-remat.cc: ...here. * lra-spills.c: Moved to... * lra-spills.cc: ...here. * lra.c: Moved to... * lra.cc: ...here. * lto-cgraph.c: Moved to... * lto-cgraph.cc: ...here. * lto-compress.c: Moved to... * lto-compress.cc: ...here. * lto-opts.c: Moved to... * lto-opts.cc: ...here. * lto-section-in.c: Moved to... * lto-section-in.cc: ...here. * lto-section-out.c: Moved to... * lto-section-out.cc: ...here. * lto-streamer-in.c: Moved to... * lto-streamer-in.cc: ...here. * lto-streamer-out.c: Moved to... * lto-streamer-out.cc: ...here. * lto-streamer.c: Moved to... * lto-streamer.cc: ...here. * lto-wrapper.c: Moved to... * lto-wrapper.cc: ...here. * main.c: Moved to... * main.cc: ...here. * mcf.c: Moved to... * mcf.cc: ...here. * mode-switching.c: Moved to... * mode-switching.cc: ...here. * modulo-sched.c: Moved to... * modulo-sched.cc: ...here. * multiple_target.c: Moved to... * multiple_target.cc: ...here. * omp-expand.c: Moved to... * omp-expand.cc: ...here. * omp-general.c: Moved to... * omp-general.cc: ...here. * omp-low.c: Moved to... * omp-low.cc: ...here. * omp-offload.c: Moved to... * omp-offload.cc: ...here. * omp-simd-clone.c: Moved to... * omp-simd-clone.cc: ...here. * opt-suggestions.c: Moved to... * opt-suggestions.cc: ...here. * optabs-libfuncs.c: Moved to... * optabs-libfuncs.cc: ...here. * optabs-query.c: Moved to... * optabs-query.cc: ...here. * optabs-tree.c: Moved to... * optabs-tree.cc: ...here. * optabs.c: Moved to... * optabs.cc: ...here. * opts-common.c: Moved to... * opts-common.cc: ...here. * opts-global.c: Moved to... * opts-global.cc: ...here. * opts.c: Moved to... * opts.cc: ...here. * passes.c: Moved to... * passes.cc: ...here. * plugin.c: Moved to... * plugin.cc: ...here. * postreload-gcse.c: Moved to... * postreload-gcse.cc: ...here. * postreload.c: Moved to... * postreload.cc: ...here. * predict.c: Moved to... * predict.cc: ...here. * prefix.c: Moved to... * prefix.cc: ...here. * pretty-print.c: Moved to... * pretty-print.cc: ...here. * print-rtl-function.c: Moved to... * print-rtl-function.cc: ...here. * print-rtl.c: Moved to... * print-rtl.cc: ...here. * print-tree.c: Moved to... * print-tree.cc: ...here. * profile-count.c: Moved to... * profile-count.cc: ...here. * profile.c: Moved to... * profile.cc: ...here. * read-md.c: Moved to... * read-md.cc: ...here. * read-rtl-function.c: Moved to... * read-rtl-function.cc: ...here. * read-rtl.c: Moved to... * read-rtl.cc: ...here. * real.c: Moved to... * real.cc: ...here. * realmpfr.c: Moved to... * realmpfr.cc: ...here. * recog.c: Moved to... * recog.cc: ...here. * ree.c: Moved to... * ree.cc: ...here. * reg-stack.c: Moved to... * reg-stack.cc: ...here. * regcprop.c: Moved to... * regcprop.cc: ...here. * reginfo.c: Moved to... * reginfo.cc: ...here. * regrename.c: Moved to... * regrename.cc: ...here. * regstat.c: Moved to... * regstat.cc: ...here. * reload.c: Moved to... * reload.cc: ...here. * reload1.c: Moved to... * reload1.cc: ...here. * reorg.c: Moved to... * reorg.cc: ...here. * resource.c: Moved to... * resource.cc: ...here. * rtl-error.c: Moved to... * rtl-error.cc: ...here. * rtl-tests.c: Moved to... * rtl-tests.cc: ...here. * rtl.c: Moved to... * rtl.cc: ...here. * rtlanal.c: Moved to... * rtlanal.cc: ...here. * rtlhash.c: Moved to... * rtlhash.cc: ...here. * rtlhooks.c: Moved to... * rtlhooks.cc: ...here. * rtx-vector-builder.c: Moved to... * rtx-vector-builder.cc: ...here. * run-rtl-passes.c: Moved to... * run-rtl-passes.cc: ...here. * sancov.c: Moved to... * sancov.cc: ...here. * sanopt.c: Moved to... * sanopt.cc: ...here. * sbitmap.c: Moved to... * sbitmap.cc: ...here. * sched-deps.c: Moved to... * sched-deps.cc: ...here. * sched-ebb.c: Moved to... * sched-ebb.cc: ...here. * sched-rgn.c: Moved to... * sched-rgn.cc: ...here. * sel-sched-dump.c: Moved to... * sel-sched-dump.cc: ...here. * sel-sched-ir.c: Moved to... * sel-sched-ir.cc: ...here. * sel-sched.c: Moved to... * sel-sched.cc: ...here. * selftest-diagnostic.c: Moved to... * selftest-diagnostic.cc: ...here. * selftest-rtl.c: Moved to... * selftest-rtl.cc: ...here. * selftest-run-tests.c: Moved to... * selftest-run-tests.cc: ...here. * selftest.c: Moved to... * selftest.cc: ...here. * sese.c: Moved to... * sese.cc: ...here. * shrink-wrap.c: Moved to... * shrink-wrap.cc: ...here. * simplify-rtx.c: Moved to... * simplify-rtx.cc: ...here. * sparseset.c: Moved to... * sparseset.cc: ...here. * spellcheck-tree.c: Moved to... * spellcheck-tree.cc: ...here. * spellcheck.c: Moved to... * spellcheck.cc: ...here. * sreal.c: Moved to... * sreal.cc: ...here. * stack-ptr-mod.c: Moved to... * stack-ptr-mod.cc: ...here. * statistics.c: Moved to... * statistics.cc: ...here. * stmt.c: Moved to... * stmt.cc: ...here. * stor-layout.c: Moved to... * stor-layout.cc: ...here. * store-motion.c: Moved to... * store-motion.cc: ...here. * streamer-hooks.c: Moved to... * streamer-hooks.cc: ...here. * stringpool.c: Moved to... * stringpool.cc: ...here. * substring-locations.c: Moved to... * substring-locations.cc: ...here. * symtab.c: Moved to... * symtab.cc: ...here. * target-globals.c: Moved to... * target-globals.cc: ...here. * targhooks.c: Moved to... * targhooks.cc: ...here. * timevar.c: Moved to... * timevar.cc: ...here. * toplev.c: Moved to... * toplev.cc: ...here. * tracer.c: Moved to... * tracer.cc: ...here. * trans-mem.c: Moved to... * trans-mem.cc: ...here. * tree-affine.c: Moved to... * tree-affine.cc: ...here. * tree-call-cdce.c: Moved to... * tree-call-cdce.cc: ...here. * tree-cfg.c: Moved to... * tree-cfg.cc: ...here. * tree-cfgcleanup.c: Moved to... * tree-cfgcleanup.cc: ...here. * tree-chrec.c: Moved to... * tree-chrec.cc: ...here. * tree-complex.c: Moved to... * tree-complex.cc: ...here. * tree-data-ref.c: Moved to... * tree-data-ref.cc: ...here. * tree-dfa.c: Moved to... * tree-dfa.cc: ...here. * tree-diagnostic.c: Moved to... * tree-diagnostic.cc: ...here. * tree-dump.c: Moved to... * tree-dump.cc: ...here. * tree-eh.c: Moved to... * tree-eh.cc: ...here. * tree-emutls.c: Moved to... * tree-emutls.cc: ...here. * tree-if-conv.c: Moved to... * tree-if-conv.cc: ...here. * tree-inline.c: Moved to... * tree-inline.cc: ...here. * tree-into-ssa.c: Moved to... * tree-into-ssa.cc: ...here. * tree-iterator.c: Moved to... * tree-iterator.cc: ...here. * tree-loop-distribution.c: Moved to... * tree-loop-distribution.cc: ...here. * tree-nested.c: Moved to... * tree-nested.cc: ...here. * tree-nrv.c: Moved to... * tree-nrv.cc: ...here. * tree-object-size.c: Moved to... * tree-object-size.cc: ...here. * tree-outof-ssa.c: Moved to... * tree-outof-ssa.cc: ...here. * tree-parloops.c: Moved to... * tree-parloops.cc: ...here. * tree-phinodes.c: Moved to... * tree-phinodes.cc: ...here. * tree-predcom.c: Moved to... * tree-predcom.cc: ...here. * tree-pretty-print.c: Moved to... * tree-pretty-print.cc: ...here. * tree-profile.c: Moved to... * tree-profile.cc: ...here. * tree-scalar-evolution.c: Moved to... * tree-scalar-evolution.cc: ...here. * tree-sra.c: Moved to... * tree-sra.cc: ...here. * tree-ssa-address.c: Moved to... * tree-ssa-address.cc: ...here. * tree-ssa-alias.c: Moved to... * tree-ssa-alias.cc: ...here. * tree-ssa-ccp.c: Moved to... * tree-ssa-ccp.cc: ...here. * tree-ssa-coalesce.c: Moved to... * tree-ssa-coalesce.cc: ...here. * tree-ssa-copy.c: Moved to... * tree-ssa-copy.cc: ...here. * tree-ssa-dce.c: Moved to... * tree-ssa-dce.cc: ...here. * tree-ssa-dom.c: Moved to... * tree-ssa-dom.cc: ...here. * tree-ssa-dse.c: Moved to... * tree-ssa-dse.cc: ...here. * tree-ssa-forwprop.c: Moved to... * tree-ssa-forwprop.cc: ...here. * tree-ssa-ifcombine.c: Moved to... * tree-ssa-ifcombine.cc: ...here. * tree-ssa-live.c: Moved to... * tree-ssa-live.cc: ...here. * tree-ssa-loop-ch.c: Moved to... * tree-ssa-loop-ch.cc: ...here. * tree-ssa-loop-im.c: Moved to... * tree-ssa-loop-im.cc: ...here. * tree-ssa-loop-ivcanon.c: Moved to... * tree-ssa-loop-ivcanon.cc: ...here. * tree-ssa-loop-ivopts.c: Moved to... * tree-ssa-loop-ivopts.cc: ...here. * tree-ssa-loop-manip.c: Moved to... * tree-ssa-loop-manip.cc: ...here. * tree-ssa-loop-niter.c: Moved to... * tree-ssa-loop-niter.cc: ...here. * tree-ssa-loop-prefetch.c: Moved to... * tree-ssa-loop-prefetch.cc: ...here. * tree-ssa-loop-split.c: Moved to... * tree-ssa-loop-split.cc: ...here. * tree-ssa-loop-unswitch.c: Moved to... * tree-ssa-loop-unswitch.cc: ...here. * tree-ssa-loop.c: Moved to... * tree-ssa-loop.cc: ...here. * tree-ssa-math-opts.c: Moved to... * tree-ssa-math-opts.cc: ...here. * tree-ssa-operands.c: Moved to... * tree-ssa-operands.cc: ...here. * tree-ssa-phiopt.c: Moved to... * tree-ssa-phiopt.cc: ...here. * tree-ssa-phiprop.c: Moved to... * tree-ssa-phiprop.cc: ...here. * tree-ssa-pre.c: Moved to... * tree-ssa-pre.cc: ...here. * tree-ssa-propagate.c: Moved to... * tree-ssa-propagate.cc: ...here. * tree-ssa-reassoc.c: Moved to... * tree-ssa-reassoc.cc: ...here. * tree-ssa-sccvn.c: Moved to... * tree-ssa-sccvn.cc: ...here. * tree-ssa-scopedtables.c: Moved to... * tree-ssa-scopedtables.cc: ...here. * tree-ssa-sink.c: Moved to... * tree-ssa-sink.cc: ...here. * tree-ssa-strlen.c: Moved to... * tree-ssa-strlen.cc: ...here. * tree-ssa-structalias.c: Moved to... * tree-ssa-structalias.cc: ...here. * tree-ssa-tail-merge.c: Moved to... * tree-ssa-tail-merge.cc: ...here. * tree-ssa-ter.c: Moved to... * tree-ssa-ter.cc: ...here. * tree-ssa-threadbackward.c: Moved to... * tree-ssa-threadbackward.cc: ...here. * tree-ssa-threadedge.c: Moved to... * tree-ssa-threadedge.cc: ...here. * tree-ssa-threadupdate.c: Moved to... * tree-ssa-threadupdate.cc: ...here. * tree-ssa-uncprop.c: Moved to... * tree-ssa-uncprop.cc: ...here. * tree-ssa-uninit.c: Moved to... * tree-ssa-uninit.cc: ...here. * tree-ssa.c: Moved to... * tree-ssa.cc: ...here. * tree-ssanames.c: Moved to... * tree-ssanames.cc: ...here. * tree-stdarg.c: Moved to... * tree-stdarg.cc: ...here. * tree-streamer-in.c: Moved to... * tree-streamer-in.cc: ...here. * tree-streamer-out.c: Moved to... * tree-streamer-out.cc: ...here. * tree-streamer.c: Moved to... * tree-streamer.cc: ...here. * tree-switch-conversion.c: Moved to... * tree-switch-conversion.cc: ...here. * tree-tailcall.c: Moved to... * tree-tailcall.cc: ...here. * tree-vect-data-refs.c: Moved to... * tree-vect-data-refs.cc: ...here. * tree-vect-generic.c: Moved to... * tree-vect-generic.cc: ...here. * tree-vect-loop-manip.c: Moved to... * tree-vect-loop-manip.cc: ...here. * tree-vect-loop.c: Moved to... * tree-vect-loop.cc: ...here. * tree-vect-patterns.c: Moved to... * tree-vect-patterns.cc: ...here. * tree-vect-slp-patterns.c: Moved to... * tree-vect-slp-patterns.cc: ...here. * tree-vect-slp.c: Moved to... * tree-vect-slp.cc: ...here. * tree-vect-stmts.c: Moved to... * tree-vect-stmts.cc: ...here. * tree-vector-builder.c: Moved to... * tree-vector-builder.cc: ...here. * tree-vectorizer.c: Moved to... * tree-vectorizer.cc: ...here. * tree-vrp.c: Moved to... * tree-vrp.cc: ...here. * tree.c: Moved to... * tree.cc: ...here. * tsan.c: Moved to... * tsan.cc: ...here. * typed-splay-tree.c: Moved to... * typed-splay-tree.cc: ...here. * ubsan.c: Moved to... * ubsan.cc: ...here. * valtrack.c: Moved to... * valtrack.cc: ...here. * value-prof.c: Moved to... * value-prof.cc: ...here. * var-tracking.c: Moved to... * var-tracking.cc: ...here. * varasm.c: Moved to... * varasm.cc: ...here. * varpool.c: Moved to... * varpool.cc: ...here. * vec-perm-indices.c: Moved to... * vec-perm-indices.cc: ...here. * vec.c: Moved to... * vec.cc: ...here. * vmsdbgout.c: Moved to... * vmsdbgout.cc: ...here. * vr-values.c: Moved to... * vr-values.cc: ...here. * vtable-verify.c: Moved to... * vtable-verify.cc: ...here. * web.c: Moved to... * web.cc: ...here. * xcoffout.c: Moved to... * xcoffout.cc: ...here. gcc/c-family/ChangeLog: * c-ada-spec.c: Moved to... * c-ada-spec.cc: ...here. * c-attribs.c: Moved to... * c-attribs.cc: ...here. * c-common.c: Moved to... * c-common.cc: ...here. * c-cppbuiltin.c: Moved to... * c-cppbuiltin.cc: ...here. * c-dump.c: Moved to... * c-dump.cc: ...here. * c-format.c: Moved to... * c-format.cc: ...here. * c-gimplify.c: Moved to... * c-gimplify.cc: ...here. * c-indentation.c: Moved to... * c-indentation.cc: ...here. * c-lex.c: Moved to... * c-lex.cc: ...here. * c-omp.c: Moved to... * c-omp.cc: ...here. * c-opts.c: Moved to... * c-opts.cc: ...here. * c-pch.c: Moved to... * c-pch.cc: ...here. * c-ppoutput.c: Moved to... * c-ppoutput.cc: ...here. * c-pragma.c: Moved to... * c-pragma.cc: ...here. * c-pretty-print.c: Moved to... * c-pretty-print.cc: ...here. * c-semantics.c: Moved to... * c-semantics.cc: ...here. * c-ubsan.c: Moved to... * c-ubsan.cc: ...here. * c-warn.c: Moved to... * c-warn.cc: ...here. * cppspec.c: Moved to... * cppspec.cc: ...here. * stub-objc.c: Moved to... * stub-objc.cc: ...here. gcc/c/ChangeLog: * c-aux-info.c: Moved to... * c-aux-info.cc: ...here. * c-convert.c: Moved to... * c-convert.cc: ...here. * c-decl.c: Moved to... * c-decl.cc: ...here. * c-errors.c: Moved to... * c-errors.cc: ...here. * c-fold.c: Moved to... * c-fold.cc: ...here. * c-lang.c: Moved to... * c-lang.cc: ...here. * c-objc-common.c: Moved to... * c-objc-common.cc: ...here. * c-parser.c: Moved to... * c-parser.cc: ...here. * c-typeck.c: Moved to... * c-typeck.cc: ...here. * gccspec.c: Moved to... * gccspec.cc: ...here. * gimple-parser.c: Moved to... * gimple-parser.cc: ...here. gcc/cp/ChangeLog: * call.c: Moved to... * call.cc: ...here. * class.c: Moved to... * class.cc: ...here. * constexpr.c: Moved to... * constexpr.cc: ...here. * cp-gimplify.c: Moved to... * cp-gimplify.cc: ...here. * cp-lang.c: Moved to... * cp-lang.cc: ...here. * cp-objcp-common.c: Moved to... * cp-objcp-common.cc: ...here. * cp-ubsan.c: Moved to... * cp-ubsan.cc: ...here. * cvt.c: Moved to... * cvt.cc: ...here. * cxx-pretty-print.c: Moved to... * cxx-pretty-print.cc: ...here. * decl.c: Moved to... * decl.cc: ...here. * decl2.c: Moved to... * decl2.cc: ...here. * dump.c: Moved to... * dump.cc: ...here. * error.c: Moved to... * error.cc: ...here. * except.c: Moved to... * except.cc: ...here. * expr.c: Moved to... * expr.cc: ...here. * friend.c: Moved to... * friend.cc: ...here. * g++spec.c: Moved to... * g++spec.cc: ...here. * init.c: Moved to... * init.cc: ...here. * lambda.c: Moved to... * lambda.cc: ...here. * lex.c: Moved to... * lex.cc: ...here. * mangle.c: Moved to... * mangle.cc: ...here. * method.c: Moved to... * method.cc: ...here. * name-lookup.c: Moved to... * name-lookup.cc: ...here. * optimize.c: Moved to... * optimize.cc: ...here. * parser.c: Moved to... * parser.cc: ...here. * pt.c: Moved to... * pt.cc: ...here. * ptree.c: Moved to... * ptree.cc: ...here. * rtti.c: Moved to... * rtti.cc: ...here. * search.c: Moved to... * search.cc: ...here. * semantics.c: Moved to... * semantics.cc: ...here. * tree.c: Moved to... * tree.cc: ...here. * typeck.c: Moved to... * typeck.cc: ...here. * typeck2.c: Moved to... * typeck2.cc: ...here. * vtable-class-hierarchy.c: Moved to... * vtable-class-hierarchy.cc: ...here. gcc/fortran/ChangeLog: * arith.c: Moved to... * arith.cc: ...here. * array.c: Moved to... * array.cc: ...here. * bbt.c: Moved to... * bbt.cc: ...here. * check.c: Moved to... * check.cc: ...here. * class.c: Moved to... * class.cc: ...here. * constructor.c: Moved to... * constructor.cc: ...here. * convert.c: Moved to... * convert.cc: ...here. * cpp.c: Moved to... * cpp.cc: ...here. * data.c: Moved to... * data.cc: ...here. * decl.c: Moved to... * decl.cc: ...here. * dependency.c: Moved to... * dependency.cc: ...here. * dump-parse-tree.c: Moved to... * dump-parse-tree.cc: ...here. * error.c: Moved to... * error.cc: ...here. * expr.c: Moved to... * expr.cc: ...here. * f95-lang.c: Moved to... * f95-lang.cc: ...here. * frontend-passes.c: Moved to... * frontend-passes.cc: ...here. * gfortranspec.c: Moved to... * gfortranspec.cc: ...here. * interface.c: Moved to... * interface.cc: ...here. * intrinsic.c: Moved to... * intrinsic.cc: ...here. * io.c: Moved to... * io.cc: ...here. * iresolve.c: Moved to... * iresolve.cc: ...here. * match.c: Moved to... * match.cc: ...here. * matchexp.c: Moved to... * matchexp.cc: ...here. * misc.c: Moved to... * misc.cc: ...here. * module.c: Moved to... * module.cc: ...here. * openmp.c: Moved to... * openmp.cc: ...here. * options.c: Moved to... * options.cc: ...here. * parse.c: Moved to... * parse.cc: ...here. * primary.c: Moved to... * primary.cc: ...here. * resolve.c: Moved to... * resolve.cc: ...here. * scanner.c: Moved to... * scanner.cc: ...here. * simplify.c: Moved to... * simplify.cc: ...here. * st.c: Moved to... * st.cc: ...here. * symbol.c: Moved to... * symbol.cc: ...here. * target-memory.c: Moved to... * target-memory.cc: ...here. * trans-array.c: Moved to... * trans-array.cc: ...here. * trans-common.c: Moved to... * trans-common.cc: ...here. * trans-const.c: Moved to... * trans-const.cc: ...here. * trans-decl.c: Moved to... * trans-decl.cc: ...here. * trans-expr.c: Moved to... * trans-expr.cc: ...here. * trans-intrinsic.c: Moved to... * trans-intrinsic.cc: ...here. * trans-io.c: Moved to... * trans-io.cc: ...here. * trans-openmp.c: Moved to... * trans-openmp.cc: ...here. * trans-stmt.c: Moved to... * trans-stmt.cc: ...here. * trans-types.c: Moved to... * trans-types.cc: ...here. * trans.c: Moved to... * trans.cc: ...here. gcc/go/ChangeLog: * go-backend.c: Moved to... * go-backend.cc: ...here. * go-lang.c: Moved to... * go-lang.cc: ...here. * gospec.c: Moved to... * gospec.cc: ...here. gcc/jit/ChangeLog: * dummy-frontend.c: Moved to... * dummy-frontend.cc: ...here. * jit-builtins.c: Moved to... * jit-builtins.cc: ...here. * jit-logging.c: Moved to... * jit-logging.cc: ...here. * jit-playback.c: Moved to... * jit-playback.cc: ...here. * jit-recording.c: Moved to... * jit-recording.cc: ...here. * jit-result.c: Moved to... * jit-result.cc: ...here. * jit-spec.c: Moved to... * jit-spec.cc: ...here. * jit-tempdir.c: Moved to... * jit-tempdir.cc: ...here. * jit-w32.c: Moved to... * jit-w32.cc: ...here. * libgccjit.c: Moved to... * libgccjit.cc: ...here. gcc/lto/ChangeLog: * common.c: Moved to... * common.cc: ...here. * lto-common.c: Moved to... * lto-common.cc: ...here. * lto-dump.c: Moved to... * lto-dump.cc: ...here. * lto-lang.c: Moved to... * lto-lang.cc: ...here. * lto-object.c: Moved to... * lto-object.cc: ...here. * lto-partition.c: Moved to... * lto-partition.cc: ...here. * lto-symtab.c: Moved to... * lto-symtab.cc: ...here. * lto.c: Moved to... * lto.cc: ...here. gcc/objc/ChangeLog: * objc-act.c: Moved to... * objc-act.cc: ...here. * objc-encoding.c: Moved to... * objc-encoding.cc: ...here. * objc-gnu-runtime-abi-01.c: Moved to... * objc-gnu-runtime-abi-01.cc: ...here. * objc-lang.c: Moved to... * objc-lang.cc: ...here. * objc-map.c: Moved to... * objc-map.cc: ...here. * objc-next-runtime-abi-01.c: Moved to... * objc-next-runtime-abi-01.cc: ...here. * objc-next-runtime-abi-02.c: Moved to... * objc-next-runtime-abi-02.cc: ...here. * objc-runtime-shared-support.c: Moved to... * objc-runtime-shared-support.cc: ...here. gcc/objcp/ChangeLog: * objcp-decl.c: Moved to... * objcp-decl.cc: ...here. * objcp-lang.c: Moved to... * objcp-lang.cc: ...here. libcpp/ChangeLog: * charset.c: Moved to... * charset.cc: ...here. * directives.c: Moved to... * directives.cc: ...here. * errors.c: Moved to... * errors.cc: ...here. * expr.c: Moved to... * expr.cc: ...here. * files.c: Moved to... * files.cc: ...here. * identifiers.c: Moved to... * identifiers.cc: ...here. * init.c: Moved to... * init.cc: ...here. * lex.c: Moved to... * lex.cc: ...here. * line-map.c: Moved to... * line-map.cc: ...here. * macro.c: Moved to... * macro.cc: ...here. * makeucnid.c: Moved to... * makeucnid.cc: ...here. * mkdeps.c: Moved to... * mkdeps.cc: ...here. * pch.c: Moved to... * pch.cc: ...here. * symtab.c: Moved to... * symtab.cc: ...here. * traditional.c: Moved to... * traditional.cc: ...here.
Diffstat (limited to 'gcc/tree-ssa-forwprop.c')
-rw-r--r--gcc/tree-ssa-forwprop.c3865
1 files changed, 0 insertions, 3865 deletions
diff --git a/gcc/tree-ssa-forwprop.c b/gcc/tree-ssa-forwprop.c
deleted file mode 100644
index 709bde6..0000000
--- a/gcc/tree-ssa-forwprop.c
+++ /dev/null
@@ -1,3865 +0,0 @@
-/* Forward propagation of expressions for single use variables.
- Copyright (C) 2004-2022 Free Software Foundation, Inc.
-
-This file is part of GCC.
-
-GCC is free software; you can redistribute it and/or modify
-it under the terms of the GNU General Public License as published by
-the Free Software Foundation; either version 3, or (at your option)
-any later version.
-
-GCC is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-GNU General Public License for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-#include "config.h"
-#include "system.h"
-#include "coretypes.h"
-#include "backend.h"
-#include "rtl.h"
-#include "tree.h"
-#include "gimple.h"
-#include "cfghooks.h"
-#include "tree-pass.h"
-#include "ssa.h"
-#include "expmed.h"
-#include "optabs-query.h"
-#include "gimple-pretty-print.h"
-#include "fold-const.h"
-#include "stor-layout.h"
-#include "gimple-fold.h"
-#include "tree-eh.h"
-#include "gimplify.h"
-#include "gimple-iterator.h"
-#include "gimplify-me.h"
-#include "tree-cfg.h"
-#include "expr.h"
-#include "tree-dfa.h"
-#include "tree-ssa-propagate.h"
-#include "tree-ssa-dom.h"
-#include "builtins.h"
-#include "tree-cfgcleanup.h"
-#include "cfganal.h"
-#include "optabs-tree.h"
-#include "tree-vector-builder.h"
-#include "vec-perm-indices.h"
-#include "internal-fn.h"
-#include "cgraph.h"
-#include "tree-ssa.h"
-
-/* This pass propagates the RHS of assignment statements into use
- sites of the LHS of the assignment. It's basically a specialized
- form of tree combination. It is hoped all of this can disappear
- when we have a generalized tree combiner.
-
- One class of common cases we handle is forward propagating a single use
- variable into a COND_EXPR.
-
- bb0:
- x = a COND b;
- if (x) goto ... else goto ...
-
- Will be transformed into:
-
- bb0:
- if (a COND b) goto ... else goto ...
-
- Similarly for the tests (x == 0), (x != 0), (x == 1) and (x != 1).
-
- Or (assuming c1 and c2 are constants):
-
- bb0:
- x = a + c1;
- if (x EQ/NEQ c2) goto ... else goto ...
-
- Will be transformed into:
-
- bb0:
- if (a EQ/NEQ (c2 - c1)) goto ... else goto ...
-
- Similarly for x = a - c1.
-
- Or
-
- bb0:
- x = !a
- if (x) goto ... else goto ...
-
- Will be transformed into:
-
- bb0:
- if (a == 0) goto ... else goto ...
-
- Similarly for the tests (x == 0), (x != 0), (x == 1) and (x != 1).
- For these cases, we propagate A into all, possibly more than one,
- COND_EXPRs that use X.
-
- Or
-
- bb0:
- x = (typecast) a
- if (x) goto ... else goto ...
-
- Will be transformed into:
-
- bb0:
- if (a != 0) goto ... else goto ...
-
- (Assuming a is an integral type and x is a boolean or x is an
- integral and a is a boolean.)
-
- Similarly for the tests (x == 0), (x != 0), (x == 1) and (x != 1).
- For these cases, we propagate A into all, possibly more than one,
- COND_EXPRs that use X.
-
- In addition to eliminating the variable and the statement which assigns
- a value to the variable, we may be able to later thread the jump without
- adding insane complexity in the dominator optimizer.
-
- Also note these transformations can cascade. We handle this by having
- a worklist of COND_EXPR statements to examine. As we make a change to
- a statement, we put it back on the worklist to examine on the next
- iteration of the main loop.
-
- A second class of propagation opportunities arises for ADDR_EXPR
- nodes.
-
- ptr = &x->y->z;
- res = *ptr;
-
- Will get turned into
-
- res = x->y->z;
-
- Or
- ptr = (type1*)&type2var;
- res = *ptr
-
- Will get turned into (if type1 and type2 are the same size
- and neither have volatile on them):
- res = VIEW_CONVERT_EXPR<type1>(type2var)
-
- Or
-
- ptr = &x[0];
- ptr2 = ptr + <constant>;
-
- Will get turned into
-
- ptr2 = &x[constant/elementsize];
-
- Or
-
- ptr = &x[0];
- offset = index * element_size;
- offset_p = (pointer) offset;
- ptr2 = ptr + offset_p
-
- Will get turned into:
-
- ptr2 = &x[index];
-
- Or
- ssa = (int) decl
- res = ssa & 1
-
- Provided that decl has known alignment >= 2, will get turned into
-
- res = 0
-
- We also propagate casts into SWITCH_EXPR and COND_EXPR conditions to
- allow us to remove the cast and {NOT_EXPR,NEG_EXPR} into a subsequent
- {NOT_EXPR,NEG_EXPR}.
-
- This will (of course) be extended as other needs arise. */
-
-static bool forward_propagate_addr_expr (tree, tree, bool);
-
-/* Set to true if we delete dead edges during the optimization. */
-static bool cfg_changed;
-
-static tree rhs_to_tree (tree type, gimple *stmt);
-
-static bitmap to_purge;
-
-/* Const-and-copy lattice. */
-static vec<tree> lattice;
-
-/* Set the lattice entry for NAME to VAL. */
-static void
-fwprop_set_lattice_val (tree name, tree val)
-{
- if (TREE_CODE (name) == SSA_NAME)
- {
- if (SSA_NAME_VERSION (name) >= lattice.length ())
- {
- lattice.reserve (num_ssa_names - lattice.length ());
- lattice.quick_grow_cleared (num_ssa_names);
- }
- lattice[SSA_NAME_VERSION (name)] = val;
- }
-}
-
-/* Invalidate the lattice entry for NAME, done when releasing SSA names. */
-static void
-fwprop_invalidate_lattice (tree name)
-{
- if (name
- && TREE_CODE (name) == SSA_NAME
- && SSA_NAME_VERSION (name) < lattice.length ())
- lattice[SSA_NAME_VERSION (name)] = NULL_TREE;
-}
-
-
-/* Get the statement we can propagate from into NAME skipping
- trivial copies. Returns the statement which defines the
- propagation source or NULL_TREE if there is no such one.
- If SINGLE_USE_ONLY is set considers only sources which have
- a single use chain up to NAME. If SINGLE_USE_P is non-null,
- it is set to whether the chain to NAME is a single use chain
- or not. SINGLE_USE_P is not written to if SINGLE_USE_ONLY is set. */
-
-static gimple *
-get_prop_source_stmt (tree name, bool single_use_only, bool *single_use_p)
-{
- bool single_use = true;
-
- do {
- gimple *def_stmt = SSA_NAME_DEF_STMT (name);
-
- if (!has_single_use (name))
- {
- single_use = false;
- if (single_use_only)
- return NULL;
- }
-
- /* If name is defined by a PHI node or is the default def, bail out. */
- if (!is_gimple_assign (def_stmt))
- return NULL;
-
- /* If def_stmt is a simple copy, continue looking. */
- if (gimple_assign_rhs_code (def_stmt) == SSA_NAME)
- name = gimple_assign_rhs1 (def_stmt);
- else
- {
- if (!single_use_only && single_use_p)
- *single_use_p = single_use;
-
- return def_stmt;
- }
- } while (1);
-}
-
-/* Checks if the destination ssa name in DEF_STMT can be used as
- propagation source. Returns true if so, otherwise false. */
-
-static bool
-can_propagate_from (gimple *def_stmt)
-{
- gcc_assert (is_gimple_assign (def_stmt));
-
- /* If the rhs has side-effects we cannot propagate from it. */
- if (gimple_has_volatile_ops (def_stmt))
- return false;
-
- /* If the rhs is a load we cannot propagate from it. */
- if (TREE_CODE_CLASS (gimple_assign_rhs_code (def_stmt)) == tcc_reference
- || TREE_CODE_CLASS (gimple_assign_rhs_code (def_stmt)) == tcc_declaration)
- return false;
-
- /* Constants can be always propagated. */
- if (gimple_assign_single_p (def_stmt)
- && is_gimple_min_invariant (gimple_assign_rhs1 (def_stmt)))
- return true;
-
- /* We cannot propagate ssa names that occur in abnormal phi nodes. */
- if (stmt_references_abnormal_ssa_name (def_stmt))
- return false;
-
- /* If the definition is a conversion of a pointer to a function type,
- then we cannot apply optimizations as some targets require
- function pointers to be canonicalized and in this case this
- optimization could eliminate a necessary canonicalization. */
- if (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (def_stmt)))
- {
- tree rhs = gimple_assign_rhs1 (def_stmt);
- if (POINTER_TYPE_P (TREE_TYPE (rhs))
- && TREE_CODE (TREE_TYPE (TREE_TYPE (rhs))) == FUNCTION_TYPE)
- return false;
- }
-
- return true;
-}
-
-/* Remove a chain of dead statements starting at the definition of
- NAME. The chain is linked via the first operand of the defining statements.
- If NAME was replaced in its only use then this function can be used
- to clean up dead stmts. The function handles already released SSA
- names gracefully.
- Returns true if cleanup-cfg has to run. */
-
-static bool
-remove_prop_source_from_use (tree name)
-{
- gimple_stmt_iterator gsi;
- gimple *stmt;
- bool cfg_changed = false;
-
- do {
- basic_block bb;
-
- if (SSA_NAME_IN_FREE_LIST (name)
- || SSA_NAME_IS_DEFAULT_DEF (name)
- || !has_zero_uses (name))
- return cfg_changed;
-
- stmt = SSA_NAME_DEF_STMT (name);
- if (gimple_code (stmt) == GIMPLE_PHI
- || gimple_has_side_effects (stmt))
- return cfg_changed;
-
- bb = gimple_bb (stmt);
- gsi = gsi_for_stmt (stmt);
- unlink_stmt_vdef (stmt);
- if (gsi_remove (&gsi, true))
- bitmap_set_bit (to_purge, bb->index);
- fwprop_invalidate_lattice (gimple_get_lhs (stmt));
- release_defs (stmt);
-
- name = is_gimple_assign (stmt) ? gimple_assign_rhs1 (stmt) : NULL_TREE;
- } while (name && TREE_CODE (name) == SSA_NAME);
-
- return cfg_changed;
-}
-
-/* Return the rhs of a gassign *STMT in a form of a single tree,
- converted to type TYPE.
-
- This should disappear, but is needed so we can combine expressions and use
- the fold() interfaces. Long term, we need to develop folding and combine
- routines that deal with gimple exclusively . */
-
-static tree
-rhs_to_tree (tree type, gimple *stmt)
-{
- location_t loc = gimple_location (stmt);
- enum tree_code code = gimple_assign_rhs_code (stmt);
- switch (get_gimple_rhs_class (code))
- {
- case GIMPLE_TERNARY_RHS:
- return fold_build3_loc (loc, code, type, gimple_assign_rhs1 (stmt),
- gimple_assign_rhs2 (stmt),
- gimple_assign_rhs3 (stmt));
- case GIMPLE_BINARY_RHS:
- return fold_build2_loc (loc, code, type, gimple_assign_rhs1 (stmt),
- gimple_assign_rhs2 (stmt));
- case GIMPLE_UNARY_RHS:
- return build1 (code, type, gimple_assign_rhs1 (stmt));
- case GIMPLE_SINGLE_RHS:
- return gimple_assign_rhs1 (stmt);
- default:
- gcc_unreachable ();
- }
-}
-
-/* Combine OP0 CODE OP1 in the context of a COND_EXPR. Returns
- the folded result in a form suitable for COND_EXPR_COND or
- NULL_TREE, if there is no suitable simplified form. If
- INVARIANT_ONLY is true only gimple_min_invariant results are
- considered simplified. */
-
-static tree
-combine_cond_expr_cond (gimple *stmt, enum tree_code code, tree type,
- tree op0, tree op1, bool invariant_only)
-{
- tree t;
-
- gcc_assert (TREE_CODE_CLASS (code) == tcc_comparison);
-
- fold_defer_overflow_warnings ();
- t = fold_binary_loc (gimple_location (stmt), code, type, op0, op1);
- if (!t)
- {
- fold_undefer_overflow_warnings (false, NULL, 0);
- return NULL_TREE;
- }
-
- /* Require that we got a boolean type out if we put one in. */
- gcc_assert (TREE_CODE (TREE_TYPE (t)) == TREE_CODE (type));
-
- /* Canonicalize the combined condition for use in a COND_EXPR. */
- t = canonicalize_cond_expr_cond (t);
-
- /* Bail out if we required an invariant but didn't get one. */
- if (!t || (invariant_only && !is_gimple_min_invariant (t)))
- {
- fold_undefer_overflow_warnings (false, NULL, 0);
- return NULL_TREE;
- }
-
- bool nowarn = warning_suppressed_p (stmt, OPT_Wstrict_overflow);
- fold_undefer_overflow_warnings (!nowarn, stmt, 0);
-
- return t;
-}
-
-/* Combine the comparison OP0 CODE OP1 at LOC with the defining statements
- of its operand. Return a new comparison tree or NULL_TREE if there
- were no simplifying combines. */
-
-static tree
-forward_propagate_into_comparison_1 (gimple *stmt,
- enum tree_code code, tree type,
- tree op0, tree op1)
-{
- tree tmp = NULL_TREE;
- tree rhs0 = NULL_TREE, rhs1 = NULL_TREE;
- bool single_use0_p = false, single_use1_p = false;
-
- /* For comparisons use the first operand, that is likely to
- simplify comparisons against constants. */
- if (TREE_CODE (op0) == SSA_NAME)
- {
- gimple *def_stmt = get_prop_source_stmt (op0, false, &single_use0_p);
- if (def_stmt && can_propagate_from (def_stmt))
- {
- enum tree_code def_code = gimple_assign_rhs_code (def_stmt);
- bool invariant_only_p = !single_use0_p;
-
- rhs0 = rhs_to_tree (TREE_TYPE (op1), def_stmt);
-
- /* Always combine comparisons or conversions from booleans. */
- if (TREE_CODE (op1) == INTEGER_CST
- && ((CONVERT_EXPR_CODE_P (def_code)
- && TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs0, 0)))
- == BOOLEAN_TYPE)
- || TREE_CODE_CLASS (def_code) == tcc_comparison))
- invariant_only_p = false;
-
- tmp = combine_cond_expr_cond (stmt, code, type,
- rhs0, op1, invariant_only_p);
- if (tmp)
- return tmp;
- }
- }
-
- /* If that wasn't successful, try the second operand. */
- if (TREE_CODE (op1) == SSA_NAME)
- {
- gimple *def_stmt = get_prop_source_stmt (op1, false, &single_use1_p);
- if (def_stmt && can_propagate_from (def_stmt))
- {
- rhs1 = rhs_to_tree (TREE_TYPE (op0), def_stmt);
- tmp = combine_cond_expr_cond (stmt, code, type,
- op0, rhs1, !single_use1_p);
- if (tmp)
- return tmp;
- }
- }
-
- /* If that wasn't successful either, try both operands. */
- if (rhs0 != NULL_TREE
- && rhs1 != NULL_TREE)
- tmp = combine_cond_expr_cond (stmt, code, type,
- rhs0, rhs1,
- !(single_use0_p && single_use1_p));
-
- return tmp;
-}
-
-/* Propagate from the ssa name definition statements of the assignment
- from a comparison at *GSI into the conditional if that simplifies it.
- Returns 1 if the stmt was modified and 2 if the CFG needs cleanup,
- otherwise returns 0. */
-
-static int
-forward_propagate_into_comparison (gimple_stmt_iterator *gsi)
-{
- gimple *stmt = gsi_stmt (*gsi);
- tree tmp;
- bool cfg_changed = false;
- tree type = TREE_TYPE (gimple_assign_lhs (stmt));
- tree rhs1 = gimple_assign_rhs1 (stmt);
- tree rhs2 = gimple_assign_rhs2 (stmt);
-
- /* Combine the comparison with defining statements. */
- tmp = forward_propagate_into_comparison_1 (stmt,
- gimple_assign_rhs_code (stmt),
- type, rhs1, rhs2);
- if (tmp && useless_type_conversion_p (type, TREE_TYPE (tmp)))
- {
- gimple_assign_set_rhs_from_tree (gsi, tmp);
- fold_stmt (gsi);
- update_stmt (gsi_stmt (*gsi));
-
- if (TREE_CODE (rhs1) == SSA_NAME)
- cfg_changed |= remove_prop_source_from_use (rhs1);
- if (TREE_CODE (rhs2) == SSA_NAME)
- cfg_changed |= remove_prop_source_from_use (rhs2);
- return cfg_changed ? 2 : 1;
- }
-
- return 0;
-}
-
-/* Propagate from the ssa name definition statements of COND_EXPR
- in GIMPLE_COND statement STMT into the conditional if that simplifies it.
- Returns zero if no statement was changed, one if there were
- changes and two if cfg_cleanup needs to run.
-
- This must be kept in sync with forward_propagate_into_cond. */
-
-static int
-forward_propagate_into_gimple_cond (gcond *stmt)
-{
- tree tmp;
- enum tree_code code = gimple_cond_code (stmt);
- bool cfg_changed = false;
- tree rhs1 = gimple_cond_lhs (stmt);
- tree rhs2 = gimple_cond_rhs (stmt);
-
- /* We can do tree combining on SSA_NAME and comparison expressions. */
- if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison)
- return 0;
-
- tmp = forward_propagate_into_comparison_1 (stmt, code,
- boolean_type_node,
- rhs1, rhs2);
- if (tmp
- && is_gimple_condexpr_for_cond (tmp))
- {
- if (dump_file)
- {
- fprintf (dump_file, " Replaced '");
- print_gimple_expr (dump_file, stmt, 0);
- fprintf (dump_file, "' with '");
- print_generic_expr (dump_file, tmp);
- fprintf (dump_file, "'\n");
- }
-
- gimple_cond_set_condition_from_tree (stmt, unshare_expr (tmp));
- update_stmt (stmt);
-
- if (TREE_CODE (rhs1) == SSA_NAME)
- cfg_changed |= remove_prop_source_from_use (rhs1);
- if (TREE_CODE (rhs2) == SSA_NAME)
- cfg_changed |= remove_prop_source_from_use (rhs2);
- return (cfg_changed || is_gimple_min_invariant (tmp)) ? 2 : 1;
- }
-
- /* Canonicalize _Bool == 0 and _Bool != 1 to _Bool != 0 by swapping edges. */
- if ((TREE_CODE (TREE_TYPE (rhs1)) == BOOLEAN_TYPE
- || (INTEGRAL_TYPE_P (TREE_TYPE (rhs1))
- && TYPE_PRECISION (TREE_TYPE (rhs1)) == 1))
- && ((code == EQ_EXPR
- && integer_zerop (rhs2))
- || (code == NE_EXPR
- && integer_onep (rhs2))))
- {
- basic_block bb = gimple_bb (stmt);
- gimple_cond_set_code (stmt, NE_EXPR);
- gimple_cond_set_rhs (stmt, build_zero_cst (TREE_TYPE (rhs1)));
- EDGE_SUCC (bb, 0)->flags ^= (EDGE_TRUE_VALUE|EDGE_FALSE_VALUE);
- EDGE_SUCC (bb, 1)->flags ^= (EDGE_TRUE_VALUE|EDGE_FALSE_VALUE);
- return 1;
- }
-
- return 0;
-}
-
-
-/* Propagate from the ssa name definition statements of COND_EXPR
- in the rhs of statement STMT into the conditional if that simplifies it.
- Returns true zero if the stmt was changed. */
-
-static bool
-forward_propagate_into_cond (gimple_stmt_iterator *gsi_p)
-{
- gimple *stmt = gsi_stmt (*gsi_p);
- tree tmp = NULL_TREE;
- tree cond = gimple_assign_rhs1 (stmt);
- enum tree_code code = gimple_assign_rhs_code (stmt);
-
- /* We can do tree combining on SSA_NAME and comparison expressions. */
- if (COMPARISON_CLASS_P (cond))
- tmp = forward_propagate_into_comparison_1 (stmt, TREE_CODE (cond),
- TREE_TYPE (cond),
- TREE_OPERAND (cond, 0),
- TREE_OPERAND (cond, 1));
- else if (TREE_CODE (cond) == SSA_NAME)
- {
- enum tree_code def_code;
- tree name = cond;
- gimple *def_stmt = get_prop_source_stmt (name, true, NULL);
- if (!def_stmt || !can_propagate_from (def_stmt))
- return 0;
-
- def_code = gimple_assign_rhs_code (def_stmt);
- if (TREE_CODE_CLASS (def_code) == tcc_comparison)
- tmp = fold_build2_loc (gimple_location (def_stmt),
- def_code,
- TREE_TYPE (cond),
- gimple_assign_rhs1 (def_stmt),
- gimple_assign_rhs2 (def_stmt));
- }
-
- if (tmp
- && is_gimple_condexpr (tmp))
- {
- if (dump_file)
- {
- fprintf (dump_file, " Replaced '");
- print_generic_expr (dump_file, cond);
- fprintf (dump_file, "' with '");
- print_generic_expr (dump_file, tmp);
- fprintf (dump_file, "'\n");
- }
-
- if ((code == VEC_COND_EXPR) ? integer_all_onesp (tmp)
- : integer_onep (tmp))
- gimple_assign_set_rhs_from_tree (gsi_p, gimple_assign_rhs2 (stmt));
- else if (integer_zerop (tmp))
- gimple_assign_set_rhs_from_tree (gsi_p, gimple_assign_rhs3 (stmt));
- else
- gimple_assign_set_rhs1 (stmt, unshare_expr (tmp));
- stmt = gsi_stmt (*gsi_p);
- update_stmt (stmt);
-
- return true;
- }
-
- return 0;
-}
-
-/* We've just substituted an ADDR_EXPR into stmt. Update all the
- relevant data structures to match. */
-
-static void
-tidy_after_forward_propagate_addr (gimple *stmt)
-{
- /* We may have turned a trapping insn into a non-trapping insn. */
- if (maybe_clean_or_replace_eh_stmt (stmt, stmt))
- bitmap_set_bit (to_purge, gimple_bb (stmt)->index);
-
- if (TREE_CODE (gimple_assign_rhs1 (stmt)) == ADDR_EXPR)
- recompute_tree_invariant_for_addr_expr (gimple_assign_rhs1 (stmt));
-}
-
-/* NAME is a SSA_NAME representing DEF_RHS which is of the form
- ADDR_EXPR <whatever>.
-
- Try to forward propagate the ADDR_EXPR into the use USE_STMT.
- Often this will allow for removal of an ADDR_EXPR and INDIRECT_REF
- node or for recovery of array indexing from pointer arithmetic.
-
- Return true if the propagation was successful (the propagation can
- be not totally successful, yet things may have been changed). */
-
-static bool
-forward_propagate_addr_expr_1 (tree name, tree def_rhs,
- gimple_stmt_iterator *use_stmt_gsi,
- bool single_use_p)
-{
- tree lhs, rhs, rhs2, array_ref;
- gimple *use_stmt = gsi_stmt (*use_stmt_gsi);
- enum tree_code rhs_code;
- bool res = true;
-
- gcc_assert (TREE_CODE (def_rhs) == ADDR_EXPR);
-
- lhs = gimple_assign_lhs (use_stmt);
- rhs_code = gimple_assign_rhs_code (use_stmt);
- rhs = gimple_assign_rhs1 (use_stmt);
-
- /* Do not perform copy-propagation but recurse through copy chains. */
- if (TREE_CODE (lhs) == SSA_NAME
- && rhs_code == SSA_NAME)
- return forward_propagate_addr_expr (lhs, def_rhs, single_use_p);
-
- /* The use statement could be a conversion. Recurse to the uses of the
- lhs as copyprop does not copy through pointer to integer to pointer
- conversions and FRE does not catch all cases either.
- Treat the case of a single-use name and
- a conversion to def_rhs type separate, though. */
- if (TREE_CODE (lhs) == SSA_NAME
- && CONVERT_EXPR_CODE_P (rhs_code))
- {
- /* If there is a point in a conversion chain where the types match
- so we can remove a conversion re-materialize the address here
- and stop. */
- if (single_use_p
- && useless_type_conversion_p (TREE_TYPE (lhs), TREE_TYPE (def_rhs)))
- {
- gimple_assign_set_rhs1 (use_stmt, unshare_expr (def_rhs));
- gimple_assign_set_rhs_code (use_stmt, TREE_CODE (def_rhs));
- return true;
- }
-
- /* Else recurse if the conversion preserves the address value. */
- if ((INTEGRAL_TYPE_P (TREE_TYPE (lhs))
- || POINTER_TYPE_P (TREE_TYPE (lhs)))
- && (TYPE_PRECISION (TREE_TYPE (lhs))
- >= TYPE_PRECISION (TREE_TYPE (def_rhs))))
- return forward_propagate_addr_expr (lhs, def_rhs, single_use_p);
-
- return false;
- }
-
- /* If this isn't a conversion chain from this on we only can propagate
- into compatible pointer contexts. */
- if (!types_compatible_p (TREE_TYPE (name), TREE_TYPE (def_rhs)))
- return false;
-
- /* Propagate through constant pointer adjustments. */
- if (TREE_CODE (lhs) == SSA_NAME
- && rhs_code == POINTER_PLUS_EXPR
- && rhs == name
- && TREE_CODE (gimple_assign_rhs2 (use_stmt)) == INTEGER_CST)
- {
- tree new_def_rhs;
- /* As we come here with non-invariant addresses in def_rhs we need
- to make sure we can build a valid constant offsetted address
- for further propagation. Simply rely on fold building that
- and check after the fact. */
- new_def_rhs = fold_build2 (MEM_REF, TREE_TYPE (TREE_TYPE (rhs)),
- def_rhs,
- fold_convert (ptr_type_node,
- gimple_assign_rhs2 (use_stmt)));
- if (TREE_CODE (new_def_rhs) == MEM_REF
- && !is_gimple_mem_ref_addr (TREE_OPERAND (new_def_rhs, 0)))
- return false;
- new_def_rhs = build1 (ADDR_EXPR, TREE_TYPE (rhs), new_def_rhs);
-
- /* Recurse. If we could propagate into all uses of lhs do not
- bother to replace into the current use but just pretend we did. */
- if (forward_propagate_addr_expr (lhs, new_def_rhs, single_use_p))
- return true;
-
- if (useless_type_conversion_p (TREE_TYPE (lhs),
- TREE_TYPE (new_def_rhs)))
- gimple_assign_set_rhs_with_ops (use_stmt_gsi, TREE_CODE (new_def_rhs),
- new_def_rhs);
- else if (is_gimple_min_invariant (new_def_rhs))
- gimple_assign_set_rhs_with_ops (use_stmt_gsi, NOP_EXPR, new_def_rhs);
- else
- return false;
- gcc_assert (gsi_stmt (*use_stmt_gsi) == use_stmt);
- update_stmt (use_stmt);
- return true;
- }
-
- /* Now strip away any outer COMPONENT_REF/ARRAY_REF nodes from the LHS.
- ADDR_EXPR will not appear on the LHS. */
- tree *lhsp = gimple_assign_lhs_ptr (use_stmt);
- while (handled_component_p (*lhsp))
- lhsp = &TREE_OPERAND (*lhsp, 0);
- lhs = *lhsp;
-
- /* Now see if the LHS node is a MEM_REF using NAME. If so,
- propagate the ADDR_EXPR into the use of NAME and fold the result. */
- if (TREE_CODE (lhs) == MEM_REF
- && TREE_OPERAND (lhs, 0) == name)
- {
- tree def_rhs_base;
- poly_int64 def_rhs_offset;
- /* If the address is invariant we can always fold it. */
- if ((def_rhs_base = get_addr_base_and_unit_offset (TREE_OPERAND (def_rhs, 0),
- &def_rhs_offset)))
- {
- poly_offset_int off = mem_ref_offset (lhs);
- tree new_ptr;
- off += def_rhs_offset;
- if (TREE_CODE (def_rhs_base) == MEM_REF)
- {
- off += mem_ref_offset (def_rhs_base);
- new_ptr = TREE_OPERAND (def_rhs_base, 0);
- }
- else
- new_ptr = build_fold_addr_expr (def_rhs_base);
- TREE_OPERAND (lhs, 0) = new_ptr;
- TREE_OPERAND (lhs, 1)
- = wide_int_to_tree (TREE_TYPE (TREE_OPERAND (lhs, 1)), off);
- tidy_after_forward_propagate_addr (use_stmt);
- /* Continue propagating into the RHS if this was not the only use. */
- if (single_use_p)
- return true;
- }
- /* If the LHS is a plain dereference and the value type is the same as
- that of the pointed-to type of the address we can put the
- dereferenced address on the LHS preserving the original alias-type. */
- else if (integer_zerop (TREE_OPERAND (lhs, 1))
- && ((gimple_assign_lhs (use_stmt) == lhs
- && useless_type_conversion_p
- (TREE_TYPE (TREE_OPERAND (def_rhs, 0)),
- TREE_TYPE (gimple_assign_rhs1 (use_stmt))))
- || types_compatible_p (TREE_TYPE (lhs),
- TREE_TYPE (TREE_OPERAND (def_rhs, 0))))
- /* Don't forward anything into clobber stmts if it would result
- in the lhs no longer being a MEM_REF. */
- && (!gimple_clobber_p (use_stmt)
- || TREE_CODE (TREE_OPERAND (def_rhs, 0)) == MEM_REF))
- {
- tree *def_rhs_basep = &TREE_OPERAND (def_rhs, 0);
- tree new_offset, new_base, saved, new_lhs;
- while (handled_component_p (*def_rhs_basep))
- def_rhs_basep = &TREE_OPERAND (*def_rhs_basep, 0);
- saved = *def_rhs_basep;
- if (TREE_CODE (*def_rhs_basep) == MEM_REF)
- {
- new_base = TREE_OPERAND (*def_rhs_basep, 0);
- new_offset = fold_convert (TREE_TYPE (TREE_OPERAND (lhs, 1)),
- TREE_OPERAND (*def_rhs_basep, 1));
- }
- else
- {
- new_base = build_fold_addr_expr (*def_rhs_basep);
- new_offset = TREE_OPERAND (lhs, 1);
- }
- *def_rhs_basep = build2 (MEM_REF, TREE_TYPE (*def_rhs_basep),
- new_base, new_offset);
- TREE_THIS_VOLATILE (*def_rhs_basep) = TREE_THIS_VOLATILE (lhs);
- TREE_SIDE_EFFECTS (*def_rhs_basep) = TREE_SIDE_EFFECTS (lhs);
- TREE_THIS_NOTRAP (*def_rhs_basep) = TREE_THIS_NOTRAP (lhs);
- new_lhs = unshare_expr (TREE_OPERAND (def_rhs, 0));
- *lhsp = new_lhs;
- TREE_THIS_VOLATILE (new_lhs) = TREE_THIS_VOLATILE (lhs);
- TREE_SIDE_EFFECTS (new_lhs) = TREE_SIDE_EFFECTS (lhs);
- *def_rhs_basep = saved;
- tidy_after_forward_propagate_addr (use_stmt);
- /* Continue propagating into the RHS if this was not the
- only use. */
- if (single_use_p)
- return true;
- }
- else
- /* We can have a struct assignment dereferencing our name twice.
- Note that we didn't propagate into the lhs to not falsely
- claim we did when propagating into the rhs. */
- res = false;
- }
-
- /* Strip away any outer COMPONENT_REF, ARRAY_REF or ADDR_EXPR
- nodes from the RHS. */
- tree *rhsp = gimple_assign_rhs1_ptr (use_stmt);
- if (TREE_CODE (*rhsp) == ADDR_EXPR)
- rhsp = &TREE_OPERAND (*rhsp, 0);
- while (handled_component_p (*rhsp))
- rhsp = &TREE_OPERAND (*rhsp, 0);
- rhs = *rhsp;
-
- /* Now see if the RHS node is a MEM_REF using NAME. If so,
- propagate the ADDR_EXPR into the use of NAME and fold the result. */
- if (TREE_CODE (rhs) == MEM_REF
- && TREE_OPERAND (rhs, 0) == name)
- {
- tree def_rhs_base;
- poly_int64 def_rhs_offset;
- if ((def_rhs_base = get_addr_base_and_unit_offset (TREE_OPERAND (def_rhs, 0),
- &def_rhs_offset)))
- {
- poly_offset_int off = mem_ref_offset (rhs);
- tree new_ptr;
- off += def_rhs_offset;
- if (TREE_CODE (def_rhs_base) == MEM_REF)
- {
- off += mem_ref_offset (def_rhs_base);
- new_ptr = TREE_OPERAND (def_rhs_base, 0);
- }
- else
- new_ptr = build_fold_addr_expr (def_rhs_base);
- TREE_OPERAND (rhs, 0) = new_ptr;
- TREE_OPERAND (rhs, 1)
- = wide_int_to_tree (TREE_TYPE (TREE_OPERAND (rhs, 1)), off);
- fold_stmt_inplace (use_stmt_gsi);
- tidy_after_forward_propagate_addr (use_stmt);
- return res;
- }
- /* If the RHS is a plain dereference and the value type is the same as
- that of the pointed-to type of the address we can put the
- dereferenced address on the RHS preserving the original alias-type. */
- else if (integer_zerop (TREE_OPERAND (rhs, 1))
- && ((gimple_assign_rhs1 (use_stmt) == rhs
- && useless_type_conversion_p
- (TREE_TYPE (gimple_assign_lhs (use_stmt)),
- TREE_TYPE (TREE_OPERAND (def_rhs, 0))))
- || types_compatible_p (TREE_TYPE (rhs),
- TREE_TYPE (TREE_OPERAND (def_rhs, 0)))))
- {
- tree *def_rhs_basep = &TREE_OPERAND (def_rhs, 0);
- tree new_offset, new_base, saved, new_rhs;
- while (handled_component_p (*def_rhs_basep))
- def_rhs_basep = &TREE_OPERAND (*def_rhs_basep, 0);
- saved = *def_rhs_basep;
- if (TREE_CODE (*def_rhs_basep) == MEM_REF)
- {
- new_base = TREE_OPERAND (*def_rhs_basep, 0);
- new_offset = fold_convert (TREE_TYPE (TREE_OPERAND (rhs, 1)),
- TREE_OPERAND (*def_rhs_basep, 1));
- }
- else
- {
- new_base = build_fold_addr_expr (*def_rhs_basep);
- new_offset = TREE_OPERAND (rhs, 1);
- }
- *def_rhs_basep = build2 (MEM_REF, TREE_TYPE (*def_rhs_basep),
- new_base, new_offset);
- TREE_THIS_VOLATILE (*def_rhs_basep) = TREE_THIS_VOLATILE (rhs);
- TREE_SIDE_EFFECTS (*def_rhs_basep) = TREE_SIDE_EFFECTS (rhs);
- TREE_THIS_NOTRAP (*def_rhs_basep) = TREE_THIS_NOTRAP (rhs);
- new_rhs = unshare_expr (TREE_OPERAND (def_rhs, 0));
- *rhsp = new_rhs;
- TREE_THIS_VOLATILE (new_rhs) = TREE_THIS_VOLATILE (rhs);
- TREE_SIDE_EFFECTS (new_rhs) = TREE_SIDE_EFFECTS (rhs);
- *def_rhs_basep = saved;
- fold_stmt_inplace (use_stmt_gsi);
- tidy_after_forward_propagate_addr (use_stmt);
- return res;
- }
- }
-
- /* If the use of the ADDR_EXPR is not a POINTER_PLUS_EXPR, there
- is nothing to do. */
- if (gimple_assign_rhs_code (use_stmt) != POINTER_PLUS_EXPR
- || gimple_assign_rhs1 (use_stmt) != name)
- return false;
-
- /* The remaining cases are all for turning pointer arithmetic into
- array indexing. They only apply when we have the address of
- element zero in an array. If that is not the case then there
- is nothing to do. */
- array_ref = TREE_OPERAND (def_rhs, 0);
- if ((TREE_CODE (array_ref) != ARRAY_REF
- || TREE_CODE (TREE_TYPE (TREE_OPERAND (array_ref, 0))) != ARRAY_TYPE
- || TREE_CODE (TREE_OPERAND (array_ref, 1)) != INTEGER_CST)
- && TREE_CODE (TREE_TYPE (array_ref)) != ARRAY_TYPE)
- return false;
-
- rhs2 = gimple_assign_rhs2 (use_stmt);
- /* Optimize &x[C1] p+ C2 to &x p+ C3 with C3 = C1 * element_size + C2. */
- if (TREE_CODE (rhs2) == INTEGER_CST)
- {
- tree new_rhs = build1_loc (gimple_location (use_stmt),
- ADDR_EXPR, TREE_TYPE (def_rhs),
- fold_build2 (MEM_REF,
- TREE_TYPE (TREE_TYPE (def_rhs)),
- unshare_expr (def_rhs),
- fold_convert (ptr_type_node,
- rhs2)));
- gimple_assign_set_rhs_from_tree (use_stmt_gsi, new_rhs);
- use_stmt = gsi_stmt (*use_stmt_gsi);
- update_stmt (use_stmt);
- tidy_after_forward_propagate_addr (use_stmt);
- return true;
- }
-
- return false;
-}
-
-/* STMT is a statement of the form SSA_NAME = ADDR_EXPR <whatever>.
-
- Try to forward propagate the ADDR_EXPR into all uses of the SSA_NAME.
- Often this will allow for removal of an ADDR_EXPR and INDIRECT_REF
- node or for recovery of array indexing from pointer arithmetic.
-
- PARENT_SINGLE_USE_P tells if, when in a recursive invocation, NAME was
- the single use in the previous invocation. Pass true when calling
- this as toplevel.
-
- Returns true, if all uses have been propagated into. */
-
-static bool
-forward_propagate_addr_expr (tree name, tree rhs, bool parent_single_use_p)
-{
- imm_use_iterator iter;
- gimple *use_stmt;
- bool all = true;
- bool single_use_p = parent_single_use_p && has_single_use (name);
-
- FOR_EACH_IMM_USE_STMT (use_stmt, iter, name)
- {
- bool result;
- tree use_rhs;
-
- /* If the use is not in a simple assignment statement, then
- there is nothing we can do. */
- if (!is_gimple_assign (use_stmt))
- {
- if (!is_gimple_debug (use_stmt))
- all = false;
- continue;
- }
-
- gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt);
- result = forward_propagate_addr_expr_1 (name, rhs, &gsi,
- single_use_p);
- /* If the use has moved to a different statement adjust
- the update machinery for the old statement too. */
- if (use_stmt != gsi_stmt (gsi))
- {
- update_stmt (use_stmt);
- use_stmt = gsi_stmt (gsi);
- }
- update_stmt (use_stmt);
- all &= result;
-
- /* Remove intermediate now unused copy and conversion chains. */
- use_rhs = gimple_assign_rhs1 (use_stmt);
- if (result
- && TREE_CODE (gimple_assign_lhs (use_stmt)) == SSA_NAME
- && TREE_CODE (use_rhs) == SSA_NAME
- && has_zero_uses (gimple_assign_lhs (use_stmt)))
- {
- gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt);
- fwprop_invalidate_lattice (gimple_get_lhs (use_stmt));
- release_defs (use_stmt);
- gsi_remove (&gsi, true);
- }
- }
-
- return all && has_zero_uses (name);
-}
-
-
-/* Helper function for simplify_gimple_switch. Remove case labels that
- have values outside the range of the new type. */
-
-static void
-simplify_gimple_switch_label_vec (gswitch *stmt, tree index_type)
-{
- unsigned int branch_num = gimple_switch_num_labels (stmt);
- auto_vec<tree> labels (branch_num);
- unsigned int i, len;
-
- /* Collect the existing case labels in a VEC, and preprocess it as if
- we are gimplifying a GENERIC SWITCH_EXPR. */
- for (i = 1; i < branch_num; i++)
- labels.quick_push (gimple_switch_label (stmt, i));
- preprocess_case_label_vec_for_gimple (labels, index_type, NULL);
-
- /* If any labels were removed, replace the existing case labels
- in the GIMPLE_SWITCH statement with the correct ones.
- Note that the type updates were done in-place on the case labels,
- so we only have to replace the case labels in the GIMPLE_SWITCH
- if the number of labels changed. */
- len = labels.length ();
- if (len < branch_num - 1)
- {
- bitmap target_blocks;
- edge_iterator ei;
- edge e;
-
- /* Corner case: *all* case labels have been removed as being
- out-of-range for INDEX_TYPE. Push one label and let the
- CFG cleanups deal with this further. */
- if (len == 0)
- {
- tree label, elt;
-
- label = CASE_LABEL (gimple_switch_default_label (stmt));
- elt = build_case_label (build_int_cst (index_type, 0), NULL, label);
- labels.quick_push (elt);
- len = 1;
- }
-
- for (i = 0; i < labels.length (); i++)
- gimple_switch_set_label (stmt, i + 1, labels[i]);
- for (i++ ; i < branch_num; i++)
- gimple_switch_set_label (stmt, i, NULL_TREE);
- gimple_switch_set_num_labels (stmt, len + 1);
-
- /* Cleanup any edges that are now dead. */
- target_blocks = BITMAP_ALLOC (NULL);
- for (i = 0; i < gimple_switch_num_labels (stmt); i++)
- {
- tree elt = gimple_switch_label (stmt, i);
- basic_block target = label_to_block (cfun, CASE_LABEL (elt));
- bitmap_set_bit (target_blocks, target->index);
- }
- for (ei = ei_start (gimple_bb (stmt)->succs); (e = ei_safe_edge (ei)); )
- {
- if (! bitmap_bit_p (target_blocks, e->dest->index))
- {
- remove_edge (e);
- cfg_changed = true;
- free_dominance_info (CDI_DOMINATORS);
- }
- else
- ei_next (&ei);
- }
- BITMAP_FREE (target_blocks);
- }
-}
-
-/* STMT is a SWITCH_EXPR for which we attempt to find equivalent forms of
- the condition which we may be able to optimize better. */
-
-static bool
-simplify_gimple_switch (gswitch *stmt)
-{
- /* The optimization that we really care about is removing unnecessary
- casts. That will let us do much better in propagating the inferred
- constant at the switch target. */
- tree cond = gimple_switch_index (stmt);
- if (TREE_CODE (cond) == SSA_NAME)
- {
- gimple *def_stmt = SSA_NAME_DEF_STMT (cond);
- if (gimple_assign_cast_p (def_stmt))
- {
- tree def = gimple_assign_rhs1 (def_stmt);
- if (TREE_CODE (def) != SSA_NAME)
- return false;
-
- /* If we have an extension or sign-change that preserves the
- values we check against then we can copy the source value into
- the switch. */
- tree ti = TREE_TYPE (def);
- if (INTEGRAL_TYPE_P (ti)
- && TYPE_PRECISION (ti) <= TYPE_PRECISION (TREE_TYPE (cond)))
- {
- size_t n = gimple_switch_num_labels (stmt);
- tree min = NULL_TREE, max = NULL_TREE;
- if (n > 1)
- {
- min = CASE_LOW (gimple_switch_label (stmt, 1));
- if (CASE_HIGH (gimple_switch_label (stmt, n - 1)))
- max = CASE_HIGH (gimple_switch_label (stmt, n - 1));
- else
- max = CASE_LOW (gimple_switch_label (stmt, n - 1));
- }
- if ((!min || int_fits_type_p (min, ti))
- && (!max || int_fits_type_p (max, ti)))
- {
- gimple_switch_set_index (stmt, def);
- simplify_gimple_switch_label_vec (stmt, ti);
- update_stmt (stmt);
- return true;
- }
- }
- }
- }
-
- return false;
-}
-
-/* For pointers p2 and p1 return p2 - p1 if the
- difference is known and constant, otherwise return NULL. */
-
-static tree
-constant_pointer_difference (tree p1, tree p2)
-{
- int i, j;
-#define CPD_ITERATIONS 5
- tree exps[2][CPD_ITERATIONS];
- tree offs[2][CPD_ITERATIONS];
- int cnt[2];
-
- for (i = 0; i < 2; i++)
- {
- tree p = i ? p1 : p2;
- tree off = size_zero_node;
- gimple *stmt;
- enum tree_code code;
-
- /* For each of p1 and p2 we need to iterate at least
- twice, to handle ADDR_EXPR directly in p1/p2,
- SSA_NAME with ADDR_EXPR or POINTER_PLUS_EXPR etc.
- on definition's stmt RHS. Iterate a few extra times. */
- j = 0;
- do
- {
- if (!POINTER_TYPE_P (TREE_TYPE (p)))
- break;
- if (TREE_CODE (p) == ADDR_EXPR)
- {
- tree q = TREE_OPERAND (p, 0);
- poly_int64 offset;
- tree base = get_addr_base_and_unit_offset (q, &offset);
- if (base)
- {
- q = base;
- if (maybe_ne (offset, 0))
- off = size_binop (PLUS_EXPR, off, size_int (offset));
- }
- if (TREE_CODE (q) == MEM_REF
- && TREE_CODE (TREE_OPERAND (q, 0)) == SSA_NAME)
- {
- p = TREE_OPERAND (q, 0);
- off = size_binop (PLUS_EXPR, off,
- wide_int_to_tree (sizetype,
- mem_ref_offset (q)));
- }
- else
- {
- exps[i][j] = q;
- offs[i][j++] = off;
- break;
- }
- }
- if (TREE_CODE (p) != SSA_NAME)
- break;
- exps[i][j] = p;
- offs[i][j++] = off;
- if (j == CPD_ITERATIONS)
- break;
- stmt = SSA_NAME_DEF_STMT (p);
- if (!is_gimple_assign (stmt) || gimple_assign_lhs (stmt) != p)
- break;
- code = gimple_assign_rhs_code (stmt);
- if (code == POINTER_PLUS_EXPR)
- {
- if (TREE_CODE (gimple_assign_rhs2 (stmt)) != INTEGER_CST)
- break;
- off = size_binop (PLUS_EXPR, off, gimple_assign_rhs2 (stmt));
- p = gimple_assign_rhs1 (stmt);
- }
- else if (code == ADDR_EXPR || CONVERT_EXPR_CODE_P (code))
- p = gimple_assign_rhs1 (stmt);
- else
- break;
- }
- while (1);
- cnt[i] = j;
- }
-
- for (i = 0; i < cnt[0]; i++)
- for (j = 0; j < cnt[1]; j++)
- if (exps[0][i] == exps[1][j])
- return size_binop (MINUS_EXPR, offs[0][i], offs[1][j]);
-
- return NULL_TREE;
-}
-
-/* *GSI_P is a GIMPLE_CALL to a builtin function.
- Optimize
- memcpy (p, "abcd", 4);
- memset (p + 4, ' ', 3);
- into
- memcpy (p, "abcd ", 7);
- call if the latter can be stored by pieces during expansion.
-
- Also canonicalize __atomic_fetch_op (p, x, y) op x
- to __atomic_op_fetch (p, x, y) or
- __atomic_op_fetch (p, x, y) iop x
- to __atomic_fetch_op (p, x, y) when possible (also __sync). */
-
-static bool
-simplify_builtin_call (gimple_stmt_iterator *gsi_p, tree callee2)
-{
- gimple *stmt1, *stmt2 = gsi_stmt (*gsi_p);
- enum built_in_function other_atomic = END_BUILTINS;
- enum tree_code atomic_op = ERROR_MARK;
- tree vuse = gimple_vuse (stmt2);
- if (vuse == NULL)
- return false;
- stmt1 = SSA_NAME_DEF_STMT (vuse);
-
- switch (DECL_FUNCTION_CODE (callee2))
- {
- case BUILT_IN_MEMSET:
- if (gimple_call_num_args (stmt2) != 3
- || gimple_call_lhs (stmt2)
- || CHAR_BIT != 8
- || BITS_PER_UNIT != 8)
- break;
- else
- {
- tree callee1;
- tree ptr1, src1, str1, off1, len1, lhs1;
- tree ptr2 = gimple_call_arg (stmt2, 0);
- tree val2 = gimple_call_arg (stmt2, 1);
- tree len2 = gimple_call_arg (stmt2, 2);
- tree diff, vdef, new_str_cst;
- gimple *use_stmt;
- unsigned int ptr1_align;
- unsigned HOST_WIDE_INT src_len;
- char *src_buf;
- use_operand_p use_p;
-
- if (!tree_fits_shwi_p (val2)
- || !tree_fits_uhwi_p (len2)
- || compare_tree_int (len2, 1024) == 1)
- break;
- if (is_gimple_call (stmt1))
- {
- /* If first stmt is a call, it needs to be memcpy
- or mempcpy, with string literal as second argument and
- constant length. */
- callee1 = gimple_call_fndecl (stmt1);
- if (callee1 == NULL_TREE
- || !fndecl_built_in_p (callee1, BUILT_IN_NORMAL)
- || gimple_call_num_args (stmt1) != 3)
- break;
- if (DECL_FUNCTION_CODE (callee1) != BUILT_IN_MEMCPY
- && DECL_FUNCTION_CODE (callee1) != BUILT_IN_MEMPCPY)
- break;
- ptr1 = gimple_call_arg (stmt1, 0);
- src1 = gimple_call_arg (stmt1, 1);
- len1 = gimple_call_arg (stmt1, 2);
- lhs1 = gimple_call_lhs (stmt1);
- if (!tree_fits_uhwi_p (len1))
- break;
- str1 = string_constant (src1, &off1, NULL, NULL);
- if (str1 == NULL_TREE)
- break;
- if (!tree_fits_uhwi_p (off1)
- || compare_tree_int (off1, TREE_STRING_LENGTH (str1) - 1) > 0
- || compare_tree_int (len1, TREE_STRING_LENGTH (str1)
- - tree_to_uhwi (off1)) > 0
- || TREE_CODE (TREE_TYPE (str1)) != ARRAY_TYPE
- || TYPE_MODE (TREE_TYPE (TREE_TYPE (str1)))
- != TYPE_MODE (char_type_node))
- break;
- }
- else if (gimple_assign_single_p (stmt1))
- {
- /* Otherwise look for length 1 memcpy optimized into
- assignment. */
- ptr1 = gimple_assign_lhs (stmt1);
- src1 = gimple_assign_rhs1 (stmt1);
- if (TREE_CODE (ptr1) != MEM_REF
- || TYPE_MODE (TREE_TYPE (ptr1)) != TYPE_MODE (char_type_node)
- || !tree_fits_shwi_p (src1))
- break;
- ptr1 = build_fold_addr_expr (ptr1);
- STRIP_USELESS_TYPE_CONVERSION (ptr1);
- callee1 = NULL_TREE;
- len1 = size_one_node;
- lhs1 = NULL_TREE;
- off1 = size_zero_node;
- str1 = NULL_TREE;
- }
- else
- break;
-
- diff = constant_pointer_difference (ptr1, ptr2);
- if (diff == NULL && lhs1 != NULL)
- {
- diff = constant_pointer_difference (lhs1, ptr2);
- if (DECL_FUNCTION_CODE (callee1) == BUILT_IN_MEMPCPY
- && diff != NULL)
- diff = size_binop (PLUS_EXPR, diff,
- fold_convert (sizetype, len1));
- }
- /* If the difference between the second and first destination pointer
- is not constant, or is bigger than memcpy length, bail out. */
- if (diff == NULL
- || !tree_fits_uhwi_p (diff)
- || tree_int_cst_lt (len1, diff)
- || compare_tree_int (diff, 1024) == 1)
- break;
-
- /* Use maximum of difference plus memset length and memcpy length
- as the new memcpy length, if it is too big, bail out. */
- src_len = tree_to_uhwi (diff);
- src_len += tree_to_uhwi (len2);
- if (src_len < tree_to_uhwi (len1))
- src_len = tree_to_uhwi (len1);
- if (src_len > 1024)
- break;
-
- /* If mempcpy value is used elsewhere, bail out, as mempcpy
- with bigger length will return different result. */
- if (lhs1 != NULL_TREE
- && DECL_FUNCTION_CODE (callee1) == BUILT_IN_MEMPCPY
- && (TREE_CODE (lhs1) != SSA_NAME
- || !single_imm_use (lhs1, &use_p, &use_stmt)
- || use_stmt != stmt2))
- break;
-
- /* If anything reads memory in between memcpy and memset
- call, the modified memcpy call might change it. */
- vdef = gimple_vdef (stmt1);
- if (vdef != NULL
- && (!single_imm_use (vdef, &use_p, &use_stmt)
- || use_stmt != stmt2))
- break;
-
- ptr1_align = get_pointer_alignment (ptr1);
- /* Construct the new source string literal. */
- src_buf = XALLOCAVEC (char, src_len + 1);
- if (callee1)
- memcpy (src_buf,
- TREE_STRING_POINTER (str1) + tree_to_uhwi (off1),
- tree_to_uhwi (len1));
- else
- src_buf[0] = tree_to_shwi (src1);
- memset (src_buf + tree_to_uhwi (diff),
- tree_to_shwi (val2), tree_to_uhwi (len2));
- src_buf[src_len] = '\0';
- /* Neither builtin_strncpy_read_str nor builtin_memcpy_read_str
- handle embedded '\0's. */
- if (strlen (src_buf) != src_len)
- break;
- rtl_profile_for_bb (gimple_bb (stmt2));
- /* If the new memcpy wouldn't be emitted by storing the literal
- by pieces, this optimization might enlarge .rodata too much,
- as commonly used string literals couldn't be shared any
- longer. */
- if (!can_store_by_pieces (src_len,
- builtin_strncpy_read_str,
- src_buf, ptr1_align, false))
- break;
-
- new_str_cst = build_string_literal (src_len, src_buf);
- if (callee1)
- {
- /* If STMT1 is a mem{,p}cpy call, adjust it and remove
- memset call. */
- if (lhs1 && DECL_FUNCTION_CODE (callee1) == BUILT_IN_MEMPCPY)
- gimple_call_set_lhs (stmt1, NULL_TREE);
- gimple_call_set_arg (stmt1, 1, new_str_cst);
- gimple_call_set_arg (stmt1, 2,
- build_int_cst (TREE_TYPE (len1), src_len));
- update_stmt (stmt1);
- unlink_stmt_vdef (stmt2);
- gsi_replace (gsi_p, gimple_build_nop (), false);
- fwprop_invalidate_lattice (gimple_get_lhs (stmt2));
- release_defs (stmt2);
- if (lhs1 && DECL_FUNCTION_CODE (callee1) == BUILT_IN_MEMPCPY)
- {
- fwprop_invalidate_lattice (lhs1);
- release_ssa_name (lhs1);
- }
- return true;
- }
- else
- {
- /* Otherwise, if STMT1 is length 1 memcpy optimized into
- assignment, remove STMT1 and change memset call into
- memcpy call. */
- gimple_stmt_iterator gsi = gsi_for_stmt (stmt1);
-
- if (!is_gimple_val (ptr1))
- ptr1 = force_gimple_operand_gsi (gsi_p, ptr1, true, NULL_TREE,
- true, GSI_SAME_STMT);
- tree fndecl = builtin_decl_explicit (BUILT_IN_MEMCPY);
- gimple_call_set_fndecl (stmt2, fndecl);
- gimple_call_set_fntype (as_a <gcall *> (stmt2),
- TREE_TYPE (fndecl));
- gimple_call_set_arg (stmt2, 0, ptr1);
- gimple_call_set_arg (stmt2, 1, new_str_cst);
- gimple_call_set_arg (stmt2, 2,
- build_int_cst (TREE_TYPE (len2), src_len));
- unlink_stmt_vdef (stmt1);
- gsi_remove (&gsi, true);
- fwprop_invalidate_lattice (gimple_get_lhs (stmt1));
- release_defs (stmt1);
- update_stmt (stmt2);
- return false;
- }
- }
- break;
-
- #define CASE_ATOMIC(NAME, OTHER, OP) \
- case BUILT_IN_##NAME##_1: \
- case BUILT_IN_##NAME##_2: \
- case BUILT_IN_##NAME##_4: \
- case BUILT_IN_##NAME##_8: \
- case BUILT_IN_##NAME##_16: \
- atomic_op = OP; \
- other_atomic \
- = (enum built_in_function) (BUILT_IN_##OTHER##_1 \
- + (DECL_FUNCTION_CODE (callee2) \
- - BUILT_IN_##NAME##_1)); \
- goto handle_atomic_fetch_op;
-
- CASE_ATOMIC (ATOMIC_FETCH_ADD, ATOMIC_ADD_FETCH, PLUS_EXPR)
- CASE_ATOMIC (ATOMIC_FETCH_SUB, ATOMIC_SUB_FETCH, MINUS_EXPR)
- CASE_ATOMIC (ATOMIC_FETCH_AND, ATOMIC_AND_FETCH, BIT_AND_EXPR)
- CASE_ATOMIC (ATOMIC_FETCH_XOR, ATOMIC_XOR_FETCH, BIT_XOR_EXPR)
- CASE_ATOMIC (ATOMIC_FETCH_OR, ATOMIC_OR_FETCH, BIT_IOR_EXPR)
-
- CASE_ATOMIC (SYNC_FETCH_AND_ADD, SYNC_ADD_AND_FETCH, PLUS_EXPR)
- CASE_ATOMIC (SYNC_FETCH_AND_SUB, SYNC_SUB_AND_FETCH, MINUS_EXPR)
- CASE_ATOMIC (SYNC_FETCH_AND_AND, SYNC_AND_AND_FETCH, BIT_AND_EXPR)
- CASE_ATOMIC (SYNC_FETCH_AND_XOR, SYNC_XOR_AND_FETCH, BIT_XOR_EXPR)
- CASE_ATOMIC (SYNC_FETCH_AND_OR, SYNC_OR_AND_FETCH, BIT_IOR_EXPR)
-
- CASE_ATOMIC (ATOMIC_ADD_FETCH, ATOMIC_FETCH_ADD, MINUS_EXPR)
- CASE_ATOMIC (ATOMIC_SUB_FETCH, ATOMIC_FETCH_SUB, PLUS_EXPR)
- CASE_ATOMIC (ATOMIC_XOR_FETCH, ATOMIC_FETCH_XOR, BIT_XOR_EXPR)
-
- CASE_ATOMIC (SYNC_ADD_AND_FETCH, SYNC_FETCH_AND_ADD, MINUS_EXPR)
- CASE_ATOMIC (SYNC_SUB_AND_FETCH, SYNC_FETCH_AND_SUB, PLUS_EXPR)
- CASE_ATOMIC (SYNC_XOR_AND_FETCH, SYNC_FETCH_AND_XOR, BIT_XOR_EXPR)
-
-#undef CASE_ATOMIC
-
- handle_atomic_fetch_op:
- if (gimple_call_num_args (stmt2) >= 2 && gimple_call_lhs (stmt2))
- {
- tree lhs2 = gimple_call_lhs (stmt2), lhsc = lhs2;
- tree arg = gimple_call_arg (stmt2, 1);
- gimple *use_stmt, *cast_stmt = NULL;
- use_operand_p use_p;
- tree ndecl = builtin_decl_explicit (other_atomic);
-
- if (ndecl == NULL_TREE || !single_imm_use (lhs2, &use_p, &use_stmt))
- break;
-
- if (gimple_assign_cast_p (use_stmt))
- {
- cast_stmt = use_stmt;
- lhsc = gimple_assign_lhs (cast_stmt);
- if (lhsc == NULL_TREE
- || !INTEGRAL_TYPE_P (TREE_TYPE (lhsc))
- || (TYPE_PRECISION (TREE_TYPE (lhsc))
- != TYPE_PRECISION (TREE_TYPE (lhs2)))
- || !single_imm_use (lhsc, &use_p, &use_stmt))
- {
- use_stmt = cast_stmt;
- cast_stmt = NULL;
- lhsc = lhs2;
- }
- }
-
- bool ok = false;
- tree oarg = NULL_TREE;
- enum tree_code ccode = ERROR_MARK;
- tree crhs1 = NULL_TREE, crhs2 = NULL_TREE;
- if (is_gimple_assign (use_stmt)
- && gimple_assign_rhs_code (use_stmt) == atomic_op)
- {
- if (gimple_assign_rhs1 (use_stmt) == lhsc)
- oarg = gimple_assign_rhs2 (use_stmt);
- else if (atomic_op != MINUS_EXPR)
- oarg = gimple_assign_rhs1 (use_stmt);
- }
- else if (atomic_op == MINUS_EXPR
- && is_gimple_assign (use_stmt)
- && gimple_assign_rhs_code (use_stmt) == PLUS_EXPR
- && TREE_CODE (arg) == INTEGER_CST
- && (TREE_CODE (gimple_assign_rhs2 (use_stmt))
- == INTEGER_CST))
- {
- tree a = fold_convert (TREE_TYPE (lhs2), arg);
- tree o = fold_convert (TREE_TYPE (lhs2),
- gimple_assign_rhs2 (use_stmt));
- if (wi::to_wide (a) == wi::neg (wi::to_wide (o)))
- ok = true;
- }
- else if (atomic_op == BIT_AND_EXPR || atomic_op == BIT_IOR_EXPR)
- ;
- else if (gimple_code (use_stmt) == GIMPLE_COND)
- {
- ccode = gimple_cond_code (use_stmt);
- crhs1 = gimple_cond_lhs (use_stmt);
- crhs2 = gimple_cond_rhs (use_stmt);
- }
- else if (is_gimple_assign (use_stmt))
- {
- if (gimple_assign_rhs_class (use_stmt) == GIMPLE_BINARY_RHS)
- {
- ccode = gimple_assign_rhs_code (use_stmt);
- crhs1 = gimple_assign_rhs1 (use_stmt);
- crhs2 = gimple_assign_rhs2 (use_stmt);
- }
- else if (gimple_assign_rhs_code (use_stmt) == COND_EXPR)
- {
- tree cond = gimple_assign_rhs1 (use_stmt);
- if (COMPARISON_CLASS_P (cond))
- {
- ccode = TREE_CODE (cond);
- crhs1 = TREE_OPERAND (cond, 0);
- crhs2 = TREE_OPERAND (cond, 1);
- }
- }
- }
- if (ccode == EQ_EXPR || ccode == NE_EXPR)
- {
- /* Deal with x - y == 0 or x ^ y == 0
- being optimized into x == y and x + cst == 0
- into x == -cst. */
- tree o = NULL_TREE;
- if (crhs1 == lhsc)
- o = crhs2;
- else if (crhs2 == lhsc)
- o = crhs1;
- if (o && atomic_op != PLUS_EXPR)
- oarg = o;
- else if (o
- && TREE_CODE (o) == INTEGER_CST
- && TREE_CODE (arg) == INTEGER_CST)
- {
- tree a = fold_convert (TREE_TYPE (lhs2), arg);
- o = fold_convert (TREE_TYPE (lhs2), o);
- if (wi::to_wide (a) == wi::neg (wi::to_wide (o)))
- ok = true;
- }
- }
- if (oarg && !ok)
- {
- if (operand_equal_p (arg, oarg, 0))
- ok = true;
- else if (TREE_CODE (arg) == SSA_NAME
- && TREE_CODE (oarg) == SSA_NAME)
- {
- tree oarg2 = oarg;
- if (gimple_assign_cast_p (SSA_NAME_DEF_STMT (oarg)))
- {
- gimple *g = SSA_NAME_DEF_STMT (oarg);
- oarg2 = gimple_assign_rhs1 (g);
- if (TREE_CODE (oarg2) != SSA_NAME
- || !INTEGRAL_TYPE_P (TREE_TYPE (oarg2))
- || (TYPE_PRECISION (TREE_TYPE (oarg2))
- != TYPE_PRECISION (TREE_TYPE (oarg))))
- oarg2 = oarg;
- }
- if (gimple_assign_cast_p (SSA_NAME_DEF_STMT (arg)))
- {
- gimple *g = SSA_NAME_DEF_STMT (arg);
- tree rhs1 = gimple_assign_rhs1 (g);
- /* Handle e.g.
- x.0_1 = (long unsigned int) x_4(D);
- _2 = __atomic_fetch_add_8 (&vlong, x.0_1, 0);
- _3 = (long int) _2;
- _7 = x_4(D) + _3; */
- if (rhs1 == oarg || rhs1 == oarg2)
- ok = true;
- /* Handle e.g.
- x.18_1 = (short unsigned int) x_5(D);
- _2 = (int) x.18_1;
- _3 = __atomic_fetch_xor_2 (&vshort, _2, 0);
- _4 = (short int) _3;
- _8 = x_5(D) ^ _4;
- This happens only for char/short. */
- else if (TREE_CODE (rhs1) == SSA_NAME
- && INTEGRAL_TYPE_P (TREE_TYPE (rhs1))
- && (TYPE_PRECISION (TREE_TYPE (rhs1))
- == TYPE_PRECISION (TREE_TYPE (lhs2))))
- {
- g = SSA_NAME_DEF_STMT (rhs1);
- if (gimple_assign_cast_p (g)
- && (gimple_assign_rhs1 (g) == oarg
- || gimple_assign_rhs1 (g) == oarg2))
- ok = true;
- }
- }
- if (!ok && arg == oarg2)
- /* Handle e.g.
- _1 = __sync_fetch_and_add_4 (&v, x_5(D));
- _2 = (int) _1;
- x.0_3 = (int) x_5(D);
- _7 = _2 + x.0_3; */
- ok = true;
- }
- }
-
- if (ok)
- {
- tree new_lhs = make_ssa_name (TREE_TYPE (lhs2));
- gimple_call_set_lhs (stmt2, new_lhs);
- gimple_call_set_fndecl (stmt2, ndecl);
- gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt);
- if (ccode == ERROR_MARK)
- gimple_assign_set_rhs_with_ops (&gsi, cast_stmt
- ? NOP_EXPR : SSA_NAME,
- new_lhs);
- else
- {
- crhs1 = new_lhs;
- crhs2 = build_zero_cst (TREE_TYPE (lhs2));
- if (gimple_code (use_stmt) == GIMPLE_COND)
- {
- gcond *cond_stmt = as_a <gcond *> (use_stmt);
- gimple_cond_set_lhs (cond_stmt, crhs1);
- gimple_cond_set_rhs (cond_stmt, crhs2);
- }
- else if (gimple_assign_rhs_class (use_stmt)
- == GIMPLE_BINARY_RHS)
- {
- gimple_assign_set_rhs1 (use_stmt, crhs1);
- gimple_assign_set_rhs2 (use_stmt, crhs2);
- }
- else
- {
- gcc_checking_assert (gimple_assign_rhs_code (use_stmt)
- == COND_EXPR);
- tree cond = build2 (ccode, boolean_type_node,
- crhs1, crhs2);
- gimple_assign_set_rhs1 (use_stmt, cond);
- }
- }
- update_stmt (use_stmt);
- if (atomic_op != BIT_AND_EXPR
- && atomic_op != BIT_IOR_EXPR
- && !stmt_ends_bb_p (stmt2))
- {
- /* For the benefit of debug stmts, emit stmt(s) to set
- lhs2 to the value it had from the new builtin.
- E.g. if it was previously:
- lhs2 = __atomic_fetch_add_8 (ptr, arg, 0);
- emit:
- new_lhs = __atomic_add_fetch_8 (ptr, arg, 0);
- lhs2 = new_lhs - arg;
- We also keep cast_stmt if any in the IL for
- the same reasons.
- These stmts will be DCEd later and proper debug info
- will be emitted.
- This is only possible for reversible operations
- (+/-/^) and without -fnon-call-exceptions. */
- gsi = gsi_for_stmt (stmt2);
- tree type = TREE_TYPE (lhs2);
- if (TREE_CODE (arg) == INTEGER_CST)
- arg = fold_convert (type, arg);
- else if (!useless_type_conversion_p (type, TREE_TYPE (arg)))
- {
- tree narg = make_ssa_name (type);
- gimple *g = gimple_build_assign (narg, NOP_EXPR, arg);
- gsi_insert_after (&gsi, g, GSI_NEW_STMT);
- arg = narg;
- }
- enum tree_code rcode;
- switch (atomic_op)
- {
- case PLUS_EXPR: rcode = MINUS_EXPR; break;
- case MINUS_EXPR: rcode = PLUS_EXPR; break;
- case BIT_XOR_EXPR: rcode = atomic_op; break;
- default: gcc_unreachable ();
- }
- gimple *g = gimple_build_assign (lhs2, rcode, new_lhs, arg);
- gsi_insert_after (&gsi, g, GSI_NEW_STMT);
- update_stmt (stmt2);
- }
- else
- {
- /* For e.g.
- lhs2 = __atomic_fetch_or_8 (ptr, arg, 0);
- after we change it to
- new_lhs = __atomic_or_fetch_8 (ptr, arg, 0);
- there is no way to find out the lhs2 value (i.e.
- what the atomic memory contained before the operation),
- values of some bits are lost. We have checked earlier
- that we don't have any non-debug users except for what
- we are already changing, so we need to reset the
- debug stmts and remove the cast_stmt if any. */
- imm_use_iterator iter;
- FOR_EACH_IMM_USE_STMT (use_stmt, iter, lhs2)
- if (use_stmt != cast_stmt)
- {
- gcc_assert (is_gimple_debug (use_stmt));
- gimple_debug_bind_reset_value (use_stmt);
- update_stmt (use_stmt);
- }
- if (cast_stmt)
- {
- gsi = gsi_for_stmt (cast_stmt);
- gsi_remove (&gsi, true);
- }
- update_stmt (stmt2);
- release_ssa_name (lhs2);
- }
- }
- }
- break;
-
- default:
- break;
- }
- return false;
-}
-
-/* Given a ssa_name in NAME see if it was defined by an assignment and
- set CODE to be the code and ARG1 to the first operand on the rhs and ARG2
- to the second operand on the rhs. */
-
-static inline void
-defcodefor_name (tree name, enum tree_code *code, tree *arg1, tree *arg2)
-{
- gimple *def;
- enum tree_code code1;
- tree arg11;
- tree arg21;
- tree arg31;
- enum gimple_rhs_class grhs_class;
-
- code1 = TREE_CODE (name);
- arg11 = name;
- arg21 = NULL_TREE;
- arg31 = NULL_TREE;
- grhs_class = get_gimple_rhs_class (code1);
-
- if (code1 == SSA_NAME)
- {
- def = SSA_NAME_DEF_STMT (name);
-
- if (def && is_gimple_assign (def)
- && can_propagate_from (def))
- {
- code1 = gimple_assign_rhs_code (def);
- arg11 = gimple_assign_rhs1 (def);
- arg21 = gimple_assign_rhs2 (def);
- arg31 = gimple_assign_rhs3 (def);
- }
- }
- else if (grhs_class != GIMPLE_SINGLE_RHS)
- code1 = ERROR_MARK;
-
- *code = code1;
- *arg1 = arg11;
- if (arg2)
- *arg2 = arg21;
- if (arg31)
- *code = ERROR_MARK;
-}
-
-
-/* Recognize rotation patterns. Return true if a transformation
- applied, otherwise return false.
-
- We are looking for X with unsigned type T with bitsize B, OP being
- +, | or ^, some type T2 wider than T. For:
- (X << CNT1) OP (X >> CNT2) iff CNT1 + CNT2 == B
- ((T) ((T2) X << CNT1)) OP ((T) ((T2) X >> CNT2)) iff CNT1 + CNT2 == B
-
- transform these into:
- X r<< CNT1
-
- Or for:
- (X << Y) OP (X >> (B - Y))
- (X << (int) Y) OP (X >> (int) (B - Y))
- ((T) ((T2) X << Y)) OP ((T) ((T2) X >> (B - Y)))
- ((T) ((T2) X << (int) Y)) OP ((T) ((T2) X >> (int) (B - Y)))
- (X << Y) | (X >> ((-Y) & (B - 1)))
- (X << (int) Y) | (X >> (int) ((-Y) & (B - 1)))
- ((T) ((T2) X << Y)) | ((T) ((T2) X >> ((-Y) & (B - 1))))
- ((T) ((T2) X << (int) Y)) | ((T) ((T2) X >> (int) ((-Y) & (B - 1))))
-
- transform these into:
- X r<< Y
-
- Or for:
- (X << (Y & (B - 1))) | (X >> ((-Y) & (B - 1)))
- (X << (int) (Y & (B - 1))) | (X >> (int) ((-Y) & (B - 1)))
- ((T) ((T2) X << (Y & (B - 1)))) | ((T) ((T2) X >> ((-Y) & (B - 1))))
- ((T) ((T2) X << (int) (Y & (B - 1)))) \
- | ((T) ((T2) X >> (int) ((-Y) & (B - 1))))
-
- transform these into:
- X r<< (Y & (B - 1))
-
- Note, in the patterns with T2 type, the type of OP operands
- might be even a signed type, but should have precision B.
- Expressions with & (B - 1) should be recognized only if B is
- a power of 2. */
-
-static bool
-simplify_rotate (gimple_stmt_iterator *gsi)
-{
- gimple *stmt = gsi_stmt (*gsi);
- tree arg[2], rtype, rotcnt = NULL_TREE;
- tree def_arg1[2], def_arg2[2];
- enum tree_code def_code[2];
- tree lhs;
- int i;
- bool swapped_p = false;
- gimple *g;
-
- arg[0] = gimple_assign_rhs1 (stmt);
- arg[1] = gimple_assign_rhs2 (stmt);
- rtype = TREE_TYPE (arg[0]);
-
- /* Only create rotates in complete modes. Other cases are not
- expanded properly. */
- if (!INTEGRAL_TYPE_P (rtype)
- || !type_has_mode_precision_p (rtype))
- return false;
-
- for (i = 0; i < 2; i++)
- defcodefor_name (arg[i], &def_code[i], &def_arg1[i], &def_arg2[i]);
-
- /* Look through narrowing (or same precision) conversions. */
- if (CONVERT_EXPR_CODE_P (def_code[0])
- && CONVERT_EXPR_CODE_P (def_code[1])
- && INTEGRAL_TYPE_P (TREE_TYPE (def_arg1[0]))
- && INTEGRAL_TYPE_P (TREE_TYPE (def_arg1[1]))
- && TYPE_PRECISION (TREE_TYPE (def_arg1[0]))
- == TYPE_PRECISION (TREE_TYPE (def_arg1[1]))
- && TYPE_PRECISION (TREE_TYPE (def_arg1[0])) >= TYPE_PRECISION (rtype)
- && has_single_use (arg[0])
- && has_single_use (arg[1]))
- {
- for (i = 0; i < 2; i++)
- {
- arg[i] = def_arg1[i];
- defcodefor_name (arg[i], &def_code[i], &def_arg1[i], &def_arg2[i]);
- }
- }
- else
- {
- /* Handle signed rotate; the RSHIFT_EXPR has to be done
- in unsigned type but LSHIFT_EXPR could be signed. */
- i = (def_code[0] == LSHIFT_EXPR || def_code[0] == RSHIFT_EXPR);
- if (CONVERT_EXPR_CODE_P (def_code[i])
- && (def_code[1 - i] == LSHIFT_EXPR || def_code[1 - i] == RSHIFT_EXPR)
- && INTEGRAL_TYPE_P (TREE_TYPE (def_arg1[i]))
- && TYPE_PRECISION (rtype) == TYPE_PRECISION (TREE_TYPE (def_arg1[i]))
- && has_single_use (arg[i]))
- {
- arg[i] = def_arg1[i];
- defcodefor_name (arg[i], &def_code[i], &def_arg1[i], &def_arg2[i]);
- }
- }
-
- /* One operand has to be LSHIFT_EXPR and one RSHIFT_EXPR. */
- for (i = 0; i < 2; i++)
- if (def_code[i] != LSHIFT_EXPR && def_code[i] != RSHIFT_EXPR)
- return false;
- else if (!has_single_use (arg[i]))
- return false;
- if (def_code[0] == def_code[1])
- return false;
-
- /* If we've looked through narrowing conversions before, look through
- widening conversions from unsigned type with the same precision
- as rtype here. */
- if (TYPE_PRECISION (TREE_TYPE (def_arg1[0])) != TYPE_PRECISION (rtype))
- for (i = 0; i < 2; i++)
- {
- tree tem;
- enum tree_code code;
- defcodefor_name (def_arg1[i], &code, &tem, NULL);
- if (!CONVERT_EXPR_CODE_P (code)
- || !INTEGRAL_TYPE_P (TREE_TYPE (tem))
- || TYPE_PRECISION (TREE_TYPE (tem)) != TYPE_PRECISION (rtype))
- return false;
- def_arg1[i] = tem;
- }
- /* Both shifts have to use the same first operand. */
- if (!operand_equal_for_phi_arg_p (def_arg1[0], def_arg1[1])
- || !types_compatible_p (TREE_TYPE (def_arg1[0]),
- TREE_TYPE (def_arg1[1])))
- {
- if ((TYPE_PRECISION (TREE_TYPE (def_arg1[0]))
- != TYPE_PRECISION (TREE_TYPE (def_arg1[1])))
- || (TYPE_UNSIGNED (TREE_TYPE (def_arg1[0]))
- == TYPE_UNSIGNED (TREE_TYPE (def_arg1[1]))))
- return false;
-
- /* Handle signed rotate; the RSHIFT_EXPR has to be done
- in unsigned type but LSHIFT_EXPR could be signed. */
- i = def_code[0] != RSHIFT_EXPR;
- if (!TYPE_UNSIGNED (TREE_TYPE (def_arg1[i])))
- return false;
-
- tree tem;
- enum tree_code code;
- defcodefor_name (def_arg1[i], &code, &tem, NULL);
- if (!CONVERT_EXPR_CODE_P (code)
- || !INTEGRAL_TYPE_P (TREE_TYPE (tem))
- || TYPE_PRECISION (TREE_TYPE (tem)) != TYPE_PRECISION (rtype))
- return false;
- def_arg1[i] = tem;
- if (!operand_equal_for_phi_arg_p (def_arg1[0], def_arg1[1])
- || !types_compatible_p (TREE_TYPE (def_arg1[0]),
- TREE_TYPE (def_arg1[1])))
- return false;
- }
- else if (!TYPE_UNSIGNED (TREE_TYPE (def_arg1[0])))
- return false;
-
- /* CNT1 + CNT2 == B case above. */
- if (tree_fits_uhwi_p (def_arg2[0])
- && tree_fits_uhwi_p (def_arg2[1])
- && tree_to_uhwi (def_arg2[0])
- + tree_to_uhwi (def_arg2[1]) == TYPE_PRECISION (rtype))
- rotcnt = def_arg2[0];
- else if (TREE_CODE (def_arg2[0]) != SSA_NAME
- || TREE_CODE (def_arg2[1]) != SSA_NAME)
- return false;
- else
- {
- tree cdef_arg1[2], cdef_arg2[2], def_arg2_alt[2];
- enum tree_code cdef_code[2];
- /* Look through conversion of the shift count argument.
- The C/C++ FE cast any shift count argument to integer_type_node.
- The only problem might be if the shift count type maximum value
- is equal or smaller than number of bits in rtype. */
- for (i = 0; i < 2; i++)
- {
- def_arg2_alt[i] = def_arg2[i];
- defcodefor_name (def_arg2[i], &cdef_code[i],
- &cdef_arg1[i], &cdef_arg2[i]);
- if (CONVERT_EXPR_CODE_P (cdef_code[i])
- && INTEGRAL_TYPE_P (TREE_TYPE (cdef_arg1[i]))
- && TYPE_PRECISION (TREE_TYPE (cdef_arg1[i]))
- > floor_log2 (TYPE_PRECISION (rtype))
- && type_has_mode_precision_p (TREE_TYPE (cdef_arg1[i])))
- {
- def_arg2_alt[i] = cdef_arg1[i];
- defcodefor_name (def_arg2_alt[i], &cdef_code[i],
- &cdef_arg1[i], &cdef_arg2[i]);
- }
- }
- for (i = 0; i < 2; i++)
- /* Check for one shift count being Y and the other B - Y,
- with optional casts. */
- if (cdef_code[i] == MINUS_EXPR
- && tree_fits_shwi_p (cdef_arg1[i])
- && tree_to_shwi (cdef_arg1[i]) == TYPE_PRECISION (rtype)
- && TREE_CODE (cdef_arg2[i]) == SSA_NAME)
- {
- tree tem;
- enum tree_code code;
-
- if (cdef_arg2[i] == def_arg2[1 - i]
- || cdef_arg2[i] == def_arg2_alt[1 - i])
- {
- rotcnt = cdef_arg2[i];
- break;
- }
- defcodefor_name (cdef_arg2[i], &code, &tem, NULL);
- if (CONVERT_EXPR_CODE_P (code)
- && INTEGRAL_TYPE_P (TREE_TYPE (tem))
- && TYPE_PRECISION (TREE_TYPE (tem))
- > floor_log2 (TYPE_PRECISION (rtype))
- && type_has_mode_precision_p (TREE_TYPE (tem))
- && (tem == def_arg2[1 - i]
- || tem == def_arg2_alt[1 - i]))
- {
- rotcnt = tem;
- break;
- }
- }
- /* The above sequence isn't safe for Y being 0,
- because then one of the shifts triggers undefined behavior.
- This alternative is safe even for rotation count of 0.
- One shift count is Y and the other (-Y) & (B - 1).
- Or one shift count is Y & (B - 1) and the other (-Y) & (B - 1). */
- else if (cdef_code[i] == BIT_AND_EXPR
- && pow2p_hwi (TYPE_PRECISION (rtype))
- && tree_fits_shwi_p (cdef_arg2[i])
- && tree_to_shwi (cdef_arg2[i])
- == TYPE_PRECISION (rtype) - 1
- && TREE_CODE (cdef_arg1[i]) == SSA_NAME
- && gimple_assign_rhs_code (stmt) == BIT_IOR_EXPR)
- {
- tree tem;
- enum tree_code code;
-
- defcodefor_name (cdef_arg1[i], &code, &tem, NULL);
- if (CONVERT_EXPR_CODE_P (code)
- && INTEGRAL_TYPE_P (TREE_TYPE (tem))
- && TYPE_PRECISION (TREE_TYPE (tem))
- > floor_log2 (TYPE_PRECISION (rtype))
- && type_has_mode_precision_p (TREE_TYPE (tem)))
- defcodefor_name (tem, &code, &tem, NULL);
-
- if (code == NEGATE_EXPR)
- {
- if (tem == def_arg2[1 - i] || tem == def_arg2_alt[1 - i])
- {
- rotcnt = tem;
- break;
- }
- tree tem2;
- defcodefor_name (tem, &code, &tem2, NULL);
- if (CONVERT_EXPR_CODE_P (code)
- && INTEGRAL_TYPE_P (TREE_TYPE (tem2))
- && TYPE_PRECISION (TREE_TYPE (tem2))
- > floor_log2 (TYPE_PRECISION (rtype))
- && type_has_mode_precision_p (TREE_TYPE (tem2)))
- {
- if (tem2 == def_arg2[1 - i]
- || tem2 == def_arg2_alt[1 - i])
- {
- rotcnt = tem2;
- break;
- }
- }
- else
- tem2 = NULL_TREE;
-
- if (cdef_code[1 - i] == BIT_AND_EXPR
- && tree_fits_shwi_p (cdef_arg2[1 - i])
- && tree_to_shwi (cdef_arg2[1 - i])
- == TYPE_PRECISION (rtype) - 1
- && TREE_CODE (cdef_arg1[1 - i]) == SSA_NAME)
- {
- if (tem == cdef_arg1[1 - i]
- || tem2 == cdef_arg1[1 - i])
- {
- rotcnt = def_arg2[1 - i];
- break;
- }
- tree tem3;
- defcodefor_name (cdef_arg1[1 - i], &code, &tem3, NULL);
- if (CONVERT_EXPR_CODE_P (code)
- && INTEGRAL_TYPE_P (TREE_TYPE (tem3))
- && TYPE_PRECISION (TREE_TYPE (tem3))
- > floor_log2 (TYPE_PRECISION (rtype))
- && type_has_mode_precision_p (TREE_TYPE (tem3)))
- {
- if (tem == tem3 || tem2 == tem3)
- {
- rotcnt = def_arg2[1 - i];
- break;
- }
- }
- }
- }
- }
- if (rotcnt == NULL_TREE)
- return false;
- swapped_p = i != 1;
- }
-
- if (!useless_type_conversion_p (TREE_TYPE (def_arg2[0]),
- TREE_TYPE (rotcnt)))
- {
- g = gimple_build_assign (make_ssa_name (TREE_TYPE (def_arg2[0])),
- NOP_EXPR, rotcnt);
- gsi_insert_before (gsi, g, GSI_SAME_STMT);
- rotcnt = gimple_assign_lhs (g);
- }
- lhs = gimple_assign_lhs (stmt);
- if (!useless_type_conversion_p (rtype, TREE_TYPE (def_arg1[0])))
- lhs = make_ssa_name (TREE_TYPE (def_arg1[0]));
- g = gimple_build_assign (lhs,
- ((def_code[0] == LSHIFT_EXPR) ^ swapped_p)
- ? LROTATE_EXPR : RROTATE_EXPR, def_arg1[0], rotcnt);
- if (!useless_type_conversion_p (rtype, TREE_TYPE (def_arg1[0])))
- {
- gsi_insert_before (gsi, g, GSI_SAME_STMT);
- g = gimple_build_assign (gimple_assign_lhs (stmt), NOP_EXPR, lhs);
- }
- gsi_replace (gsi, g, false);
- return true;
-}
-
-
-/* Check whether an array contains a valid ctz table. */
-static bool
-check_ctz_array (tree ctor, unsigned HOST_WIDE_INT mulc,
- HOST_WIDE_INT &zero_val, unsigned shift, unsigned bits)
-{
- tree elt, idx;
- unsigned HOST_WIDE_INT i, mask;
- unsigned matched = 0;
-
- mask = ((HOST_WIDE_INT_1U << (bits - shift)) - 1) << shift;
-
- zero_val = 0;
-
- FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), i, idx, elt)
- {
- if (TREE_CODE (idx) != INTEGER_CST || TREE_CODE (elt) != INTEGER_CST)
- return false;
- if (i > bits * 2)
- return false;
-
- unsigned HOST_WIDE_INT index = tree_to_shwi (idx);
- HOST_WIDE_INT val = tree_to_shwi (elt);
-
- if (index == 0)
- {
- zero_val = val;
- matched++;
- }
-
- if (val >= 0 && val < bits && (((mulc << val) & mask) >> shift) == index)
- matched++;
-
- if (matched > bits)
- return true;
- }
-
- return false;
-}
-
-/* Check whether a string contains a valid ctz table. */
-static bool
-check_ctz_string (tree string, unsigned HOST_WIDE_INT mulc,
- HOST_WIDE_INT &zero_val, unsigned shift, unsigned bits)
-{
- unsigned HOST_WIDE_INT len = TREE_STRING_LENGTH (string);
- unsigned HOST_WIDE_INT mask;
- unsigned matched = 0;
- const unsigned char *p = (const unsigned char *) TREE_STRING_POINTER (string);
-
- if (len < bits || len > bits * 2)
- return false;
-
- mask = ((HOST_WIDE_INT_1U << (bits - shift)) - 1) << shift;
-
- zero_val = p[0];
-
- for (unsigned i = 0; i < len; i++)
- if (p[i] < bits && (((mulc << p[i]) & mask) >> shift) == i)
- matched++;
-
- return matched == bits;
-}
-
-/* Recognize count trailing zeroes idiom.
- The canonical form is array[((x & -x) * C) >> SHIFT] where C is a magic
- constant which when multiplied by a power of 2 creates a unique value
- in the top 5 or 6 bits. This is then indexed into a table which maps it
- to the number of trailing zeroes. Array[0] is returned so the caller can
- emit an appropriate sequence depending on whether ctz (0) is defined on
- the target. */
-static bool
-optimize_count_trailing_zeroes (tree array_ref, tree x, tree mulc,
- tree tshift, HOST_WIDE_INT &zero_val)
-{
- tree type = TREE_TYPE (array_ref);
- tree array = TREE_OPERAND (array_ref, 0);
-
- gcc_assert (TREE_CODE (mulc) == INTEGER_CST);
- gcc_assert (TREE_CODE (tshift) == INTEGER_CST);
-
- tree input_type = TREE_TYPE (x);
- unsigned input_bits = tree_to_shwi (TYPE_SIZE (input_type));
-
- /* Check the array element type is not wider than 32 bits and the input is
- an unsigned 32-bit or 64-bit type. */
- if (TYPE_PRECISION (type) > 32 || !TYPE_UNSIGNED (input_type))
- return false;
- if (input_bits != 32 && input_bits != 64)
- return false;
-
- if (!direct_internal_fn_supported_p (IFN_CTZ, input_type, OPTIMIZE_FOR_BOTH))
- return false;
-
- /* Check the lower bound of the array is zero. */
- tree low = array_ref_low_bound (array_ref);
- if (!low || !integer_zerop (low))
- return false;
-
- unsigned shiftval = tree_to_shwi (tshift);
-
- /* Check the shift extracts the top 5..7 bits. */
- if (shiftval < input_bits - 7 || shiftval > input_bits - 5)
- return false;
-
- tree ctor = ctor_for_folding (array);
- if (!ctor)
- return false;
-
- unsigned HOST_WIDE_INT val = tree_to_uhwi (mulc);
-
- if (TREE_CODE (ctor) == CONSTRUCTOR)
- return check_ctz_array (ctor, val, zero_val, shiftval, input_bits);
-
- if (TREE_CODE (ctor) == STRING_CST
- && TYPE_PRECISION (type) == CHAR_TYPE_SIZE)
- return check_ctz_string (ctor, val, zero_val, shiftval, input_bits);
-
- return false;
-}
-
-/* Match.pd function to match the ctz expression. */
-extern bool gimple_ctz_table_index (tree, tree *, tree (*)(tree));
-
-static bool
-simplify_count_trailing_zeroes (gimple_stmt_iterator *gsi)
-{
- gimple *stmt = gsi_stmt (*gsi);
- tree array_ref = gimple_assign_rhs1 (stmt);
- tree res_ops[3];
- HOST_WIDE_INT zero_val;
-
- gcc_checking_assert (TREE_CODE (array_ref) == ARRAY_REF);
-
- if (!gimple_ctz_table_index (TREE_OPERAND (array_ref, 1), &res_ops[0], NULL))
- return false;
-
- if (optimize_count_trailing_zeroes (array_ref, res_ops[0],
- res_ops[1], res_ops[2], zero_val))
- {
- tree type = TREE_TYPE (res_ops[0]);
- HOST_WIDE_INT ctz_val = 0;
- HOST_WIDE_INT type_size = tree_to_shwi (TYPE_SIZE (type));
- bool zero_ok
- = CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_INT_TYPE_MODE (type), ctz_val) == 2;
-
- /* If the input value can't be zero, don't special case ctz (0). */
- if (tree_expr_nonzero_p (res_ops[0]))
- {
- zero_ok = true;
- zero_val = 0;
- ctz_val = 0;
- }
-
- /* Skip if there is no value defined at zero, or if we can't easily
- return the correct value for zero. */
- if (!zero_ok)
- return false;
- if (zero_val != ctz_val && !(zero_val == 0 && ctz_val == type_size))
- return false;
-
- gimple_seq seq = NULL;
- gimple *g;
- gcall *call = gimple_build_call_internal (IFN_CTZ, 1, res_ops[0]);
- gimple_set_location (call, gimple_location (stmt));
- gimple_set_lhs (call, make_ssa_name (integer_type_node));
- gimple_seq_add_stmt (&seq, call);
-
- tree prev_lhs = gimple_call_lhs (call);
-
- /* Emit ctz (x) & 31 if ctz (0) is 32 but we need to return 0. */
- if (zero_val == 0 && ctz_val == type_size)
- {
- g = gimple_build_assign (make_ssa_name (integer_type_node),
- BIT_AND_EXPR, prev_lhs,
- build_int_cst (integer_type_node,
- type_size - 1));
- gimple_set_location (g, gimple_location (stmt));
- gimple_seq_add_stmt (&seq, g);
- prev_lhs = gimple_assign_lhs (g);
- }
-
- g = gimple_build_assign (gimple_assign_lhs (stmt), NOP_EXPR, prev_lhs);
- gimple_seq_add_stmt (&seq, g);
- gsi_replace_with_seq (gsi, seq, true);
- return true;
- }
-
- return false;
-}
-
-
-/* Combine an element access with a shuffle. Returns true if there were
- any changes made, else it returns false. */
-
-static bool
-simplify_bitfield_ref (gimple_stmt_iterator *gsi)
-{
- gimple *stmt = gsi_stmt (*gsi);
- gimple *def_stmt;
- tree op, op0, op1;
- tree elem_type;
- unsigned idx, size;
- enum tree_code code;
-
- op = gimple_assign_rhs1 (stmt);
- gcc_checking_assert (TREE_CODE (op) == BIT_FIELD_REF);
-
- op0 = TREE_OPERAND (op, 0);
- if (TREE_CODE (op0) != SSA_NAME
- || TREE_CODE (TREE_TYPE (op0)) != VECTOR_TYPE)
- return false;
-
- def_stmt = get_prop_source_stmt (op0, false, NULL);
- if (!def_stmt || !can_propagate_from (def_stmt))
- return false;
-
- op1 = TREE_OPERAND (op, 1);
- code = gimple_assign_rhs_code (def_stmt);
- elem_type = TREE_TYPE (TREE_TYPE (op0));
- if (TREE_TYPE (op) != elem_type)
- return false;
-
- size = TREE_INT_CST_LOW (TYPE_SIZE (elem_type));
- if (maybe_ne (bit_field_size (op), size))
- return false;
-
- if (code == VEC_PERM_EXPR
- && constant_multiple_p (bit_field_offset (op), size, &idx))
- {
- tree p, m, tem;
- unsigned HOST_WIDE_INT nelts;
- m = gimple_assign_rhs3 (def_stmt);
- if (TREE_CODE (m) != VECTOR_CST
- || !VECTOR_CST_NELTS (m).is_constant (&nelts))
- return false;
- idx = TREE_INT_CST_LOW (VECTOR_CST_ELT (m, idx));
- idx %= 2 * nelts;
- if (idx < nelts)
- {
- p = gimple_assign_rhs1 (def_stmt);
- }
- else
- {
- p = gimple_assign_rhs2 (def_stmt);
- idx -= nelts;
- }
- tem = build3 (BIT_FIELD_REF, TREE_TYPE (op),
- unshare_expr (p), op1, bitsize_int (idx * size));
- gimple_assign_set_rhs1 (stmt, tem);
- fold_stmt (gsi);
- update_stmt (gsi_stmt (*gsi));
- return true;
- }
-
- return false;
-}
-
-/* Determine whether applying the 2 permutations (mask1 then mask2)
- gives back one of the input. */
-
-static int
-is_combined_permutation_identity (tree mask1, tree mask2)
-{
- tree mask;
- unsigned HOST_WIDE_INT nelts, i, j;
- bool maybe_identity1 = true;
- bool maybe_identity2 = true;
-
- gcc_checking_assert (TREE_CODE (mask1) == VECTOR_CST
- && TREE_CODE (mask2) == VECTOR_CST);
- mask = fold_ternary (VEC_PERM_EXPR, TREE_TYPE (mask1), mask1, mask1, mask2);
- if (mask == NULL_TREE || TREE_CODE (mask) != VECTOR_CST)
- return 0;
-
- if (!VECTOR_CST_NELTS (mask).is_constant (&nelts))
- return 0;
- for (i = 0; i < nelts; i++)
- {
- tree val = VECTOR_CST_ELT (mask, i);
- gcc_assert (TREE_CODE (val) == INTEGER_CST);
- j = TREE_INT_CST_LOW (val) & (2 * nelts - 1);
- if (j == i)
- maybe_identity2 = false;
- else if (j == i + nelts)
- maybe_identity1 = false;
- else
- return 0;
- }
- return maybe_identity1 ? 1 : maybe_identity2 ? 2 : 0;
-}
-
-/* Combine a shuffle with its arguments. Returns 1 if there were any
- changes made, 2 if cfg-cleanup needs to run. Else it returns 0. */
-
-static int
-simplify_permutation (gimple_stmt_iterator *gsi)
-{
- gimple *stmt = gsi_stmt (*gsi);
- gimple *def_stmt = NULL;
- tree op0, op1, op2, op3, arg0, arg1;
- enum tree_code code, code2 = ERROR_MARK;
- bool single_use_op0 = false;
-
- gcc_checking_assert (gimple_assign_rhs_code (stmt) == VEC_PERM_EXPR);
-
- op0 = gimple_assign_rhs1 (stmt);
- op1 = gimple_assign_rhs2 (stmt);
- op2 = gimple_assign_rhs3 (stmt);
-
- if (TREE_CODE (op2) != VECTOR_CST)
- return 0;
-
- if (TREE_CODE (op0) == VECTOR_CST)
- {
- code = VECTOR_CST;
- arg0 = op0;
- }
- else if (TREE_CODE (op0) == SSA_NAME)
- {
- def_stmt = get_prop_source_stmt (op0, false, &single_use_op0);
- if (!def_stmt)
- return 0;
- code = gimple_assign_rhs_code (def_stmt);
- if (code == VIEW_CONVERT_EXPR)
- {
- tree rhs = gimple_assign_rhs1 (def_stmt);
- tree name = TREE_OPERAND (rhs, 0);
- if (TREE_CODE (name) != SSA_NAME)
- return 0;
- if (!has_single_use (name))
- single_use_op0 = false;
- /* Here we update the def_stmt through this VIEW_CONVERT_EXPR,
- but still keep the code to indicate it comes from
- VIEW_CONVERT_EXPR. */
- def_stmt = SSA_NAME_DEF_STMT (name);
- if (!def_stmt || !is_gimple_assign (def_stmt))
- return 0;
- if (gimple_assign_rhs_code (def_stmt) != CONSTRUCTOR)
- return 0;
- }
- if (!can_propagate_from (def_stmt))
- return 0;
- arg0 = gimple_assign_rhs1 (def_stmt);
- }
- else
- return 0;
-
- /* Two consecutive shuffles. */
- if (code == VEC_PERM_EXPR)
- {
- tree orig;
- int ident;
-
- if (op0 != op1)
- return 0;
- op3 = gimple_assign_rhs3 (def_stmt);
- if (TREE_CODE (op3) != VECTOR_CST)
- return 0;
- ident = is_combined_permutation_identity (op3, op2);
- if (!ident)
- return 0;
- orig = (ident == 1) ? gimple_assign_rhs1 (def_stmt)
- : gimple_assign_rhs2 (def_stmt);
- gimple_assign_set_rhs1 (stmt, unshare_expr (orig));
- gimple_assign_set_rhs_code (stmt, TREE_CODE (orig));
- gimple_set_num_ops (stmt, 2);
- update_stmt (stmt);
- return remove_prop_source_from_use (op0) ? 2 : 1;
- }
- else if (code == CONSTRUCTOR
- || code == VECTOR_CST
- || code == VIEW_CONVERT_EXPR)
- {
- if (op0 != op1)
- {
- if (TREE_CODE (op0) == SSA_NAME && !single_use_op0)
- return 0;
-
- if (TREE_CODE (op1) == VECTOR_CST)
- arg1 = op1;
- else if (TREE_CODE (op1) == SSA_NAME)
- {
- gimple *def_stmt2 = get_prop_source_stmt (op1, true, NULL);
- if (!def_stmt2)
- return 0;
- code2 = gimple_assign_rhs_code (def_stmt2);
- if (code2 == VIEW_CONVERT_EXPR)
- {
- tree rhs = gimple_assign_rhs1 (def_stmt2);
- tree name = TREE_OPERAND (rhs, 0);
- if (TREE_CODE (name) != SSA_NAME)
- return 0;
- if (!has_single_use (name))
- return 0;
- def_stmt2 = SSA_NAME_DEF_STMT (name);
- if (!def_stmt2 || !is_gimple_assign (def_stmt2))
- return 0;
- if (gimple_assign_rhs_code (def_stmt2) != CONSTRUCTOR)
- return 0;
- }
- else if (code2 != CONSTRUCTOR && code2 != VECTOR_CST)
- return 0;
- if (!can_propagate_from (def_stmt2))
- return 0;
- arg1 = gimple_assign_rhs1 (def_stmt2);
- }
- else
- return 0;
- }
- else
- {
- /* Already used twice in this statement. */
- if (TREE_CODE (op0) == SSA_NAME && num_imm_uses (op0) > 2)
- return 0;
- arg1 = arg0;
- }
-
- /* If there are any VIEW_CONVERT_EXPRs found when finding permutation
- operands source, check whether it's valid to transform and prepare
- the required new operands. */
- if (code == VIEW_CONVERT_EXPR || code2 == VIEW_CONVERT_EXPR)
- {
- /* Figure out the target vector type to which operands should be
- converted. If both are CONSTRUCTOR, the types should be the
- same, otherwise, use the one of CONSTRUCTOR. */
- tree tgt_type = NULL_TREE;
- if (code == VIEW_CONVERT_EXPR)
- {
- gcc_assert (gimple_assign_rhs_code (def_stmt) == CONSTRUCTOR);
- code = CONSTRUCTOR;
- tgt_type = TREE_TYPE (arg0);
- }
- if (code2 == VIEW_CONVERT_EXPR)
- {
- tree arg1_type = TREE_TYPE (arg1);
- if (tgt_type == NULL_TREE)
- tgt_type = arg1_type;
- else if (tgt_type != arg1_type)
- return 0;
- }
-
- if (!VECTOR_TYPE_P (tgt_type))
- return 0;
- tree op2_type = TREE_TYPE (op2);
-
- /* Figure out the shrunk factor. */
- poly_uint64 tgt_units = TYPE_VECTOR_SUBPARTS (tgt_type);
- poly_uint64 op2_units = TYPE_VECTOR_SUBPARTS (op2_type);
- if (maybe_gt (tgt_units, op2_units))
- return 0;
- unsigned int factor;
- if (!constant_multiple_p (op2_units, tgt_units, &factor))
- return 0;
-
- /* Build the new permutation control vector as target vector. */
- vec_perm_builder builder;
- if (!tree_to_vec_perm_builder (&builder, op2))
- return 0;
- vec_perm_indices indices (builder, 2, op2_units);
- vec_perm_indices new_indices;
- if (new_indices.new_shrunk_vector (indices, factor))
- {
- tree mask_type = tgt_type;
- if (!VECTOR_INTEGER_TYPE_P (mask_type))
- {
- tree elem_type = TREE_TYPE (mask_type);
- unsigned elem_size = TREE_INT_CST_LOW (TYPE_SIZE (elem_type));
- tree int_type = build_nonstandard_integer_type (elem_size, 0);
- mask_type = build_vector_type (int_type, tgt_units);
- }
- op2 = vec_perm_indices_to_tree (mask_type, new_indices);
- }
- else
- return 0;
-
- /* Convert the VECTOR_CST to the appropriate vector type. */
- if (tgt_type != TREE_TYPE (arg0))
- arg0 = fold_build1 (VIEW_CONVERT_EXPR, tgt_type, arg0);
- else if (tgt_type != TREE_TYPE (arg1))
- arg1 = fold_build1 (VIEW_CONVERT_EXPR, tgt_type, arg1);
- }
-
- /* VIEW_CONVERT_EXPR should be updated to CONSTRUCTOR before. */
- gcc_assert (code == CONSTRUCTOR || code == VECTOR_CST);
-
- /* Shuffle of a constructor. */
- bool ret = false;
- tree res_type = TREE_TYPE (arg0);
- tree opt = fold_ternary (VEC_PERM_EXPR, res_type, arg0, arg1, op2);
- if (!opt
- || (TREE_CODE (opt) != CONSTRUCTOR && TREE_CODE (opt) != VECTOR_CST))
- return 0;
- /* Found VIEW_CONVERT_EXPR before, need one explicit conversion. */
- if (res_type != TREE_TYPE (op0))
- {
- tree name = make_ssa_name (TREE_TYPE (opt));
- gimple *ass_stmt = gimple_build_assign (name, opt);
- gsi_insert_before (gsi, ass_stmt, GSI_SAME_STMT);
- opt = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (op0), name);
- }
- gimple_assign_set_rhs_from_tree (gsi, opt);
- update_stmt (gsi_stmt (*gsi));
- if (TREE_CODE (op0) == SSA_NAME)
- ret = remove_prop_source_from_use (op0);
- if (op0 != op1 && TREE_CODE (op1) == SSA_NAME)
- ret |= remove_prop_source_from_use (op1);
- return ret ? 2 : 1;
- }
-
- return 0;
-}
-
-/* Get the BIT_FIELD_REF definition of VAL, if any, looking through
- conversions with code CONV_CODE or update it if still ERROR_MARK.
- Return NULL_TREE if no such matching def was found. */
-
-static tree
-get_bit_field_ref_def (tree val, enum tree_code &conv_code)
-{
- if (TREE_CODE (val) != SSA_NAME)
- return NULL_TREE ;
- gimple *def_stmt = get_prop_source_stmt (val, false, NULL);
- if (!def_stmt)
- return NULL_TREE;
- enum tree_code code = gimple_assign_rhs_code (def_stmt);
- if (code == FLOAT_EXPR
- || code == FIX_TRUNC_EXPR
- || CONVERT_EXPR_CODE_P (code))
- {
- tree op1 = gimple_assign_rhs1 (def_stmt);
- if (conv_code == ERROR_MARK)
- conv_code = code;
- else if (conv_code != code)
- return NULL_TREE;
- if (TREE_CODE (op1) != SSA_NAME)
- return NULL_TREE;
- def_stmt = SSA_NAME_DEF_STMT (op1);
- if (! is_gimple_assign (def_stmt))
- return NULL_TREE;
- code = gimple_assign_rhs_code (def_stmt);
- }
- if (code != BIT_FIELD_REF)
- return NULL_TREE;
- return gimple_assign_rhs1 (def_stmt);
-}
-
-/* Recognize a VEC_PERM_EXPR. Returns true if there were any changes. */
-
-static bool
-simplify_vector_constructor (gimple_stmt_iterator *gsi)
-{
- gimple *stmt = gsi_stmt (*gsi);
- tree op, orig[2], type, elem_type;
- unsigned elem_size, i;
- unsigned HOST_WIDE_INT nelts;
- unsigned HOST_WIDE_INT refnelts;
- enum tree_code conv_code;
- constructor_elt *elt;
-
- op = gimple_assign_rhs1 (stmt);
- type = TREE_TYPE (op);
- gcc_checking_assert (TREE_CODE (op) == CONSTRUCTOR
- && TREE_CODE (type) == VECTOR_TYPE);
-
- if (!TYPE_VECTOR_SUBPARTS (type).is_constant (&nelts))
- return false;
- elem_type = TREE_TYPE (type);
- elem_size = TREE_INT_CST_LOW (TYPE_SIZE (elem_type));
-
- orig[0] = NULL;
- orig[1] = NULL;
- conv_code = ERROR_MARK;
- bool maybe_ident = true;
- bool maybe_blend[2] = { true, true };
- tree one_constant = NULL_TREE;
- tree one_nonconstant = NULL_TREE;
- auto_vec<tree> constants;
- constants.safe_grow_cleared (nelts, true);
- auto_vec<std::pair<unsigned, unsigned>, 64> elts;
- FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (op), i, elt)
- {
- tree ref, op1;
- unsigned int elem;
-
- if (i >= nelts)
- return false;
-
- /* Look for elements extracted and possibly converted from
- another vector. */
- op1 = get_bit_field_ref_def (elt->value, conv_code);
- if (op1
- && TREE_CODE ((ref = TREE_OPERAND (op1, 0))) == SSA_NAME
- && VECTOR_TYPE_P (TREE_TYPE (ref))
- && useless_type_conversion_p (TREE_TYPE (op1),
- TREE_TYPE (TREE_TYPE (ref)))
- && constant_multiple_p (bit_field_offset (op1),
- bit_field_size (op1), &elem)
- && TYPE_VECTOR_SUBPARTS (TREE_TYPE (ref)).is_constant (&refnelts))
- {
- unsigned int j;
- for (j = 0; j < 2; ++j)
- {
- if (!orig[j])
- {
- if (j == 0
- || useless_type_conversion_p (TREE_TYPE (orig[0]),
- TREE_TYPE (ref)))
- break;
- }
- else if (ref == orig[j])
- break;
- }
- /* Found a suitable vector element. */
- if (j < 2)
- {
- orig[j] = ref;
- if (elem != i || j != 0)
- maybe_ident = false;
- if (elem != i)
- maybe_blend[j] = false;
- elts.safe_push (std::make_pair (j, elem));
- continue;
- }
- /* Else fallthru. */
- }
- /* Handle elements not extracted from a vector.
- 1. constants by permuting with constant vector
- 2. a unique non-constant element by permuting with a splat vector */
- if (orig[1]
- && orig[1] != error_mark_node)
- return false;
- orig[1] = error_mark_node;
- if (CONSTANT_CLASS_P (elt->value))
- {
- if (one_nonconstant)
- return false;
- if (!one_constant)
- one_constant = elt->value;
- constants[i] = elt->value;
- }
- else
- {
- if (one_constant)
- return false;
- if (!one_nonconstant)
- one_nonconstant = elt->value;
- else if (!operand_equal_p (one_nonconstant, elt->value, 0))
- return false;
- }
- elts.safe_push (std::make_pair (1, i));
- maybe_ident = false;
- }
- if (i < nelts)
- return false;
-
- if (! orig[0]
- || ! VECTOR_TYPE_P (TREE_TYPE (orig[0])))
- return false;
- refnelts = TYPE_VECTOR_SUBPARTS (TREE_TYPE (orig[0])).to_constant ();
- /* We currently do not handle larger destination vectors. */
- if (refnelts < nelts)
- return false;
-
- if (maybe_ident)
- {
- tree conv_src_type
- = (nelts != refnelts
- ? (conv_code != ERROR_MARK
- ? build_vector_type (TREE_TYPE (TREE_TYPE (orig[0])), nelts)
- : type)
- : TREE_TYPE (orig[0]));
- if (conv_code != ERROR_MARK
- && !supportable_convert_operation (conv_code, type, conv_src_type,
- &conv_code))
- {
- /* Only few targets implement direct conversion patterns so try
- some simple special cases via VEC_[UN]PACK[_FLOAT]_LO_EXPR. */
- optab optab;
- tree halfvectype, dblvectype;
- enum tree_code unpack_op;
-
- if (!BYTES_BIG_ENDIAN)
- unpack_op = (FLOAT_TYPE_P (TREE_TYPE (type))
- ? VEC_UNPACK_FLOAT_LO_EXPR
- : VEC_UNPACK_LO_EXPR);
- else
- unpack_op = (FLOAT_TYPE_P (TREE_TYPE (type))
- ? VEC_UNPACK_FLOAT_HI_EXPR
- : VEC_UNPACK_HI_EXPR);
-
- if (CONVERT_EXPR_CODE_P (conv_code)
- && (2 * TYPE_PRECISION (TREE_TYPE (TREE_TYPE (orig[0])))
- == TYPE_PRECISION (TREE_TYPE (type)))
- && mode_for_vector (as_a <scalar_mode>
- (TYPE_MODE (TREE_TYPE (TREE_TYPE (orig[0])))),
- nelts * 2).exists ()
- && (dblvectype
- = build_vector_type (TREE_TYPE (TREE_TYPE (orig[0])),
- nelts * 2))
- /* Only use it for vector modes or for vector booleans
- represented as scalar bitmasks. See PR95528. */
- && (VECTOR_MODE_P (TYPE_MODE (dblvectype))
- || VECTOR_BOOLEAN_TYPE_P (dblvectype))
- && (optab = optab_for_tree_code (unpack_op,
- dblvectype,
- optab_default))
- && (optab_handler (optab, TYPE_MODE (dblvectype))
- != CODE_FOR_nothing))
- {
- gimple_seq stmts = NULL;
- tree dbl;
- if (refnelts == nelts)
- {
- /* ??? Paradoxical subregs don't exist, so insert into
- the lower half of a wider zero vector. */
- dbl = gimple_build (&stmts, BIT_INSERT_EXPR, dblvectype,
- build_zero_cst (dblvectype), orig[0],
- bitsize_zero_node);
- }
- else if (refnelts == 2 * nelts)
- dbl = orig[0];
- else
- dbl = gimple_build (&stmts, BIT_FIELD_REF, dblvectype,
- orig[0], TYPE_SIZE (dblvectype),
- bitsize_zero_node);
- gsi_insert_seq_before (gsi, stmts, GSI_SAME_STMT);
- gimple_assign_set_rhs_with_ops (gsi, unpack_op, dbl);
- }
- else if (CONVERT_EXPR_CODE_P (conv_code)
- && (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (orig[0])))
- == 2 * TYPE_PRECISION (TREE_TYPE (type)))
- && mode_for_vector (as_a <scalar_mode>
- (TYPE_MODE
- (TREE_TYPE (TREE_TYPE (orig[0])))),
- nelts / 2).exists ()
- && (halfvectype
- = build_vector_type (TREE_TYPE (TREE_TYPE (orig[0])),
- nelts / 2))
- /* Only use it for vector modes or for vector booleans
- represented as scalar bitmasks. See PR95528. */
- && (VECTOR_MODE_P (TYPE_MODE (halfvectype))
- || VECTOR_BOOLEAN_TYPE_P (halfvectype))
- && (optab = optab_for_tree_code (VEC_PACK_TRUNC_EXPR,
- halfvectype,
- optab_default))
- && (optab_handler (optab, TYPE_MODE (halfvectype))
- != CODE_FOR_nothing))
- {
- gimple_seq stmts = NULL;
- tree low = gimple_build (&stmts, BIT_FIELD_REF, halfvectype,
- orig[0], TYPE_SIZE (halfvectype),
- bitsize_zero_node);
- tree hig = gimple_build (&stmts, BIT_FIELD_REF, halfvectype,
- orig[0], TYPE_SIZE (halfvectype),
- TYPE_SIZE (halfvectype));
- gsi_insert_seq_before (gsi, stmts, GSI_SAME_STMT);
- gimple_assign_set_rhs_with_ops (gsi, VEC_PACK_TRUNC_EXPR,
- low, hig);
- }
- else
- return false;
- update_stmt (gsi_stmt (*gsi));
- return true;
- }
- if (nelts != refnelts)
- {
- gassign *lowpart
- = gimple_build_assign (make_ssa_name (conv_src_type),
- build3 (BIT_FIELD_REF, conv_src_type,
- orig[0], TYPE_SIZE (conv_src_type),
- bitsize_zero_node));
- gsi_insert_before (gsi, lowpart, GSI_SAME_STMT);
- orig[0] = gimple_assign_lhs (lowpart);
- }
- if (conv_code == ERROR_MARK)
- {
- tree src_type = TREE_TYPE (orig[0]);
- if (!useless_type_conversion_p (type, src_type))
- {
- gcc_assert (known_eq (TYPE_VECTOR_SUBPARTS (type),
- TYPE_VECTOR_SUBPARTS (src_type))
- && useless_type_conversion_p (TREE_TYPE (type),
- TREE_TYPE (src_type)));
- tree rhs = build1 (VIEW_CONVERT_EXPR, type, orig[0]);
- orig[0] = make_ssa_name (type);
- gassign *assign = gimple_build_assign (orig[0], rhs);
- gsi_insert_before (gsi, assign, GSI_SAME_STMT);
- }
- gimple_assign_set_rhs_from_tree (gsi, orig[0]);
- }
- else
- gimple_assign_set_rhs_with_ops (gsi, conv_code, orig[0],
- NULL_TREE, NULL_TREE);
- }
- else
- {
- /* If we combine a vector with a non-vector avoid cases where
- we'll obviously end up with more GIMPLE stmts which is when
- we'll later not fold this to a single insert into the vector
- and we had a single extract originally. See PR92819. */
- if (nelts == 2
- && refnelts > 2
- && orig[1] == error_mark_node
- && !maybe_blend[0])
- return false;
- tree mask_type, perm_type, conv_src_type;
- perm_type = TREE_TYPE (orig[0]);
- conv_src_type = (nelts == refnelts
- ? perm_type
- : build_vector_type (TREE_TYPE (perm_type), nelts));
- if (conv_code != ERROR_MARK
- && !supportable_convert_operation (conv_code, type, conv_src_type,
- &conv_code))
- return false;
-
- /* Now that we know the number of elements of the source build the
- permute vector.
- ??? When the second vector has constant values we can shuffle
- it and its source indexes to make the permutation supported.
- For now it mimics a blend. */
- vec_perm_builder sel (refnelts, refnelts, 1);
- bool all_same_p = true;
- for (i = 0; i < elts.length (); ++i)
- {
- sel.quick_push (elts[i].second + elts[i].first * refnelts);
- all_same_p &= known_eq (sel[i], sel[0]);
- }
- /* And fill the tail with "something". It's really don't care,
- and ideally we'd allow VEC_PERM to have a smaller destination
- vector. As a heuristic:
-
- (a) if what we have so far duplicates a single element, make the
- tail do the same
-
- (b) otherwise preserve a uniform orig[0]. This facilitates
- later pattern-matching of VEC_PERM_EXPR to a BIT_INSERT_EXPR. */
- for (; i < refnelts; ++i)
- sel.quick_push (all_same_p
- ? sel[0]
- : (elts[0].second == 0 && elts[0].first == 0
- ? 0 : refnelts) + i);
- vec_perm_indices indices (sel, orig[1] ? 2 : 1, refnelts);
- if (!can_vec_perm_const_p (TYPE_MODE (perm_type), indices))
- return false;
- mask_type
- = build_vector_type (build_nonstandard_integer_type (elem_size, 1),
- refnelts);
- if (GET_MODE_CLASS (TYPE_MODE (mask_type)) != MODE_VECTOR_INT
- || maybe_ne (GET_MODE_SIZE (TYPE_MODE (mask_type)),
- GET_MODE_SIZE (TYPE_MODE (perm_type))))
- return false;
- tree op2 = vec_perm_indices_to_tree (mask_type, indices);
- bool converted_orig1 = false;
- gimple_seq stmts = NULL;
- if (!orig[1])
- orig[1] = orig[0];
- else if (orig[1] == error_mark_node
- && one_nonconstant)
- {
- /* ??? We can see if we can safely convert to the original
- element type. */
- converted_orig1 = conv_code != ERROR_MARK;
- orig[1] = gimple_build_vector_from_val (&stmts, UNKNOWN_LOCATION,
- converted_orig1
- ? type : perm_type,
- one_nonconstant);
- }
- else if (orig[1] == error_mark_node)
- {
- /* ??? See if we can convert the vector to the original type. */
- converted_orig1 = conv_code != ERROR_MARK;
- unsigned n = converted_orig1 ? nelts : refnelts;
- tree_vector_builder vec (converted_orig1
- ? type : perm_type, n, 1);
- for (unsigned i = 0; i < n; ++i)
- if (i < nelts && constants[i])
- vec.quick_push (constants[i]);
- else
- /* ??? Push a don't-care value. */
- vec.quick_push (one_constant);
- orig[1] = vec.build ();
- }
- tree blend_op2 = NULL_TREE;
- if (converted_orig1)
- {
- /* Make sure we can do a blend in the target type. */
- vec_perm_builder sel (nelts, nelts, 1);
- for (i = 0; i < elts.length (); ++i)
- sel.quick_push (elts[i].first
- ? elts[i].second + nelts : i);
- vec_perm_indices indices (sel, 2, nelts);
- if (!can_vec_perm_const_p (TYPE_MODE (type), indices))
- return false;
- mask_type
- = build_vector_type (build_nonstandard_integer_type (elem_size, 1),
- nelts);
- if (GET_MODE_CLASS (TYPE_MODE (mask_type)) != MODE_VECTOR_INT
- || maybe_ne (GET_MODE_SIZE (TYPE_MODE (mask_type)),
- GET_MODE_SIZE (TYPE_MODE (type))))
- return false;
- blend_op2 = vec_perm_indices_to_tree (mask_type, indices);
- }
- tree orig1_for_perm
- = converted_orig1 ? build_zero_cst (perm_type) : orig[1];
- tree res = gimple_build (&stmts, VEC_PERM_EXPR, perm_type,
- orig[0], orig1_for_perm, op2);
- if (nelts != refnelts)
- res = gimple_build (&stmts, BIT_FIELD_REF,
- conv_code != ERROR_MARK ? conv_src_type : type,
- res, TYPE_SIZE (type), bitsize_zero_node);
- if (conv_code != ERROR_MARK)
- res = gimple_build (&stmts, conv_code, type, res);
- else if (!useless_type_conversion_p (type, TREE_TYPE (res)))
- {
- gcc_assert (known_eq (TYPE_VECTOR_SUBPARTS (type),
- TYPE_VECTOR_SUBPARTS (perm_type))
- && useless_type_conversion_p (TREE_TYPE (type),
- TREE_TYPE (perm_type)));
- res = gimple_build (&stmts, VIEW_CONVERT_EXPR, type, res);
- }
- /* Blend in the actual constant. */
- if (converted_orig1)
- res = gimple_build (&stmts, VEC_PERM_EXPR, type,
- res, orig[1], blend_op2);
- gsi_insert_seq_before (gsi, stmts, GSI_SAME_STMT);
- gimple_assign_set_rhs_with_ops (gsi, SSA_NAME, res);
- }
- update_stmt (gsi_stmt (*gsi));
- return true;
-}
-
-
-/* Rewrite the vector load at *GSI to component-wise loads if the load
- is only used in BIT_FIELD_REF extractions with eventual intermediate
- widening. */
-
-static void
-optimize_vector_load (gimple_stmt_iterator *gsi)
-{
- gimple *stmt = gsi_stmt (*gsi);
- tree lhs = gimple_assign_lhs (stmt);
- tree rhs = gimple_assign_rhs1 (stmt);
-
- /* Gather BIT_FIELD_REFs to rewrite, looking through
- VEC_UNPACK_{LO,HI}_EXPR. */
- use_operand_p use_p;
- imm_use_iterator iter;
- bool rewrite = true;
- auto_vec<gimple *, 8> bf_stmts;
- auto_vec<tree, 8> worklist;
- worklist.quick_push (lhs);
- do
- {
- tree def = worklist.pop ();
- unsigned HOST_WIDE_INT def_eltsize
- = TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (TREE_TYPE (def))));
- FOR_EACH_IMM_USE_FAST (use_p, iter, def)
- {
- gimple *use_stmt = USE_STMT (use_p);
- if (is_gimple_debug (use_stmt))
- continue;
- if (!is_gimple_assign (use_stmt))
- {
- rewrite = false;
- break;
- }
- enum tree_code use_code = gimple_assign_rhs_code (use_stmt);
- tree use_rhs = gimple_assign_rhs1 (use_stmt);
- if (use_code == BIT_FIELD_REF
- && TREE_OPERAND (use_rhs, 0) == def
- /* If its on the VEC_UNPACK_{HI,LO}_EXPR
- def need to verify it is element aligned. */
- && (def == lhs
- || (known_eq (bit_field_size (use_rhs), def_eltsize)
- && constant_multiple_p (bit_field_offset (use_rhs),
- def_eltsize))))
- {
- bf_stmts.safe_push (use_stmt);
- continue;
- }
- /* Walk through one level of VEC_UNPACK_{LO,HI}_EXPR. */
- if (def == lhs
- && (use_code == VEC_UNPACK_HI_EXPR
- || use_code == VEC_UNPACK_LO_EXPR)
- && use_rhs == lhs)
- {
- worklist.safe_push (gimple_assign_lhs (use_stmt));
- continue;
- }
- rewrite = false;
- break;
- }
- if (!rewrite)
- break;
- }
- while (!worklist.is_empty ());
-
- if (!rewrite)
- {
- gsi_next (gsi);
- return;
- }
- /* We now have all ultimate uses of the load to rewrite in bf_stmts. */
-
- /* Prepare the original ref to be wrapped in adjusted BIT_FIELD_REFs.
- For TARGET_MEM_REFs we have to separate the LEA from the reference. */
- tree load_rhs = rhs;
- if (TREE_CODE (load_rhs) == TARGET_MEM_REF)
- {
- if (TREE_CODE (TREE_OPERAND (load_rhs, 0)) == ADDR_EXPR)
- mark_addressable (TREE_OPERAND (TREE_OPERAND (load_rhs, 0), 0));
- tree tem = make_ssa_name (TREE_TYPE (TREE_OPERAND (load_rhs, 0)));
- gimple *new_stmt
- = gimple_build_assign (tem, build1 (ADDR_EXPR, TREE_TYPE (tem),
- unshare_expr (load_rhs)));
- gsi_insert_before (gsi, new_stmt, GSI_SAME_STMT);
- load_rhs = build2_loc (EXPR_LOCATION (load_rhs),
- MEM_REF, TREE_TYPE (load_rhs), tem,
- build_int_cst
- (TREE_TYPE (TREE_OPERAND (load_rhs, 1)), 0));
- }
-
- /* Rewrite the BIT_FIELD_REFs to be actual loads, re-emitting them at
- the place of the original load. */
- for (gimple *use_stmt : bf_stmts)
- {
- tree bfr = gimple_assign_rhs1 (use_stmt);
- tree new_rhs = unshare_expr (load_rhs);
- if (TREE_OPERAND (bfr, 0) != lhs)
- {
- /* When the BIT_FIELD_REF is on the promoted vector we have to
- adjust it and emit a conversion afterwards. */
- gimple *def_stmt
- = SSA_NAME_DEF_STMT (TREE_OPERAND (bfr, 0));
- enum tree_code def_code
- = gimple_assign_rhs_code (def_stmt);
-
- /* The adjusted BIT_FIELD_REF is of the promotion source
- vector size and at half of the offset... */
- new_rhs = fold_build3 (BIT_FIELD_REF,
- TREE_TYPE (TREE_TYPE (lhs)),
- new_rhs,
- TYPE_SIZE (TREE_TYPE (TREE_TYPE (lhs))),
- size_binop (EXACT_DIV_EXPR,
- TREE_OPERAND (bfr, 2),
- bitsize_int (2)));
- /* ... and offsetted by half of the vector if VEC_UNPACK_HI_EXPR. */
- if (def_code == (!BYTES_BIG_ENDIAN
- ? VEC_UNPACK_HI_EXPR : VEC_UNPACK_LO_EXPR))
- TREE_OPERAND (new_rhs, 2)
- = size_binop (PLUS_EXPR, TREE_OPERAND (new_rhs, 2),
- size_binop (EXACT_DIV_EXPR,
- TYPE_SIZE (TREE_TYPE (lhs)),
- bitsize_int (2)));
- tree tem = make_ssa_name (TREE_TYPE (TREE_TYPE (lhs)));
- gimple *new_stmt = gimple_build_assign (tem, new_rhs);
- location_t loc = gimple_location (use_stmt);
- gimple_set_location (new_stmt, loc);
- gsi_insert_before (gsi, new_stmt, GSI_SAME_STMT);
- /* Perform scalar promotion. */
- new_stmt = gimple_build_assign (gimple_assign_lhs (use_stmt),
- NOP_EXPR, tem);
- gimple_set_location (new_stmt, loc);
- gsi_insert_before (gsi, new_stmt, GSI_SAME_STMT);
- }
- else
- {
- /* When the BIT_FIELD_REF is on the original load result
- we can just wrap that. */
- tree new_rhs = fold_build3 (BIT_FIELD_REF, TREE_TYPE (bfr),
- unshare_expr (load_rhs),
- TREE_OPERAND (bfr, 1),
- TREE_OPERAND (bfr, 2));
- gimple *new_stmt = gimple_build_assign (gimple_assign_lhs (use_stmt),
- new_rhs);
- location_t loc = gimple_location (use_stmt);
- gimple_set_location (new_stmt, loc);
- gsi_insert_before (gsi, new_stmt, GSI_SAME_STMT);
- }
- gimple_stmt_iterator gsi2 = gsi_for_stmt (use_stmt);
- unlink_stmt_vdef (use_stmt);
- gsi_remove (&gsi2, true);
- }
-
- /* Finally get rid of the intermediate stmts. */
- gimple *use_stmt;
- FOR_EACH_IMM_USE_STMT (use_stmt, iter, lhs)
- {
- if (is_gimple_debug (use_stmt))
- {
- if (gimple_debug_bind_p (use_stmt))
- {
- gimple_debug_bind_reset_value (use_stmt);
- update_stmt (use_stmt);
- }
- continue;
- }
- gimple_stmt_iterator gsi2 = gsi_for_stmt (use_stmt);
- unlink_stmt_vdef (use_stmt);
- release_defs (use_stmt);
- gsi_remove (&gsi2, true);
- }
- /* And the original load. */
- release_defs (stmt);
- gsi_remove (gsi, true);
-}
-
-
-/* Primitive "lattice" function for gimple_simplify. */
-
-static tree
-fwprop_ssa_val (tree name)
-{
- /* First valueize NAME. */
- if (TREE_CODE (name) == SSA_NAME
- && SSA_NAME_VERSION (name) < lattice.length ())
- {
- tree val = lattice[SSA_NAME_VERSION (name)];
- if (val)
- name = val;
- }
- /* We continue matching along SSA use-def edges for SSA names
- that are not single-use. Currently there are no patterns
- that would cause any issues with that. */
- return name;
-}
-
-/* Main entry point for the forward propagation and statement combine
- optimizer. */
-
-namespace {
-
-const pass_data pass_data_forwprop =
-{
- GIMPLE_PASS, /* type */
- "forwprop", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_TREE_FORWPROP, /* tv_id */
- ( PROP_cfg | PROP_ssa ), /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- TODO_update_ssa, /* todo_flags_finish */
-};
-
-class pass_forwprop : public gimple_opt_pass
-{
-public:
- pass_forwprop (gcc::context *ctxt)
- : gimple_opt_pass (pass_data_forwprop, ctxt)
- {}
-
- /* opt_pass methods: */
- opt_pass * clone () { return new pass_forwprop (m_ctxt); }
- virtual bool gate (function *) { return flag_tree_forwprop; }
- virtual unsigned int execute (function *);
-
-}; // class pass_forwprop
-
-unsigned int
-pass_forwprop::execute (function *fun)
-{
- unsigned int todoflags = 0;
-
- cfg_changed = false;
-
- /* Combine stmts with the stmts defining their operands. Do that
- in an order that guarantees visiting SSA defs before SSA uses. */
- lattice.create (num_ssa_names);
- lattice.quick_grow_cleared (num_ssa_names);
- int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (fun));
- int postorder_num = pre_and_rev_post_order_compute_fn (cfun, NULL,
- postorder, false);
- auto_vec<gimple *, 4> to_fixup;
- auto_vec<gimple *, 32> to_remove;
- to_purge = BITMAP_ALLOC (NULL);
- for (int i = 0; i < postorder_num; ++i)
- {
- gimple_stmt_iterator gsi;
- basic_block bb = BASIC_BLOCK_FOR_FN (fun, postorder[i]);
-
- /* Record degenerate PHIs in the lattice. */
- for (gphi_iterator si = gsi_start_phis (bb); !gsi_end_p (si);
- gsi_next (&si))
- {
- gphi *phi = si.phi ();
- tree res = gimple_phi_result (phi);
- if (virtual_operand_p (res))
- continue;
-
- use_operand_p use_p;
- ssa_op_iter it;
- tree first = NULL_TREE;
- bool all_same = true;
- FOR_EACH_PHI_ARG (use_p, phi, it, SSA_OP_USE)
- {
- tree use = USE_FROM_PTR (use_p);
- if (! first)
- first = use;
- else if (! operand_equal_p (first, use, 0))
- {
- all_same = false;
- break;
- }
- }
- if (all_same)
- {
- if (may_propagate_copy (res, first))
- to_remove.safe_push (phi);
- fwprop_set_lattice_val (res, first);
- }
- }
-
- /* Apply forward propagation to all stmts in the basic-block.
- Note we update GSI within the loop as necessary. */
- for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
- {
- gimple *stmt = gsi_stmt (gsi);
- tree lhs, rhs;
- enum tree_code code;
-
- if (!is_gimple_assign (stmt))
- {
- gsi_next (&gsi);
- continue;
- }
-
- lhs = gimple_assign_lhs (stmt);
- rhs = gimple_assign_rhs1 (stmt);
- code = gimple_assign_rhs_code (stmt);
- if (TREE_CODE (lhs) != SSA_NAME
- || has_zero_uses (lhs))
- {
- gsi_next (&gsi);
- continue;
- }
-
- /* If this statement sets an SSA_NAME to an address,
- try to propagate the address into the uses of the SSA_NAME. */
- if ((code == ADDR_EXPR
- /* Handle pointer conversions on invariant addresses
- as well, as this is valid gimple. */
- || (CONVERT_EXPR_CODE_P (code)
- && TREE_CODE (rhs) == ADDR_EXPR
- && POINTER_TYPE_P (TREE_TYPE (lhs))))
- && TREE_CODE (TREE_OPERAND (rhs, 0)) != TARGET_MEM_REF)
- {
- tree base = get_base_address (TREE_OPERAND (rhs, 0));
- if ((!base
- || !DECL_P (base)
- || decl_address_invariant_p (base))
- && !stmt_references_abnormal_ssa_name (stmt)
- && forward_propagate_addr_expr (lhs, rhs, true))
- {
- fwprop_invalidate_lattice (gimple_get_lhs (stmt));
- release_defs (stmt);
- gsi_remove (&gsi, true);
- }
- else
- gsi_next (&gsi);
- }
- else if (code == POINTER_PLUS_EXPR)
- {
- tree off = gimple_assign_rhs2 (stmt);
- if (TREE_CODE (off) == INTEGER_CST
- && can_propagate_from (stmt)
- && !simple_iv_increment_p (stmt)
- /* ??? Better adjust the interface to that function
- instead of building new trees here. */
- && forward_propagate_addr_expr
- (lhs,
- build1_loc (gimple_location (stmt),
- ADDR_EXPR, TREE_TYPE (rhs),
- fold_build2 (MEM_REF,
- TREE_TYPE (TREE_TYPE (rhs)),
- rhs,
- fold_convert (ptr_type_node,
- off))), true))
- {
- fwprop_invalidate_lattice (gimple_get_lhs (stmt));
- release_defs (stmt);
- gsi_remove (&gsi, true);
- }
- else if (is_gimple_min_invariant (rhs))
- {
- /* Make sure to fold &a[0] + off_1 here. */
- fold_stmt_inplace (&gsi);
- update_stmt (stmt);
- if (gimple_assign_rhs_code (stmt) == POINTER_PLUS_EXPR)
- gsi_next (&gsi);
- }
- else
- gsi_next (&gsi);
- }
- else if (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE
- && gimple_assign_load_p (stmt)
- && !gimple_has_volatile_ops (stmt)
- && (TREE_CODE (gimple_assign_rhs1 (stmt))
- != TARGET_MEM_REF)
- && !stmt_can_throw_internal (cfun, stmt))
- {
- /* Rewrite loads used only in real/imagpart extractions to
- component-wise loads. */
- use_operand_p use_p;
- imm_use_iterator iter;
- bool rewrite = true;
- FOR_EACH_IMM_USE_FAST (use_p, iter, lhs)
- {
- gimple *use_stmt = USE_STMT (use_p);
- if (is_gimple_debug (use_stmt))
- continue;
- if (!is_gimple_assign (use_stmt)
- || (gimple_assign_rhs_code (use_stmt) != REALPART_EXPR
- && gimple_assign_rhs_code (use_stmt) != IMAGPART_EXPR)
- || TREE_OPERAND (gimple_assign_rhs1 (use_stmt), 0) != lhs)
- {
- rewrite = false;
- break;
- }
- }
- if (rewrite)
- {
- gimple *use_stmt;
- FOR_EACH_IMM_USE_STMT (use_stmt, iter, lhs)
- {
- if (is_gimple_debug (use_stmt))
- {
- if (gimple_debug_bind_p (use_stmt))
- {
- gimple_debug_bind_reset_value (use_stmt);
- update_stmt (use_stmt);
- }
- continue;
- }
-
- tree new_rhs = build1 (gimple_assign_rhs_code (use_stmt),
- TREE_TYPE (TREE_TYPE (rhs)),
- unshare_expr (rhs));
- gimple *new_stmt
- = gimple_build_assign (gimple_assign_lhs (use_stmt),
- new_rhs);
-
- location_t loc = gimple_location (use_stmt);
- gimple_set_location (new_stmt, loc);
- gimple_stmt_iterator gsi2 = gsi_for_stmt (use_stmt);
- unlink_stmt_vdef (use_stmt);
- gsi_remove (&gsi2, true);
-
- gsi_insert_before (&gsi, new_stmt, GSI_SAME_STMT);
- }
-
- release_defs (stmt);
- gsi_remove (&gsi, true);
- }
- else
- gsi_next (&gsi);
- }
- else if (TREE_CODE (TREE_TYPE (lhs)) == VECTOR_TYPE
- && (TYPE_MODE (TREE_TYPE (lhs)) == BLKmode
- /* After vector lowering rewrite all loads, but
- initially do not since this conflicts with
- vector CONSTRUCTOR to shuffle optimization. */
- || (fun->curr_properties & PROP_gimple_lvec))
- && gimple_assign_load_p (stmt)
- && !gimple_has_volatile_ops (stmt)
- && !stmt_can_throw_internal (cfun, stmt)
- && (!VAR_P (rhs) || !DECL_HARD_REGISTER (rhs)))
- optimize_vector_load (&gsi);
-
- else if (code == COMPLEX_EXPR)
- {
- /* Rewrite stores of a single-use complex build expression
- to component-wise stores. */
- use_operand_p use_p;
- gimple *use_stmt;
- if (single_imm_use (lhs, &use_p, &use_stmt)
- && gimple_store_p (use_stmt)
- && !gimple_has_volatile_ops (use_stmt)
- && is_gimple_assign (use_stmt)
- && (TREE_CODE (gimple_assign_lhs (use_stmt))
- != TARGET_MEM_REF))
- {
- tree use_lhs = gimple_assign_lhs (use_stmt);
- if (auto_var_p (use_lhs))
- DECL_NOT_GIMPLE_REG_P (use_lhs) = 1;
- tree new_lhs = build1 (REALPART_EXPR,
- TREE_TYPE (TREE_TYPE (use_lhs)),
- unshare_expr (use_lhs));
- gimple *new_stmt = gimple_build_assign (new_lhs, rhs);
- location_t loc = gimple_location (use_stmt);
- gimple_set_location (new_stmt, loc);
- gimple_set_vuse (new_stmt, gimple_vuse (use_stmt));
- gimple_set_vdef (new_stmt, make_ssa_name (gimple_vop (cfun)));
- SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt;
- gimple_set_vuse (use_stmt, gimple_vdef (new_stmt));
- gimple_stmt_iterator gsi2 = gsi_for_stmt (use_stmt);
- gsi_insert_before (&gsi2, new_stmt, GSI_SAME_STMT);
-
- new_lhs = build1 (IMAGPART_EXPR,
- TREE_TYPE (TREE_TYPE (use_lhs)),
- unshare_expr (use_lhs));
- gimple_assign_set_lhs (use_stmt, new_lhs);
- gimple_assign_set_rhs1 (use_stmt, gimple_assign_rhs2 (stmt));
- update_stmt (use_stmt);
-
- release_defs (stmt);
- gsi_remove (&gsi, true);
- }
- else
- gsi_next (&gsi);
- }
- else if (code == CONSTRUCTOR
- && VECTOR_TYPE_P (TREE_TYPE (rhs))
- && TYPE_MODE (TREE_TYPE (rhs)) == BLKmode
- && CONSTRUCTOR_NELTS (rhs) > 0
- && (!VECTOR_TYPE_P (TREE_TYPE (CONSTRUCTOR_ELT (rhs, 0)->value))
- || (TYPE_MODE (TREE_TYPE (CONSTRUCTOR_ELT (rhs, 0)->value))
- != BLKmode)))
- {
- /* Rewrite stores of a single-use vector constructors
- to component-wise stores if the mode isn't supported. */
- use_operand_p use_p;
- gimple *use_stmt;
- if (single_imm_use (lhs, &use_p, &use_stmt)
- && gimple_store_p (use_stmt)
- && !gimple_has_volatile_ops (use_stmt)
- && !stmt_can_throw_internal (cfun, use_stmt)
- && is_gimple_assign (use_stmt)
- && (TREE_CODE (gimple_assign_lhs (use_stmt))
- != TARGET_MEM_REF))
- {
- tree elt_t = TREE_TYPE (CONSTRUCTOR_ELT (rhs, 0)->value);
- unsigned HOST_WIDE_INT elt_w
- = tree_to_uhwi (TYPE_SIZE (elt_t));
- unsigned HOST_WIDE_INT n
- = tree_to_uhwi (TYPE_SIZE (TREE_TYPE (rhs)));
- tree use_lhs = gimple_assign_lhs (use_stmt);
- if (auto_var_p (use_lhs))
- DECL_NOT_GIMPLE_REG_P (use_lhs) = 1;
- for (unsigned HOST_WIDE_INT bi = 0; bi < n; bi += elt_w)
- {
- unsigned HOST_WIDE_INT ci = bi / elt_w;
- tree new_rhs;
- if (ci < CONSTRUCTOR_NELTS (rhs))
- new_rhs = CONSTRUCTOR_ELT (rhs, ci)->value;
- else
- new_rhs = build_zero_cst (elt_t);
- tree new_lhs = build3 (BIT_FIELD_REF,
- elt_t,
- unshare_expr (use_lhs),
- bitsize_int (elt_w),
- bitsize_int (bi));
- gimple *new_stmt = gimple_build_assign (new_lhs, new_rhs);
- location_t loc = gimple_location (use_stmt);
- gimple_set_location (new_stmt, loc);
- gimple_set_vuse (new_stmt, gimple_vuse (use_stmt));
- gimple_set_vdef (new_stmt,
- make_ssa_name (gimple_vop (cfun)));
- SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt;
- gimple_set_vuse (use_stmt, gimple_vdef (new_stmt));
- gimple_stmt_iterator gsi2 = gsi_for_stmt (use_stmt);
- gsi_insert_before (&gsi2, new_stmt, GSI_SAME_STMT);
- }
- gimple_stmt_iterator gsi2 = gsi_for_stmt (use_stmt);
- unlink_stmt_vdef (use_stmt);
- release_defs (use_stmt);
- gsi_remove (&gsi2, true);
- release_defs (stmt);
- gsi_remove (&gsi, true);
- }
- else
- gsi_next (&gsi);
- }
- else
- gsi_next (&gsi);
- }
-
- /* Combine stmts with the stmts defining their operands.
- Note we update GSI within the loop as necessary. */
- for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
- {
- gimple *stmt = gsi_stmt (gsi);
-
- /* Mark stmt as potentially needing revisiting. */
- gimple_set_plf (stmt, GF_PLF_1, false);
-
- /* Substitute from our lattice. We need to do so only once. */
- bool substituted_p = false;
- use_operand_p usep;
- ssa_op_iter iter;
- FOR_EACH_SSA_USE_OPERAND (usep, stmt, iter, SSA_OP_USE)
- {
- tree use = USE_FROM_PTR (usep);
- tree val = fwprop_ssa_val (use);
- if (val && val != use && may_propagate_copy (use, val))
- {
- propagate_value (usep, val);
- substituted_p = true;
- }
- }
- if (substituted_p
- && is_gimple_assign (stmt)
- && gimple_assign_rhs_code (stmt) == ADDR_EXPR)
- recompute_tree_invariant_for_addr_expr (gimple_assign_rhs1 (stmt));
-
- bool changed;
- do
- {
- gimple *orig_stmt = stmt = gsi_stmt (gsi);
- bool was_noreturn = (is_gimple_call (stmt)
- && gimple_call_noreturn_p (stmt));
- changed = false;
-
- if (fold_stmt (&gsi, fwprop_ssa_val))
- {
- changed = true;
- stmt = gsi_stmt (gsi);
- /* Cleanup the CFG if we simplified a condition to
- true or false. */
- if (gcond *cond = dyn_cast <gcond *> (stmt))
- if (gimple_cond_true_p (cond)
- || gimple_cond_false_p (cond))
- cfg_changed = true;
- }
-
- if (changed || substituted_p)
- {
- if (maybe_clean_or_replace_eh_stmt (orig_stmt, stmt))
- bitmap_set_bit (to_purge, bb->index);
- if (!was_noreturn
- && is_gimple_call (stmt) && gimple_call_noreturn_p (stmt))
- to_fixup.safe_push (stmt);
- update_stmt (stmt);
- substituted_p = false;
- }
-
- switch (gimple_code (stmt))
- {
- case GIMPLE_ASSIGN:
- {
- tree rhs1 = gimple_assign_rhs1 (stmt);
- enum tree_code code = gimple_assign_rhs_code (stmt);
-
- if (code == COND_EXPR)
- {
- /* In this case the entire COND_EXPR is in rhs1. */
- if (forward_propagate_into_cond (&gsi))
- {
- changed = true;
- stmt = gsi_stmt (gsi);
- }
- }
- else if (TREE_CODE_CLASS (code) == tcc_comparison)
- {
- int did_something;
- did_something = forward_propagate_into_comparison (&gsi);
- if (maybe_clean_or_replace_eh_stmt (stmt, gsi_stmt (gsi)))
- bitmap_set_bit (to_purge, bb->index);
- if (did_something == 2)
- cfg_changed = true;
- changed = did_something != 0;
- }
- else if ((code == PLUS_EXPR
- || code == BIT_IOR_EXPR
- || code == BIT_XOR_EXPR)
- && simplify_rotate (&gsi))
- changed = true;
- else if (code == VEC_PERM_EXPR)
- {
- int did_something = simplify_permutation (&gsi);
- if (did_something == 2)
- cfg_changed = true;
- changed = did_something != 0;
- }
- else if (code == BIT_FIELD_REF)
- changed = simplify_bitfield_ref (&gsi);
- else if (code == CONSTRUCTOR
- && TREE_CODE (TREE_TYPE (rhs1)) == VECTOR_TYPE)
- changed = simplify_vector_constructor (&gsi);
- else if (code == ARRAY_REF)
- changed = simplify_count_trailing_zeroes (&gsi);
- break;
- }
-
- case GIMPLE_SWITCH:
- changed = simplify_gimple_switch (as_a <gswitch *> (stmt));
- break;
-
- case GIMPLE_COND:
- {
- int did_something = forward_propagate_into_gimple_cond
- (as_a <gcond *> (stmt));
- if (did_something == 2)
- cfg_changed = true;
- changed = did_something != 0;
- break;
- }
-
- case GIMPLE_CALL:
- {
- tree callee = gimple_call_fndecl (stmt);
- if (callee != NULL_TREE
- && fndecl_built_in_p (callee, BUILT_IN_NORMAL))
- changed = simplify_builtin_call (&gsi, callee);
- break;
- }
-
- default:;
- }
-
- if (changed)
- {
- /* If the stmt changed then re-visit it and the statements
- inserted before it. */
- for (; !gsi_end_p (gsi); gsi_prev (&gsi))
- if (gimple_plf (gsi_stmt (gsi), GF_PLF_1))
- break;
- if (gsi_end_p (gsi))
- gsi = gsi_start_bb (bb);
- else
- gsi_next (&gsi);
- }
- }
- while (changed);
-
- /* Stmt no longer needs to be revisited. */
- stmt = gsi_stmt (gsi);
- gcc_checking_assert (!gimple_plf (stmt, GF_PLF_1));
- gimple_set_plf (stmt, GF_PLF_1, true);
-
- /* Fill up the lattice. */
- if (gimple_assign_single_p (stmt))
- {
- tree lhs = gimple_assign_lhs (stmt);
- tree rhs = gimple_assign_rhs1 (stmt);
- if (TREE_CODE (lhs) == SSA_NAME)
- {
- tree val = lhs;
- if (TREE_CODE (rhs) == SSA_NAME)
- val = fwprop_ssa_val (rhs);
- else if (is_gimple_min_invariant (rhs))
- val = rhs;
- /* If we can propagate the lattice-value mark the
- stmt for removal. */
- if (val != lhs
- && may_propagate_copy (lhs, val))
- to_remove.safe_push (stmt);
- fwprop_set_lattice_val (lhs, val);
- }
- }
- else if (gimple_nop_p (stmt))
- to_remove.safe_push (stmt);
- }
-
- /* Substitute in destination PHI arguments. */
- edge_iterator ei;
- edge e;
- FOR_EACH_EDGE (e, ei, bb->succs)
- for (gphi_iterator gsi = gsi_start_phis (e->dest);
- !gsi_end_p (gsi); gsi_next (&gsi))
- {
- gphi *phi = gsi.phi ();
- use_operand_p use_p = PHI_ARG_DEF_PTR_FROM_EDGE (phi, e);
- tree arg = USE_FROM_PTR (use_p);
- if (TREE_CODE (arg) != SSA_NAME
- || virtual_operand_p (arg))
- continue;
- tree val = fwprop_ssa_val (arg);
- if (val != arg
- && may_propagate_copy (arg, val))
- propagate_value (use_p, val);
- }
- }
- free (postorder);
- lattice.release ();
-
- /* Remove stmts in reverse order to make debug stmt creation possible. */
- while (!to_remove.is_empty())
- {
- gimple *stmt = to_remove.pop ();
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Removing dead stmt ");
- print_gimple_stmt (dump_file, stmt, 0);
- fprintf (dump_file, "\n");
- }
- gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
- if (gimple_code (stmt) == GIMPLE_PHI)
- remove_phi_node (&gsi, true);
- else
- {
- unlink_stmt_vdef (stmt);
- gsi_remove (&gsi, true);
- release_defs (stmt);
- }
- }
-
- /* Fixup stmts that became noreturn calls. This may require splitting
- blocks and thus isn't possible during the walk. Do this
- in reverse order so we don't inadvertedly remove a stmt we want to
- fixup by visiting a dominating now noreturn call first. */
- while (!to_fixup.is_empty ())
- {
- gimple *stmt = to_fixup.pop ();
- if (dump_file && dump_flags & TDF_DETAILS)
- {
- fprintf (dump_file, "Fixing up noreturn call ");
- print_gimple_stmt (dump_file, stmt, 0);
- fprintf (dump_file, "\n");
- }
- cfg_changed |= fixup_noreturn_call (stmt);
- }
-
- cfg_changed |= gimple_purge_all_dead_eh_edges (to_purge);
- BITMAP_FREE (to_purge);
-
- if (cfg_changed)
- todoflags |= TODO_cleanup_cfg;
-
- return todoflags;
-}
-
-} // anon namespace
-
-gimple_opt_pass *
-make_pass_forwprop (gcc::context *ctxt)
-{
- return new pass_forwprop (ctxt);
-}
generated by cgit v1.1 at 2025-09-03 12:14:53 +0000