aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-ssa-dce.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-dce.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-dce.c')
-rw-r--r--gcc/tree-ssa-dce.c2063
1 files changed, 0 insertions, 2063 deletions
diff --git a/gcc/tree-ssa-dce.c b/gcc/tree-ssa-dce.c
deleted file mode 100644
index f103487..0000000
--- a/gcc/tree-ssa-dce.c
+++ /dev/null
@@ -1,2063 +0,0 @@
-/* Dead code elimination pass for the GNU compiler.
- Copyright (C) 2002-2022 Free Software Foundation, Inc.
- Contributed by Ben Elliston <bje@redhat.com>
- and Andrew MacLeod <amacleod@redhat.com>
- Adapted to use control dependence by Steven Bosscher, SUSE Labs.
-
-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/>. */
-
-/* Dead code elimination.
-
- References:
-
- Building an Optimizing Compiler,
- Robert Morgan, Butterworth-Heinemann, 1998, Section 8.9.
-
- Advanced Compiler Design and Implementation,
- Steven Muchnick, Morgan Kaufmann, 1997, Section 18.10.
-
- Dead-code elimination is the removal of statements which have no
- impact on the program's output. "Dead statements" have no impact
- on the program's output, while "necessary statements" may have
- impact on the output.
-
- The algorithm consists of three phases:
- 1. Marking as necessary all statements known to be necessary,
- e.g. most function calls, writing a value to memory, etc;
- 2. Propagating necessary statements, e.g., the statements
- giving values to operands in necessary statements; and
- 3. Removing dead statements. */
-
-#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 "gimple-pretty-print.h"
-#include "fold-const.h"
-#include "calls.h"
-#include "cfganal.h"
-#include "tree-eh.h"
-#include "gimplify.h"
-#include "gimple-iterator.h"
-#include "tree-cfg.h"
-#include "tree-ssa-loop-niter.h"
-#include "tree-into-ssa.h"
-#include "tree-dfa.h"
-#include "cfgloop.h"
-#include "tree-scalar-evolution.h"
-#include "tree-ssa-propagate.h"
-#include "gimple-fold.h"
-#include "tree-ssa.h"
-
-static struct stmt_stats
-{
- int total;
- int total_phis;
- int removed;
- int removed_phis;
-} stats;
-
-#define STMT_NECESSARY GF_PLF_1
-
-static vec<gimple *> worklist;
-
-/* Vector indicating an SSA name has already been processed and marked
- as necessary. */
-static sbitmap processed;
-
-/* Vector indicating that the last statement of a basic block has already
- been marked as necessary. */
-static sbitmap last_stmt_necessary;
-
-/* Vector indicating that BB contains statements that are live. */
-static sbitmap bb_contains_live_stmts;
-
-/* Before we can determine whether a control branch is dead, we need to
- compute which blocks are control dependent on which edges.
-
- We expect each block to be control dependent on very few edges so we
- use a bitmap for each block recording its edges. An array holds the
- bitmap. The Ith bit in the bitmap is set if that block is dependent
- on the Ith edge. */
-static control_dependences *cd;
-
-/* Vector indicating that a basic block has already had all the edges
- processed that it is control dependent on. */
-static sbitmap visited_control_parents;
-
-/* TRUE if this pass alters the CFG (by removing control statements).
- FALSE otherwise.
-
- If this pass alters the CFG, then it will arrange for the dominators
- to be recomputed. */
-static bool cfg_altered;
-
-/* When non-NULL holds map from basic block index into the postorder. */
-static int *bb_postorder;
-
-
-/* True if we should treat any stmt with a vdef as necessary. */
-
-static inline bool
-keep_all_vdefs_p ()
-{
- return optimize_debug;
-}
-
-/* If STMT is not already marked necessary, mark it, and add it to the
- worklist if ADD_TO_WORKLIST is true. */
-
-static inline void
-mark_stmt_necessary (gimple *stmt, bool add_to_worklist)
-{
- gcc_assert (stmt);
-
- if (gimple_plf (stmt, STMT_NECESSARY))
- return;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Marking useful stmt: ");
- print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
- fprintf (dump_file, "\n");
- }
-
- gimple_set_plf (stmt, STMT_NECESSARY, true);
- if (add_to_worklist)
- worklist.safe_push (stmt);
- if (add_to_worklist && bb_contains_live_stmts && !is_gimple_debug (stmt))
- bitmap_set_bit (bb_contains_live_stmts, gimple_bb (stmt)->index);
-}
-
-
-/* Mark the statement defining operand OP as necessary. */
-
-static inline void
-mark_operand_necessary (tree op)
-{
- gimple *stmt;
- int ver;
-
- gcc_assert (op);
-
- ver = SSA_NAME_VERSION (op);
- if (bitmap_bit_p (processed, ver))
- {
- stmt = SSA_NAME_DEF_STMT (op);
- gcc_assert (gimple_nop_p (stmt)
- || gimple_plf (stmt, STMT_NECESSARY));
- return;
- }
- bitmap_set_bit (processed, ver);
-
- stmt = SSA_NAME_DEF_STMT (op);
- gcc_assert (stmt);
-
- if (gimple_plf (stmt, STMT_NECESSARY) || gimple_nop_p (stmt))
- return;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "marking necessary through ");
- print_generic_expr (dump_file, op);
- fprintf (dump_file, " stmt ");
- print_gimple_stmt (dump_file, stmt, 0);
- }
-
- gimple_set_plf (stmt, STMT_NECESSARY, true);
- if (bb_contains_live_stmts)
- bitmap_set_bit (bb_contains_live_stmts, gimple_bb (stmt)->index);
- worklist.safe_push (stmt);
-}
-
-
-/* Mark STMT as necessary if it obviously is. Add it to the worklist if
- it can make other statements necessary.
-
- If AGGRESSIVE is false, control statements are conservatively marked as
- necessary. */
-
-static void
-mark_stmt_if_obviously_necessary (gimple *stmt, bool aggressive)
-{
- /* Statements that are implicitly live. Most function calls, asm
- and return statements are required. Labels and GIMPLE_BIND nodes
- are kept because they are control flow, and we have no way of
- knowing whether they can be removed. DCE can eliminate all the
- other statements in a block, and CFG can then remove the block
- and labels. */
- switch (gimple_code (stmt))
- {
- case GIMPLE_PREDICT:
- case GIMPLE_LABEL:
- mark_stmt_necessary (stmt, false);
- return;
-
- case GIMPLE_ASM:
- case GIMPLE_RESX:
- case GIMPLE_RETURN:
- mark_stmt_necessary (stmt, true);
- return;
-
- case GIMPLE_CALL:
- {
- tree callee = gimple_call_fndecl (stmt);
- if (callee != NULL_TREE
- && fndecl_built_in_p (callee, BUILT_IN_NORMAL))
- switch (DECL_FUNCTION_CODE (callee))
- {
- case BUILT_IN_MALLOC:
- case BUILT_IN_ALIGNED_ALLOC:
- case BUILT_IN_CALLOC:
- CASE_BUILT_IN_ALLOCA:
- case BUILT_IN_STRDUP:
- case BUILT_IN_STRNDUP:
- case BUILT_IN_GOMP_ALLOC:
- return;
-
- default:;
- }
-
- if (callee != NULL_TREE
- && flag_allocation_dce
- && DECL_IS_REPLACEABLE_OPERATOR_NEW_P (callee))
- return;
-
- /* IFN_GOACC_LOOP calls are necessary in that they are used to
- represent parameter (i.e. step, bound) of a lowered OpenACC
- partitioned loop. But this kind of partitioned loop might not
- survive from aggressive loop removal for it has loop exit and
- is assumed to be finite. Therefore, we need to explicitly mark
- these calls. (An example is libgomp.oacc-c-c++-common/pr84955.c) */
- if (gimple_call_internal_p (stmt, IFN_GOACC_LOOP))
- {
- mark_stmt_necessary (stmt, true);
- return;
- }
- break;
- }
-
- case GIMPLE_DEBUG:
- /* Debug temps without a value are not useful. ??? If we could
- easily locate the debug temp bind stmt for a use thereof,
- would could refrain from marking all debug temps here, and
- mark them only if they're used. */
- if (gimple_debug_nonbind_marker_p (stmt)
- || !gimple_debug_bind_p (stmt)
- || gimple_debug_bind_has_value_p (stmt)
- || TREE_CODE (gimple_debug_bind_get_var (stmt)) != DEBUG_EXPR_DECL)
- mark_stmt_necessary (stmt, false);
- return;
-
- case GIMPLE_GOTO:
- gcc_assert (!simple_goto_p (stmt));
- mark_stmt_necessary (stmt, true);
- return;
-
- case GIMPLE_COND:
- gcc_assert (EDGE_COUNT (gimple_bb (stmt)->succs) == 2);
- /* Fall through. */
-
- case GIMPLE_SWITCH:
- if (! aggressive)
- mark_stmt_necessary (stmt, true);
- break;
-
- case GIMPLE_ASSIGN:
- if (gimple_clobber_p (stmt))
- return;
- break;
-
- default:
- break;
- }
-
- /* If the statement has volatile operands, it needs to be preserved.
- Same for statements that can alter control flow in unpredictable
- ways. */
- if (gimple_has_side_effects (stmt) || is_ctrl_altering_stmt (stmt))
- {
- mark_stmt_necessary (stmt, true);
- return;
- }
-
- /* If a statement could throw, it can be deemed necessary unless we
- are allowed to remove dead EH. Test this after checking for
- new/delete operators since we always elide their EH. */
- if (!cfun->can_delete_dead_exceptions
- && stmt_could_throw_p (cfun, stmt))
- {
- mark_stmt_necessary (stmt, true);
- return;
- }
-
- if ((gimple_vdef (stmt) && keep_all_vdefs_p ())
- || stmt_may_clobber_global_p (stmt))
- {
- mark_stmt_necessary (stmt, true);
- return;
- }
-
- return;
-}
-
-
-/* Mark the last statement of BB as necessary. */
-
-static void
-mark_last_stmt_necessary (basic_block bb)
-{
- gimple *stmt = last_stmt (bb);
-
- bitmap_set_bit (last_stmt_necessary, bb->index);
- bitmap_set_bit (bb_contains_live_stmts, bb->index);
-
- /* We actually mark the statement only if it is a control statement. */
- if (stmt && is_ctrl_stmt (stmt))
- mark_stmt_necessary (stmt, true);
-}
-
-
-/* Mark control dependent edges of BB as necessary. We have to do this only
- once for each basic block so we set the appropriate bit after we're done.
-
- When IGNORE_SELF is true, ignore BB in the list of control dependences. */
-
-static void
-mark_control_dependent_edges_necessary (basic_block bb, bool ignore_self)
-{
- bitmap_iterator bi;
- unsigned edge_number;
- bool skipped = false;
-
- gcc_assert (bb != EXIT_BLOCK_PTR_FOR_FN (cfun));
-
- if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun))
- return;
-
- EXECUTE_IF_SET_IN_BITMAP (cd->get_edges_dependent_on (bb->index),
- 0, edge_number, bi)
- {
- basic_block cd_bb = cd->get_edge_src (edge_number);
-
- if (ignore_self && cd_bb == bb)
- {
- skipped = true;
- continue;
- }
-
- if (!bitmap_bit_p (last_stmt_necessary, cd_bb->index))
- mark_last_stmt_necessary (cd_bb);
- }
-
- if (!skipped)
- bitmap_set_bit (visited_control_parents, bb->index);
-}
-
-
-/* Find obviously necessary statements. These are things like most function
- calls, and stores to file level variables.
-
- If EL is NULL, control statements are conservatively marked as
- necessary. Otherwise it contains the list of edges used by control
- dependence analysis. */
-
-static void
-find_obviously_necessary_stmts (bool aggressive)
-{
- basic_block bb;
- gimple_stmt_iterator gsi;
- edge e;
- gimple *phi, *stmt;
- int flags;
-
- FOR_EACH_BB_FN (bb, cfun)
- {
- /* PHI nodes are never inherently necessary. */
- for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
- {
- phi = gsi_stmt (gsi);
- gimple_set_plf (phi, STMT_NECESSARY, false);
- }
-
- /* Check all statements in the block. */
- for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
- {
- stmt = gsi_stmt (gsi);
- gimple_set_plf (stmt, STMT_NECESSARY, false);
- mark_stmt_if_obviously_necessary (stmt, aggressive);
- }
- }
-
- /* Pure and const functions are finite and thus have no infinite loops in
- them. */
- flags = flags_from_decl_or_type (current_function_decl);
- if ((flags & (ECF_CONST|ECF_PURE)) && !(flags & ECF_LOOPING_CONST_OR_PURE))
- return;
-
- /* Prevent the empty possibly infinite loops from being removed. This is
- needed to make the logic in remove_dead_stmt work to identify the
- correct edge to keep when removing a controlling condition. */
- if (aggressive)
- {
- if (mark_irreducible_loops ())
- FOR_EACH_BB_FN (bb, cfun)
- {
- edge_iterator ei;
- FOR_EACH_EDGE (e, ei, bb->succs)
- if ((e->flags & EDGE_DFS_BACK)
- && (e->flags & EDGE_IRREDUCIBLE_LOOP))
- {
- if (dump_file)
- fprintf (dump_file, "Marking back edge of irreducible "
- "loop %i->%i\n", e->src->index, e->dest->index);
- mark_control_dependent_edges_necessary (e->dest, false);
- }
- }
-
- for (auto loop : loops_list (cfun, 0))
- /* For loops without an exit do not mark any condition. */
- if (loop->exits->next->e && !finite_loop_p (loop))
- {
- if (dump_file)
- fprintf (dump_file, "cannot prove finiteness of loop %i\n",
- loop->num);
- mark_control_dependent_edges_necessary (loop->latch, false);
- }
- }
-}
-
-
-/* Return true if REF is based on an aliased base, otherwise false. */
-
-static bool
-ref_may_be_aliased (tree ref)
-{
- gcc_assert (TREE_CODE (ref) != WITH_SIZE_EXPR);
- while (handled_component_p (ref))
- ref = TREE_OPERAND (ref, 0);
- if ((TREE_CODE (ref) == MEM_REF || TREE_CODE (ref) == TARGET_MEM_REF)
- && TREE_CODE (TREE_OPERAND (ref, 0)) == ADDR_EXPR)
- ref = TREE_OPERAND (TREE_OPERAND (ref, 0), 0);
- return !(DECL_P (ref)
- && !may_be_aliased (ref));
-}
-
-static bitmap visited = NULL;
-static unsigned int longest_chain = 0;
-static unsigned int total_chain = 0;
-static unsigned int nr_walks = 0;
-static bool chain_ovfl = false;
-
-/* Worker for the walker that marks reaching definitions of REF,
- which is based on a non-aliased decl, necessary. It returns
- true whenever the defining statement of the current VDEF is
- a kill for REF, as no dominating may-defs are necessary for REF
- anymore. DATA points to the basic-block that contains the
- stmt that refers to REF. */
-
-static bool
-mark_aliased_reaching_defs_necessary_1 (ao_ref *ref, tree vdef, void *data)
-{
- gimple *def_stmt = SSA_NAME_DEF_STMT (vdef);
-
- /* All stmts we visit are necessary. */
- if (! gimple_clobber_p (def_stmt))
- mark_operand_necessary (vdef);
-
- /* If the stmt lhs kills ref, then we can stop walking. */
- if (gimple_has_lhs (def_stmt)
- && TREE_CODE (gimple_get_lhs (def_stmt)) != SSA_NAME
- /* The assignment is not necessarily carried out if it can throw
- and we can catch it in the current function where we could inspect
- the previous value.
- ??? We only need to care about the RHS throwing. For aggregate
- assignments or similar calls and non-call exceptions the LHS
- might throw as well. */
- && !stmt_can_throw_internal (cfun, def_stmt))
- {
- tree base, lhs = gimple_get_lhs (def_stmt);
- poly_int64 size, offset, max_size;
- bool reverse;
- ao_ref_base (ref);
- base
- = get_ref_base_and_extent (lhs, &offset, &size, &max_size, &reverse);
- /* We can get MEM[symbol: sZ, index: D.8862_1] here,
- so base == refd->base does not always hold. */
- if (base == ref->base)
- {
- /* For a must-alias check we need to be able to constrain
- the accesses properly. */
- if (known_eq (size, max_size)
- && known_subrange_p (ref->offset, ref->max_size, offset, size))
- return true;
- /* Or they need to be exactly the same. */
- else if (ref->ref
- /* Make sure there is no induction variable involved
- in the references (gcc.c-torture/execute/pr42142.c).
- The simplest way is to check if the kill dominates
- the use. */
- /* But when both are in the same block we cannot
- easily tell whether we came from a backedge
- unless we decide to compute stmt UIDs
- (see PR58246). */
- && (basic_block) data != gimple_bb (def_stmt)
- && dominated_by_p (CDI_DOMINATORS, (basic_block) data,
- gimple_bb (def_stmt))
- && operand_equal_p (ref->ref, lhs, 0))
- return true;
- }
- }
-
- /* Otherwise keep walking. */
- return false;
-}
-
-static void
-mark_aliased_reaching_defs_necessary (gimple *stmt, tree ref)
-{
- /* Should have been caught before calling this function. */
- gcc_checking_assert (!keep_all_vdefs_p ());
-
- unsigned int chain;
- ao_ref refd;
- gcc_assert (!chain_ovfl);
- ao_ref_init (&refd, ref);
- chain = walk_aliased_vdefs (&refd, gimple_vuse (stmt),
- mark_aliased_reaching_defs_necessary_1,
- gimple_bb (stmt), NULL);
- if (chain > longest_chain)
- longest_chain = chain;
- total_chain += chain;
- nr_walks++;
-}
-
-/* Worker for the walker that marks reaching definitions of REF, which
- is not based on a non-aliased decl. For simplicity we need to end
- up marking all may-defs necessary that are not based on a non-aliased
- decl. The only job of this walker is to skip may-defs based on
- a non-aliased decl. */
-
-static bool
-mark_all_reaching_defs_necessary_1 (ao_ref *ref ATTRIBUTE_UNUSED,
- tree vdef, void *data ATTRIBUTE_UNUSED)
-{
- gimple *def_stmt = SSA_NAME_DEF_STMT (vdef);
-
- /* We have to skip already visited (and thus necessary) statements
- to make the chaining work after we dropped back to simple mode. */
- if (chain_ovfl
- && bitmap_bit_p (processed, SSA_NAME_VERSION (vdef)))
- {
- gcc_assert (gimple_nop_p (def_stmt)
- || gimple_plf (def_stmt, STMT_NECESSARY));
- return false;
- }
-
- /* We want to skip stores to non-aliased variables. */
- if (!chain_ovfl
- && gimple_assign_single_p (def_stmt))
- {
- tree lhs = gimple_assign_lhs (def_stmt);
- if (!ref_may_be_aliased (lhs))
- return false;
- }
-
- /* We want to skip statments that do not constitute stores but have
- a virtual definition. */
- if (gcall *call = dyn_cast <gcall *> (def_stmt))
- {
- tree callee = gimple_call_fndecl (call);
- if (callee != NULL_TREE
- && fndecl_built_in_p (callee, BUILT_IN_NORMAL))
- switch (DECL_FUNCTION_CODE (callee))
- {
- case BUILT_IN_MALLOC:
- case BUILT_IN_ALIGNED_ALLOC:
- case BUILT_IN_CALLOC:
- CASE_BUILT_IN_ALLOCA:
- case BUILT_IN_FREE:
- case BUILT_IN_GOMP_ALLOC:
- case BUILT_IN_GOMP_FREE:
- return false;
-
- default:;
- }
-
- if (callee != NULL_TREE
- && (DECL_IS_REPLACEABLE_OPERATOR_NEW_P (callee)
- || DECL_IS_OPERATOR_DELETE_P (callee))
- && gimple_call_from_new_or_delete (call))
- return false;
- }
-
- if (! gimple_clobber_p (def_stmt))
- mark_operand_necessary (vdef);
-
- return false;
-}
-
-static void
-mark_all_reaching_defs_necessary (gimple *stmt)
-{
- /* Should have been caught before calling this function. */
- gcc_checking_assert (!keep_all_vdefs_p ());
- walk_aliased_vdefs (NULL, gimple_vuse (stmt),
- mark_all_reaching_defs_necessary_1, NULL, &visited);
-}
-
-/* Return true for PHI nodes with one or identical arguments
- can be removed. */
-static bool
-degenerate_phi_p (gimple *phi)
-{
- unsigned int i;
- tree op = gimple_phi_arg_def (phi, 0);
- for (i = 1; i < gimple_phi_num_args (phi); i++)
- if (gimple_phi_arg_def (phi, i) != op)
- return false;
- return true;
-}
-
-/* Return that NEW_CALL and DELETE_CALL are a valid pair of new
- and delete operators. */
-
-static bool
-valid_new_delete_pair_p (gimple *new_call, gimple *delete_call)
-{
- tree new_asm = DECL_ASSEMBLER_NAME (gimple_call_fndecl (new_call));
- tree delete_asm = DECL_ASSEMBLER_NAME (gimple_call_fndecl (delete_call));
- return valid_new_delete_pair_p (new_asm, delete_asm);
-}
-
-/* Propagate necessity using the operands of necessary statements.
- Process the uses on each statement in the worklist, and add all
- feeding statements which contribute to the calculation of this
- value to the worklist.
-
- In conservative mode, EL is NULL. */
-
-static void
-propagate_necessity (bool aggressive)
-{
- gimple *stmt;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "\nProcessing worklist:\n");
-
- while (worklist.length () > 0)
- {
- /* Take STMT from worklist. */
- stmt = worklist.pop ();
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "processing: ");
- print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
- fprintf (dump_file, "\n");
- }
-
- if (aggressive)
- {
- /* Mark the last statement of the basic blocks on which the block
- containing STMT is control dependent, but only if we haven't
- already done so. */
- basic_block bb = gimple_bb (stmt);
- if (bb != ENTRY_BLOCK_PTR_FOR_FN (cfun)
- && !bitmap_bit_p (visited_control_parents, bb->index))
- mark_control_dependent_edges_necessary (bb, false);
- }
-
- if (gimple_code (stmt) == GIMPLE_PHI
- /* We do not process virtual PHI nodes nor do we track their
- necessity. */
- && !virtual_operand_p (gimple_phi_result (stmt)))
- {
- /* PHI nodes are somewhat special in that each PHI alternative has
- data and control dependencies. All the statements feeding the
- PHI node's arguments are always necessary. In aggressive mode,
- we also consider the control dependent edges leading to the
- predecessor block associated with each PHI alternative as
- necessary. */
- gphi *phi = as_a <gphi *> (stmt);
- size_t k;
-
- for (k = 0; k < gimple_phi_num_args (stmt); k++)
- {
- tree arg = PHI_ARG_DEF (stmt, k);
- if (TREE_CODE (arg) == SSA_NAME)
- mark_operand_necessary (arg);
- }
-
- /* For PHI operands it matters from where the control flow arrives
- to the BB. Consider the following example:
-
- a=exp1;
- b=exp2;
- if (test)
- ;
- else
- ;
- c=PHI(a,b)
-
- We need to mark control dependence of the empty basic blocks, since they
- contains computation of PHI operands.
-
- Doing so is too restrictive in the case the predecestor block is in
- the loop. Consider:
-
- if (b)
- {
- int i;
- for (i = 0; i<1000; ++i)
- ;
- j = 0;
- }
- return j;
-
- There is PHI for J in the BB containing return statement.
- In this case the control dependence of predecestor block (that is
- within the empty loop) also contains the block determining number
- of iterations of the block that would prevent removing of empty
- loop in this case.
-
- This scenario can be avoided by splitting critical edges.
- To save the critical edge splitting pass we identify how the control
- dependence would look like if the edge was split.
-
- Consider the modified CFG created from current CFG by splitting
- edge B->C. In the postdominance tree of modified CFG, C' is
- always child of C. There are two cases how chlids of C' can look
- like:
-
- 1) C' is leaf
-
- In this case the only basic block C' is control dependent on is B.
-
- 2) C' has single child that is B
-
- In this case control dependence of C' is same as control
- dependence of B in original CFG except for block B itself.
- (since C' postdominate B in modified CFG)
-
- Now how to decide what case happens? There are two basic options:
-
- a) C postdominate B. Then C immediately postdominate B and
- case 2 happens iff there is no other way from B to C except
- the edge B->C.
-
- There is other way from B to C iff there is succesor of B that
- is not postdominated by B. Testing this condition is somewhat
- expensive, because we need to iterate all succesors of B.
- We are safe to assume that this does not happen: we will mark B
- as needed when processing the other path from B to C that is
- conrol dependent on B and marking control dependencies of B
- itself is harmless because they will be processed anyway after
- processing control statement in B.
-
- b) C does not postdominate B. Always case 1 happens since there is
- path from C to exit that does not go through B and thus also C'. */
-
- if (aggressive && !degenerate_phi_p (stmt))
- {
- for (k = 0; k < gimple_phi_num_args (stmt); k++)
- {
- basic_block arg_bb = gimple_phi_arg_edge (phi, k)->src;
-
- if (gimple_bb (stmt)
- != get_immediate_dominator (CDI_POST_DOMINATORS, arg_bb))
- {
- if (!bitmap_bit_p (last_stmt_necessary, arg_bb->index))
- mark_last_stmt_necessary (arg_bb);
- }
- else if (arg_bb != ENTRY_BLOCK_PTR_FOR_FN (cfun)
- && !bitmap_bit_p (visited_control_parents,
- arg_bb->index))
- mark_control_dependent_edges_necessary (arg_bb, true);
- }
- }
- }
- else
- {
- /* Propagate through the operands. Examine all the USE, VUSE and
- VDEF operands in this statement. Mark all the statements
- which feed this statement's uses as necessary. */
- ssa_op_iter iter;
- tree use;
-
- /* If this is a call to free which is directly fed by an
- allocation function do not mark that necessary through
- processing the argument. */
- bool is_delete_operator
- = (is_gimple_call (stmt)
- && gimple_call_from_new_or_delete (as_a <gcall *> (stmt))
- && gimple_call_operator_delete_p (as_a <gcall *> (stmt)));
- if (is_delete_operator
- || gimple_call_builtin_p (stmt, BUILT_IN_FREE)
- || gimple_call_builtin_p (stmt, BUILT_IN_GOMP_FREE))
- {
- tree ptr = gimple_call_arg (stmt, 0);
- gcall *def_stmt;
- tree def_callee;
- /* If the pointer we free is defined by an allocation
- function do not add the call to the worklist. */
- if (TREE_CODE (ptr) == SSA_NAME
- && (def_stmt = dyn_cast <gcall *> (SSA_NAME_DEF_STMT (ptr)))
- && (def_callee = gimple_call_fndecl (def_stmt))
- && ((DECL_BUILT_IN_CLASS (def_callee) == BUILT_IN_NORMAL
- && (DECL_FUNCTION_CODE (def_callee) == BUILT_IN_ALIGNED_ALLOC
- || DECL_FUNCTION_CODE (def_callee) == BUILT_IN_MALLOC
- || DECL_FUNCTION_CODE (def_callee) == BUILT_IN_CALLOC
- || DECL_FUNCTION_CODE (def_callee) == BUILT_IN_GOMP_ALLOC))
- || (DECL_IS_REPLACEABLE_OPERATOR_NEW_P (def_callee)
- && gimple_call_from_new_or_delete (def_stmt))))
- {
- if (is_delete_operator
- && !valid_new_delete_pair_p (def_stmt, stmt))
- mark_operand_necessary (gimple_call_arg (stmt, 0));
-
- /* Delete operators can have alignment and (or) size
- as next arguments. When being a SSA_NAME, they
- must be marked as necessary. Similarly GOMP_free. */
- if (gimple_call_num_args (stmt) >= 2)
- for (unsigned i = 1; i < gimple_call_num_args (stmt);
- i++)
- {
- tree arg = gimple_call_arg (stmt, i);
- if (TREE_CODE (arg) == SSA_NAME)
- mark_operand_necessary (arg);
- }
-
- continue;
- }
- }
-
- FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE)
- mark_operand_necessary (use);
-
- use = gimple_vuse (stmt);
- if (!use)
- continue;
-
- /* No need to search for vdefs if we intrinsicly keep them all. */
- if (keep_all_vdefs_p ())
- continue;
-
- /* If we dropped to simple mode make all immediately
- reachable definitions necessary. */
- if (chain_ovfl)
- {
- mark_all_reaching_defs_necessary (stmt);
- continue;
- }
-
- /* For statements that may load from memory (have a VUSE) we
- have to mark all reaching (may-)definitions as necessary.
- We partition this task into two cases:
- 1) explicit loads based on decls that are not aliased
- 2) implicit loads (like calls) and explicit loads not
- based on decls that are not aliased (like indirect
- references or loads from globals)
- For 1) we mark all reaching may-defs as necessary, stopping
- at dominating kills. For 2) we want to mark all dominating
- references necessary, but non-aliased ones which we handle
- in 1). By keeping a global visited bitmap for references
- we walk for 2) we avoid quadratic behavior for those. */
-
- if (gcall *call = dyn_cast <gcall *> (stmt))
- {
- tree callee = gimple_call_fndecl (call);
- unsigned i;
-
- /* Calls to functions that are merely acting as barriers
- or that only store to memory do not make any previous
- stores necessary. */
- if (callee != NULL_TREE
- && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL
- && (DECL_FUNCTION_CODE (callee) == BUILT_IN_MEMSET
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_MEMSET_CHK
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_MALLOC
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_ALIGNED_ALLOC
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_CALLOC
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_FREE
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_VA_END
- || ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (callee))
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_STACK_SAVE
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_STACK_RESTORE
- || DECL_FUNCTION_CODE (callee) == BUILT_IN_ASSUME_ALIGNED))
- continue;
-
- if (callee != NULL_TREE
- && (DECL_IS_REPLACEABLE_OPERATOR_NEW_P (callee)
- || DECL_IS_OPERATOR_DELETE_P (callee))
- && gimple_call_from_new_or_delete (call))
- continue;
-
- /* Calls implicitly load from memory, their arguments
- in addition may explicitly perform memory loads. */
- mark_all_reaching_defs_necessary (call);
- for (i = 0; i < gimple_call_num_args (call); ++i)
- {
- tree arg = gimple_call_arg (call, i);
- if (TREE_CODE (arg) == SSA_NAME
- || is_gimple_min_invariant (arg))
- continue;
- if (TREE_CODE (arg) == WITH_SIZE_EXPR)
- arg = TREE_OPERAND (arg, 0);
- if (!ref_may_be_aliased (arg))
- mark_aliased_reaching_defs_necessary (call, arg);
- }
- }
- else if (gimple_assign_single_p (stmt))
- {
- tree rhs;
- /* If this is a load mark things necessary. */
- rhs = gimple_assign_rhs1 (stmt);
- if (TREE_CODE (rhs) != SSA_NAME
- && !is_gimple_min_invariant (rhs)
- && TREE_CODE (rhs) != CONSTRUCTOR)
- {
- if (!ref_may_be_aliased (rhs))
- mark_aliased_reaching_defs_necessary (stmt, rhs);
- else
- mark_all_reaching_defs_necessary (stmt);
- }
- }
- else if (greturn *return_stmt = dyn_cast <greturn *> (stmt))
- {
- tree rhs = gimple_return_retval (return_stmt);
- /* A return statement may perform a load. */
- if (rhs
- && TREE_CODE (rhs) != SSA_NAME
- && !is_gimple_min_invariant (rhs)
- && TREE_CODE (rhs) != CONSTRUCTOR)
- {
- if (!ref_may_be_aliased (rhs))
- mark_aliased_reaching_defs_necessary (stmt, rhs);
- else
- mark_all_reaching_defs_necessary (stmt);
- }
- }
- else if (gasm *asm_stmt = dyn_cast <gasm *> (stmt))
- {
- unsigned i;
- mark_all_reaching_defs_necessary (stmt);
- /* Inputs may perform loads. */
- for (i = 0; i < gimple_asm_ninputs (asm_stmt); ++i)
- {
- tree op = TREE_VALUE (gimple_asm_input_op (asm_stmt, i));
- if (TREE_CODE (op) != SSA_NAME
- && !is_gimple_min_invariant (op)
- && TREE_CODE (op) != CONSTRUCTOR
- && !ref_may_be_aliased (op))
- mark_aliased_reaching_defs_necessary (stmt, op);
- }
- }
- else if (gimple_code (stmt) == GIMPLE_TRANSACTION)
- {
- /* The beginning of a transaction is a memory barrier. */
- /* ??? If we were really cool, we'd only be a barrier
- for the memories touched within the transaction. */
- mark_all_reaching_defs_necessary (stmt);
- }
- else
- gcc_unreachable ();
-
- /* If we over-used our alias oracle budget drop to simple
- mode. The cost metric allows quadratic behavior
- (number of uses times number of may-defs queries) up to
- a constant maximal number of queries and after that falls back to
- super-linear complexity. */
- if (/* Constant but quadratic for small functions. */
- total_chain > 128 * 128
- /* Linear in the number of may-defs. */
- && total_chain > 32 * longest_chain
- /* Linear in the number of uses. */
- && total_chain > nr_walks * 32)
- {
- chain_ovfl = true;
- if (visited)
- bitmap_clear (visited);
- }
- }
- }
-}
-
-/* Remove dead PHI nodes from block BB. */
-
-static bool
-remove_dead_phis (basic_block bb)
-{
- bool something_changed = false;
- gphi *phi;
- gphi_iterator gsi;
-
- for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi);)
- {
- stats.total_phis++;
- phi = gsi.phi ();
-
- /* We do not track necessity of virtual PHI nodes. Instead do
- very simple dead PHI removal here. */
- if (virtual_operand_p (gimple_phi_result (phi)))
- {
- /* Virtual PHI nodes with one or identical arguments
- can be removed. */
- if (degenerate_phi_p (phi))
- {
- tree vdef = gimple_phi_result (phi);
- tree vuse = gimple_phi_arg_def (phi, 0);
-
- use_operand_p use_p;
- imm_use_iterator iter;
- gimple *use_stmt;
- FOR_EACH_IMM_USE_STMT (use_stmt, iter, vdef)
- FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
- SET_USE (use_p, vuse);
- if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (vdef)
- && TREE_CODE (vuse) == SSA_NAME)
- SSA_NAME_OCCURS_IN_ABNORMAL_PHI (vuse) = 1;
- }
- else
- gimple_set_plf (phi, STMT_NECESSARY, true);
- }
-
- if (!gimple_plf (phi, STMT_NECESSARY))
- {
- something_changed = true;
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Deleting : ");
- print_gimple_stmt (dump_file, phi, 0, TDF_SLIM);
- fprintf (dump_file, "\n");
- }
-
- remove_phi_node (&gsi, true);
- stats.removed_phis++;
- continue;
- }
-
- gsi_next (&gsi);
- }
- return something_changed;
-}
-
-
-/* Remove dead statement pointed to by iterator I. Receives the basic block BB
- containing I so that we don't have to look it up. */
-
-static void
-remove_dead_stmt (gimple_stmt_iterator *i, basic_block bb,
- vec<edge> &to_remove_edges)
-{
- gimple *stmt = gsi_stmt (*i);
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Deleting : ");
- print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
- fprintf (dump_file, "\n");
- }
-
- stats.removed++;
-
- /* If we have determined that a conditional branch statement contributes
- nothing to the program, then we not only remove it, but we need to update
- the CFG. We can chose any of edges out of BB as long as we are sure to not
- close infinite loops. This is done by always choosing the edge closer to
- exit in inverted_post_order_compute order. */
- if (is_ctrl_stmt (stmt))
- {
- edge_iterator ei;
- edge e = NULL, e2;
-
- /* See if there is only one non-abnormal edge. */
- if (single_succ_p (bb))
- e = single_succ_edge (bb);
- /* Otherwise chose one that is closer to bb with live statement in it.
- To be able to chose one, we compute inverted post order starting from
- all BBs with live statements. */
- if (!e)
- {
- if (!bb_postorder)
- {
- auto_vec<int, 20> postorder;
- inverted_post_order_compute (&postorder,
- &bb_contains_live_stmts);
- bb_postorder = XNEWVEC (int, last_basic_block_for_fn (cfun));
- for (unsigned int i = 0; i < postorder.length (); ++i)
- bb_postorder[postorder[i]] = i;
- }
- FOR_EACH_EDGE (e2, ei, bb->succs)
- if (!e || e2->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)
- || bb_postorder [e->dest->index]
- < bb_postorder [e2->dest->index])
- e = e2;
- }
- gcc_assert (e);
- e->probability = profile_probability::always ();
-
- /* The edge is no longer associated with a conditional, so it does
- not have TRUE/FALSE flags.
- We are also safe to drop EH/ABNORMAL flags and turn them into
- normal control flow, because we know that all the destinations (including
- those odd edges) are equivalent for program execution. */
- e->flags &= ~(EDGE_TRUE_VALUE | EDGE_FALSE_VALUE | EDGE_EH | EDGE_ABNORMAL);
-
- /* The lone outgoing edge from BB will be a fallthru edge. */
- e->flags |= EDGE_FALLTHRU;
-
- /* Remove the remaining outgoing edges. */
- FOR_EACH_EDGE (e2, ei, bb->succs)
- if (e != e2)
- {
- /* If we made a BB unconditionally exit a loop or removed
- an entry into an irreducible region, then this transform
- alters the set of BBs in the loop. Schedule a fixup. */
- if (loop_exit_edge_p (bb->loop_father, e)
- || (e2->dest->flags & BB_IRREDUCIBLE_LOOP))
- loops_state_set (LOOPS_NEED_FIXUP);
- to_remove_edges.safe_push (e2);
- }
- }
-
- /* If this is a store into a variable that is being optimized away,
- add a debug bind stmt if possible. */
- if (MAY_HAVE_DEBUG_BIND_STMTS
- && gimple_assign_single_p (stmt)
- && is_gimple_val (gimple_assign_rhs1 (stmt)))
- {
- tree lhs = gimple_assign_lhs (stmt);
- if ((VAR_P (lhs) || TREE_CODE (lhs) == PARM_DECL)
- && !DECL_IGNORED_P (lhs)
- && is_gimple_reg_type (TREE_TYPE (lhs))
- && !is_global_var (lhs)
- && !DECL_HAS_VALUE_EXPR_P (lhs))
- {
- tree rhs = gimple_assign_rhs1 (stmt);
- gdebug *note
- = gimple_build_debug_bind (lhs, unshare_expr (rhs), stmt);
- gsi_insert_after (i, note, GSI_SAME_STMT);
- }
- }
-
- unlink_stmt_vdef (stmt);
- gsi_remove (i, true);
- release_defs (stmt);
-}
-
-/* Helper for maybe_optimize_arith_overflow. Find in *TP if there are any
- uses of data (SSA_NAME) other than REALPART_EXPR referencing it. */
-
-static tree
-find_non_realpart_uses (tree *tp, int *walk_subtrees, void *data)
-{
- if (TYPE_P (*tp) || TREE_CODE (*tp) == REALPART_EXPR)
- *walk_subtrees = 0;
- if (*tp == (tree) data)
- return *tp;
- return NULL_TREE;
-}
-
-/* If the IMAGPART_EXPR of the {ADD,SUB,MUL}_OVERFLOW result is never used,
- but REALPART_EXPR is, optimize the {ADD,SUB,MUL}_OVERFLOW internal calls
- into plain unsigned {PLUS,MINUS,MULT}_EXPR, and if needed reset debug
- uses. */
-
-static void
-maybe_optimize_arith_overflow (gimple_stmt_iterator *gsi,
- enum tree_code subcode)
-{
- gimple *stmt = gsi_stmt (*gsi);
- tree lhs = gimple_call_lhs (stmt);
-
- if (lhs == NULL || TREE_CODE (lhs) != SSA_NAME)
- return;
-
- imm_use_iterator imm_iter;
- use_operand_p use_p;
- bool has_debug_uses = false;
- bool has_realpart_uses = false;
- bool has_other_uses = false;
- FOR_EACH_IMM_USE_FAST (use_p, imm_iter, lhs)
- {
- gimple *use_stmt = USE_STMT (use_p);
- if (is_gimple_debug (use_stmt))
- has_debug_uses = true;
- else if (is_gimple_assign (use_stmt)
- && gimple_assign_rhs_code (use_stmt) == REALPART_EXPR
- && TREE_OPERAND (gimple_assign_rhs1 (use_stmt), 0) == lhs)
- has_realpart_uses = true;
- else
- {
- has_other_uses = true;
- break;
- }
- }
-
- if (!has_realpart_uses || has_other_uses)
- return;
-
- tree arg0 = gimple_call_arg (stmt, 0);
- tree arg1 = gimple_call_arg (stmt, 1);
- location_t loc = gimple_location (stmt);
- tree type = TREE_TYPE (TREE_TYPE (lhs));
- tree utype = type;
- if (!TYPE_UNSIGNED (type))
- utype = build_nonstandard_integer_type (TYPE_PRECISION (type), 1);
- tree result = fold_build2_loc (loc, subcode, utype,
- fold_convert_loc (loc, utype, arg0),
- fold_convert_loc (loc, utype, arg1));
- result = fold_convert_loc (loc, type, result);
-
- if (has_debug_uses)
- {
- gimple *use_stmt;
- FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, lhs)
- {
- if (!gimple_debug_bind_p (use_stmt))
- continue;
- tree v = gimple_debug_bind_get_value (use_stmt);
- if (walk_tree (&v, find_non_realpart_uses, lhs, NULL))
- {
- gimple_debug_bind_reset_value (use_stmt);
- update_stmt (use_stmt);
- }
- }
- }
-
- if (TREE_CODE (result) == INTEGER_CST && TREE_OVERFLOW (result))
- result = drop_tree_overflow (result);
- tree overflow = build_zero_cst (type);
- tree ctype = build_complex_type (type);
- if (TREE_CODE (result) == INTEGER_CST)
- result = build_complex (ctype, result, overflow);
- else
- result = build2_loc (gimple_location (stmt), COMPLEX_EXPR,
- ctype, result, overflow);
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Transforming call: ");
- print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
- fprintf (dump_file, "because the overflow result is never used into: ");
- print_generic_stmt (dump_file, result, TDF_SLIM);
- fprintf (dump_file, "\n");
- }
-
- gimplify_and_update_call_from_tree (gsi, result);
-}
-
-/* Eliminate unnecessary statements. Any instruction not marked as necessary
- contributes nothing to the program, and can be deleted. */
-
-static bool
-eliminate_unnecessary_stmts (void)
-{
- bool something_changed = false;
- basic_block bb;
- gimple_stmt_iterator gsi, psi;
- gimple *stmt;
- tree call;
- auto_vec<edge> to_remove_edges;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "\nEliminating unnecessary statements:\n");
-
- clear_special_calls ();
-
- /* Walking basic blocks and statements in reverse order avoids
- releasing SSA names before any other DEFs that refer to them are
- released. This helps avoid loss of debug information, as we get
- a chance to propagate all RHSs of removed SSAs into debug uses,
- rather than only the latest ones. E.g., consider:
-
- x_3 = y_1 + z_2;
- a_5 = x_3 - b_4;
- # DEBUG a => a_5
-
- If we were to release x_3 before a_5, when we reached a_5 and
- tried to substitute it into the debug stmt, we'd see x_3 there,
- but x_3's DEF, type, etc would have already been disconnected.
- By going backwards, the debug stmt first changes to:
-
- # DEBUG a => x_3 - b_4
-
- and then to:
-
- # DEBUG a => y_1 + z_2 - b_4
-
- as desired. */
- gcc_assert (dom_info_available_p (CDI_DOMINATORS));
- auto_vec<basic_block> h;
- h = get_all_dominated_blocks (CDI_DOMINATORS,
- single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)));
-
- while (h.length ())
- {
- bb = h.pop ();
-
- /* Remove dead statements. */
- auto_bitmap debug_seen;
- for (gsi = gsi_last_bb (bb); !gsi_end_p (gsi); gsi = psi)
- {
- stmt = gsi_stmt (gsi);
-
- psi = gsi;
- gsi_prev (&psi);
-
- stats.total++;
-
- /* We can mark a call to free as not necessary if the
- defining statement of its argument is not necessary
- (and thus is getting removed). */
- if (gimple_plf (stmt, STMT_NECESSARY)
- && (gimple_call_builtin_p (stmt, BUILT_IN_FREE)
- || (is_gimple_call (stmt)
- && gimple_call_from_new_or_delete (as_a <gcall *> (stmt))
- && gimple_call_operator_delete_p (as_a <gcall *> (stmt)))))
- {
- tree ptr = gimple_call_arg (stmt, 0);
- if (TREE_CODE (ptr) == SSA_NAME)
- {
- gimple *def_stmt = SSA_NAME_DEF_STMT (ptr);
- if (!gimple_nop_p (def_stmt)
- && !gimple_plf (def_stmt, STMT_NECESSARY))
- gimple_set_plf (stmt, STMT_NECESSARY, false);
- }
- }
-
- /* If GSI is not necessary then remove it. */
- if (!gimple_plf (stmt, STMT_NECESSARY))
- {
- /* Keep clobbers that we can keep live live. */
- if (gimple_clobber_p (stmt))
- {
- ssa_op_iter iter;
- use_operand_p use_p;
- bool dead = false;
- FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_USE)
- {
- tree name = USE_FROM_PTR (use_p);
- if (!SSA_NAME_IS_DEFAULT_DEF (name)
- && !bitmap_bit_p (processed, SSA_NAME_VERSION (name)))
- {
- dead = true;
- break;
- }
- }
- if (!dead)
- {
- bitmap_clear (debug_seen);
- continue;
- }
- }
- if (!is_gimple_debug (stmt))
- something_changed = true;
- remove_dead_stmt (&gsi, bb, to_remove_edges);
- continue;
- }
- else if (is_gimple_call (stmt))
- {
- tree name = gimple_call_lhs (stmt);
-
- notice_special_calls (as_a <gcall *> (stmt));
-
- /* When LHS of var = call (); is dead, simplify it into
- call (); saving one operand. */
- if (name
- && TREE_CODE (name) == SSA_NAME
- && !bitmap_bit_p (processed, SSA_NAME_VERSION (name))
- /* Avoid doing so for allocation calls which we
- did not mark as necessary, it will confuse the
- special logic we apply to malloc/free pair removal. */
- && (!(call = gimple_call_fndecl (stmt))
- || ((DECL_BUILT_IN_CLASS (call) != BUILT_IN_NORMAL
- || (DECL_FUNCTION_CODE (call) != BUILT_IN_ALIGNED_ALLOC
- && DECL_FUNCTION_CODE (call) != BUILT_IN_MALLOC
- && DECL_FUNCTION_CODE (call) != BUILT_IN_CALLOC
- && !ALLOCA_FUNCTION_CODE_P
- (DECL_FUNCTION_CODE (call))))
- && !DECL_IS_REPLACEABLE_OPERATOR_NEW_P (call))))
- {
- something_changed = true;
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Deleting LHS of call: ");
- print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
- fprintf (dump_file, "\n");
- }
-
- gimple_call_set_lhs (stmt, NULL_TREE);
- maybe_clean_or_replace_eh_stmt (stmt, stmt);
- update_stmt (stmt);
- release_ssa_name (name);
-
- /* GOMP_SIMD_LANE (unless three argument) or ASAN_POISON
- without lhs is not needed. */
- if (gimple_call_internal_p (stmt))
- switch (gimple_call_internal_fn (stmt))
- {
- case IFN_GOMP_SIMD_LANE:
- if (gimple_call_num_args (stmt) >= 3
- && !integer_nonzerop (gimple_call_arg (stmt, 2)))
- break;
- /* FALLTHRU */
- case IFN_ASAN_POISON:
- remove_dead_stmt (&gsi, bb, to_remove_edges);
- break;
- default:
- break;
- }
- }
- else if (gimple_call_internal_p (stmt))
- switch (gimple_call_internal_fn (stmt))
- {
- case IFN_ADD_OVERFLOW:
- maybe_optimize_arith_overflow (&gsi, PLUS_EXPR);
- break;
- case IFN_SUB_OVERFLOW:
- maybe_optimize_arith_overflow (&gsi, MINUS_EXPR);
- break;
- case IFN_MUL_OVERFLOW:
- maybe_optimize_arith_overflow (&gsi, MULT_EXPR);
- break;
- default:
- break;
- }
- }
- else if (gimple_debug_bind_p (stmt))
- {
- /* We are only keeping the last debug-bind of a
- non-DEBUG_EXPR_DECL variable in a series of
- debug-bind stmts. */
- tree var = gimple_debug_bind_get_var (stmt);
- if (TREE_CODE (var) != DEBUG_EXPR_DECL
- && !bitmap_set_bit (debug_seen, DECL_UID (var)))
- remove_dead_stmt (&gsi, bb, to_remove_edges);
- continue;
- }
- bitmap_clear (debug_seen);
- }
-
- /* Remove dead PHI nodes. */
- something_changed |= remove_dead_phis (bb);
- }
-
-
- /* Since we don't track liveness of virtual PHI nodes, it is possible that we
- rendered some PHI nodes unreachable while they are still in use.
- Mark them for renaming. */
- if (!to_remove_edges.is_empty ())
- {
- basic_block prev_bb;
-
- /* Remove edges. We've delayed this to not get bogus debug stmts
- during PHI node removal. */
- for (unsigned i = 0; i < to_remove_edges.length (); ++i)
- remove_edge (to_remove_edges[i]);
- cfg_altered = true;
-
- find_unreachable_blocks ();
-
- /* Delete all unreachable basic blocks in reverse dominator order. */
- for (bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
- bb != ENTRY_BLOCK_PTR_FOR_FN (cfun); bb = prev_bb)
- {
- prev_bb = bb->prev_bb;
-
- if (!bitmap_bit_p (bb_contains_live_stmts, bb->index)
- || !(bb->flags & BB_REACHABLE))
- {
- for (gphi_iterator gsi = gsi_start_phis (bb); !gsi_end_p (gsi);
- gsi_next (&gsi))
- if (virtual_operand_p (gimple_phi_result (gsi.phi ())))
- {
- bool found = false;
- imm_use_iterator iter;
-
- FOR_EACH_IMM_USE_STMT (stmt, iter,
- gimple_phi_result (gsi.phi ()))
- {
- if (!(gimple_bb (stmt)->flags & BB_REACHABLE))
- continue;
- if (gimple_code (stmt) == GIMPLE_PHI
- || gimple_plf (stmt, STMT_NECESSARY))
- {
- found = true;
- break;
- }
- }
- if (found)
- mark_virtual_phi_result_for_renaming (gsi.phi ());
- }
-
- if (!(bb->flags & BB_REACHABLE))
- {
- /* Speed up the removal of blocks that don't
- dominate others. Walking backwards, this should
- be the common case. ??? Do we need to recompute
- dominators because of cfg_altered? */
- if (!first_dom_son (CDI_DOMINATORS, bb))
- delete_basic_block (bb);
- else
- {
- h = get_all_dominated_blocks (CDI_DOMINATORS, bb);
-
- while (h.length ())
- {
- bb = h.pop ();
- prev_bb = bb->prev_bb;
- /* Rearrangements to the CFG may have failed
- to update the dominators tree, so that
- formerly-dominated blocks are now
- otherwise reachable. */
- if (!!(bb->flags & BB_REACHABLE))
- continue;
- delete_basic_block (bb);
- }
-
- h.release ();
- }
- }
- }
- }
- }
-
- if (bb_postorder)
- free (bb_postorder);
- bb_postorder = NULL;
-
- return something_changed;
-}
-
-
-/* Print out removed statement statistics. */
-
-static void
-print_stats (void)
-{
- float percg;
-
- percg = ((float) stats.removed / (float) stats.total) * 100;
- fprintf (dump_file, "Removed %d of %d statements (%d%%)\n",
- stats.removed, stats.total, (int) percg);
-
- if (stats.total_phis == 0)
- percg = 0;
- else
- percg = ((float) stats.removed_phis / (float) stats.total_phis) * 100;
-
- fprintf (dump_file, "Removed %d of %d PHI nodes (%d%%)\n",
- stats.removed_phis, stats.total_phis, (int) percg);
-}
-
-/* Initialization for this pass. Set up the used data structures. */
-
-static void
-tree_dce_init (bool aggressive)
-{
- memset ((void *) &stats, 0, sizeof (stats));
-
- if (aggressive)
- {
- last_stmt_necessary = sbitmap_alloc (last_basic_block_for_fn (cfun));
- bitmap_clear (last_stmt_necessary);
- bb_contains_live_stmts = sbitmap_alloc (last_basic_block_for_fn (cfun));
- bitmap_clear (bb_contains_live_stmts);
- }
-
- processed = sbitmap_alloc (num_ssa_names + 1);
- bitmap_clear (processed);
-
- worklist.create (64);
- cfg_altered = false;
-}
-
-/* Cleanup after this pass. */
-
-static void
-tree_dce_done (bool aggressive)
-{
- if (aggressive)
- {
- delete cd;
- sbitmap_free (visited_control_parents);
- sbitmap_free (last_stmt_necessary);
- sbitmap_free (bb_contains_live_stmts);
- bb_contains_live_stmts = NULL;
- }
-
- sbitmap_free (processed);
-
- worklist.release ();
-}
-
-/* Sort PHI argument values for make_forwarders_with_degenerate_phis. */
-
-static int
-sort_phi_args (const void *a_, const void *b_)
-{
- auto *a = (const std::pair<edge, hashval_t> *) a_;
- auto *b = (const std::pair<edge, hashval_t> *) b_;
- hashval_t ha = a->second;
- hashval_t hb = b->second;
- if (ha < hb)
- return -1;
- else if (ha > hb)
- return 1;
- else if (a->first->dest_idx < b->first->dest_idx)
- return -1;
- else if (a->first->dest_idx > b->first->dest_idx)
- return 1;
- else
- return 0;
-}
-
-/* Look for a non-virtual PHIs and make a forwarder block when all PHIs
- have the same argument on a set of edges. This is to not consider
- control dependences of individual edges for same values but only for
- the common set. */
-
-static unsigned
-make_forwarders_with_degenerate_phis (function *fn)
-{
- unsigned todo = 0;
-
- basic_block bb;
- FOR_EACH_BB_FN (bb, fn)
- {
- /* Only PHIs with three or more arguments have opportunities. */
- if (EDGE_COUNT (bb->preds) < 3)
- continue;
- /* Do not touch loop headers or blocks with abnormal predecessors.
- ??? This is to avoid creating valid loops here, see PR103458.
- We might want to improve things to either explicitely add those
- loops or at least consider blocks with no backedges. */
- if (bb->loop_father->header == bb
- || bb_has_abnormal_pred (bb))
- continue;
-
- /* Take one PHI node as template to look for identical
- arguments. Build a vector of candidates forming sets
- of argument edges with equal values. Note optimality
- depends on the particular choice of the template PHI
- since equal arguments are unordered leaving other PHIs
- with more than one set of equal arguments within this
- argument range unsorted. We'd have to break ties by
- looking at other PHI nodes. */
- gphi_iterator gsi = gsi_start_nonvirtual_phis (bb);
- if (gsi_end_p (gsi))
- continue;
- gphi *phi = gsi.phi ();
- auto_vec<std::pair<edge, hashval_t>, 8> args;
- bool need_resort = false;
- for (unsigned i = 0; i < gimple_phi_num_args (phi); ++i)
- {
- edge e = gimple_phi_arg_edge (phi, i);
- /* Skip abnormal edges since we cannot redirect them. */
- if (e->flags & EDGE_ABNORMAL)
- continue;
- /* Skip loop exit edges when we are in loop-closed SSA form
- since the forwarder we'd create does not have a PHI node. */
- if (loops_state_satisfies_p (LOOP_CLOSED_SSA)
- && loop_exit_edge_p (e->src->loop_father, e))
- continue;
-
- tree arg = gimple_phi_arg_def (phi, i);
- if (!CONSTANT_CLASS_P (arg) && TREE_CODE (arg) != SSA_NAME)
- need_resort = true;
- args.safe_push (std::make_pair (e, iterative_hash_expr (arg, 0)));
- }
- if (args.length () < 2)
- continue;
- args.qsort (sort_phi_args);
- /* The above sorting can be different between -g and -g0, as e.g. decls
- can have different uids (-g could have bigger gaps in between them).
- So, only use that to determine which args are equal, then change
- second from hash value to smallest dest_idx of the edges which have
- equal argument and sort again. If all the phi arguments are
- constants or SSA_NAME, there is no need for the second sort, the hash
- values are stable in that case. */
- hashval_t hash = args[0].second;
- args[0].second = args[0].first->dest_idx;
- bool any_equal = false;
- for (unsigned i = 1; i < args.length (); ++i)
- if (hash == args[i].second
- && operand_equal_p (PHI_ARG_DEF_FROM_EDGE (phi, args[i - 1].first),
- PHI_ARG_DEF_FROM_EDGE (phi, args[i].first)))
- {
- args[i].second = args[i - 1].second;
- any_equal = true;
- }
- else
- {
- hash = args[i].second;
- args[i].second = args[i].first->dest_idx;
- }
- if (!any_equal)
- continue;
- if (need_resort)
- args.qsort (sort_phi_args);
-
- /* From the candidates vector now verify true candidates for
- forwarders and create them. */
- gphi *vphi = get_virtual_phi (bb);
- unsigned start = 0;
- while (start < args.length () - 1)
- {
- unsigned i;
- for (i = start + 1; i < args.length (); ++i)
- if (args[start].second != args[i].second)
- break;
- /* args[start]..args[i-1] are equal. */
- if (start != i - 1)
- {
- /* Check all PHI nodes for argument equality. */
- bool equal = true;
- gphi_iterator gsi2 = gsi;
- gsi_next (&gsi2);
- for (; !gsi_end_p (gsi2); gsi_next (&gsi2))
- {
- gphi *phi2 = gsi2.phi ();
- if (virtual_operand_p (gimple_phi_result (phi2)))
- continue;
- tree start_arg
- = PHI_ARG_DEF_FROM_EDGE (phi2, args[start].first);
- for (unsigned j = start + 1; j < i; ++j)
- {
- if (!operand_equal_p (start_arg,
- PHI_ARG_DEF_FROM_EDGE
- (phi2, args[j].first)))
- {
- /* Another PHI might have a shorter set of
- equivalent args. Go for that. */
- i = j;
- if (j == start + 1)
- equal = false;
- break;
- }
- }
- if (!equal)
- break;
- }
- if (equal)
- {
- /* If we are asked to forward all edges the block
- has all degenerate PHIs. Do nothing in that case. */
- if (start == 0
- && i == args.length ()
- && args.length () == gimple_phi_num_args (phi))
- break;
- /* Instead of using make_forwarder_block we are
- rolling our own variant knowing that the forwarder
- does not need PHI nodes apart from eventually
- a virtual one. */
- auto_vec<tree, 8> vphi_args;
- if (vphi)
- {
- vphi_args.reserve_exact (i - start);
- for (unsigned j = start; j < i; ++j)
- vphi_args.quick_push
- (PHI_ARG_DEF_FROM_EDGE (vphi, args[j].first));
- }
- free_dominance_info (fn, CDI_DOMINATORS);
- basic_block forwarder = split_edge (args[start].first);
- for (unsigned j = start + 1; j < i; ++j)
- {
- edge e = args[j].first;
- redirect_edge_and_branch_force (e, forwarder);
- redirect_edge_var_map_clear (e);
- }
- if (vphi)
- {
- tree def = copy_ssa_name (vphi_args[0]);
- gphi *vphi_copy = create_phi_node (def, forwarder);
- for (unsigned j = start; j < i; ++j)
- add_phi_arg (vphi_copy, vphi_args[j - start],
- args[j].first, UNKNOWN_LOCATION);
- SET_PHI_ARG_DEF
- (vphi, single_succ_edge (forwarder)->dest_idx, def);
- }
- todo |= TODO_cleanup_cfg;
- }
- }
- /* Continue searching for more opportunities. */
- start = i;
- }
- }
- return todo;
-}
-
-/* Main routine to eliminate dead code.
-
- AGGRESSIVE controls the aggressiveness of the algorithm.
- In conservative mode, we ignore control dependence and simply declare
- all but the most trivially dead branches necessary. This mode is fast.
- In aggressive mode, control dependences are taken into account, which
- results in more dead code elimination, but at the cost of some time.
-
- FIXME: Aggressive mode before PRE doesn't work currently because
- the dominance info is not invalidated after DCE1. This is
- not an issue right now because we only run aggressive DCE
- as the last tree SSA pass, but keep this in mind when you
- start experimenting with pass ordering. */
-
-static unsigned int
-perform_tree_ssa_dce (bool aggressive)
-{
- bool something_changed = 0;
- unsigned todo = 0;
-
- /* Preheaders are needed for SCEV to work.
- Simple lateches and recorded exits improve chances that loop will
- proved to be finite in testcases such as in loop-15.c and loop-24.c */
- bool in_loop_pipeline = scev_initialized_p ();
- if (aggressive && ! in_loop_pipeline)
- {
- scev_initialize ();
- loop_optimizer_init (LOOPS_NORMAL
- | LOOPS_HAVE_RECORDED_EXITS);
- }
-
- if (aggressive)
- todo |= make_forwarders_with_degenerate_phis (cfun);
-
- calculate_dominance_info (CDI_DOMINATORS);
-
- tree_dce_init (aggressive);
-
- if (aggressive)
- {
- /* Compute control dependence. */
- calculate_dominance_info (CDI_POST_DOMINATORS);
- cd = new control_dependences ();
-
- visited_control_parents =
- sbitmap_alloc (last_basic_block_for_fn (cfun));
- bitmap_clear (visited_control_parents);
-
- mark_dfs_back_edges ();
- }
-
- find_obviously_necessary_stmts (aggressive);
-
- if (aggressive && ! in_loop_pipeline)
- {
- loop_optimizer_finalize ();
- scev_finalize ();
- }
-
- longest_chain = 0;
- total_chain = 0;
- nr_walks = 0;
- chain_ovfl = false;
- visited = BITMAP_ALLOC (NULL);
- propagate_necessity (aggressive);
- BITMAP_FREE (visited);
-
- something_changed |= eliminate_unnecessary_stmts ();
- something_changed |= cfg_altered;
-
- /* We do not update postdominators, so free them unconditionally. */
- free_dominance_info (CDI_POST_DOMINATORS);
-
- /* If we removed paths in the CFG, then we need to update
- dominators as well. I haven't investigated the possibility
- of incrementally updating dominators. */
- if (cfg_altered)
- free_dominance_info (CDI_DOMINATORS);
-
- statistics_counter_event (cfun, "Statements deleted", stats.removed);
- statistics_counter_event (cfun, "PHI nodes deleted", stats.removed_phis);
-
- /* Debugging dumps. */
- if (dump_file && (dump_flags & (TDF_STATS|TDF_DETAILS)))
- print_stats ();
-
- tree_dce_done (aggressive);
-
- if (something_changed)
- {
- free_numbers_of_iterations_estimates (cfun);
- if (in_loop_pipeline)
- scev_reset ();
- todo |= TODO_update_ssa | TODO_cleanup_cfg;
- }
- return todo;
-}
-
-/* Pass entry points. */
-static unsigned int
-tree_ssa_dce (void)
-{
- return perform_tree_ssa_dce (/*aggressive=*/false);
-}
-
-static unsigned int
-tree_ssa_cd_dce (void)
-{
- return perform_tree_ssa_dce (/*aggressive=*/optimize >= 2);
-}
-
-namespace {
-
-const pass_data pass_data_dce =
-{
- GIMPLE_PASS, /* type */
- "dce", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_TREE_DCE, /* tv_id */
- ( PROP_cfg | PROP_ssa ), /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_dce : public gimple_opt_pass
-{
-public:
- pass_dce (gcc::context *ctxt)
- : gimple_opt_pass (pass_data_dce, ctxt)
- {}
-
- /* opt_pass methods: */
- opt_pass * clone () { return new pass_dce (m_ctxt); }
- virtual bool gate (function *) { return flag_tree_dce != 0; }
- virtual unsigned int execute (function *) { return tree_ssa_dce (); }
-
-}; // class pass_dce
-
-} // anon namespace
-
-gimple_opt_pass *
-make_pass_dce (gcc::context *ctxt)
-{
- return new pass_dce (ctxt);
-}
-
-namespace {
-
-const pass_data pass_data_cd_dce =
-{
- GIMPLE_PASS, /* type */
- "cddce", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_TREE_CD_DCE, /* tv_id */
- ( PROP_cfg | PROP_ssa ), /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_cd_dce : public gimple_opt_pass
-{
-public:
- pass_cd_dce (gcc::context *ctxt)
- : gimple_opt_pass (pass_data_cd_dce, ctxt), update_address_taken_p (false)
- {}
-
- /* opt_pass methods: */
- opt_pass * clone () { return new pass_cd_dce (m_ctxt); }
- void set_pass_param (unsigned n, bool param)
- {
- gcc_assert (n == 0);
- update_address_taken_p = param;
- }
- virtual bool gate (function *) { return flag_tree_dce != 0; }
- virtual unsigned int execute (function *)
- {
- return (tree_ssa_cd_dce ()
- | (update_address_taken_p ? TODO_update_address_taken : 0));
- }
-
-private:
- bool update_address_taken_p;
-}; // class pass_cd_dce
-
-} // anon namespace
-
-gimple_opt_pass *
-make_pass_cd_dce (gcc::context *ctxt)
-{
- return new pass_cd_dce (ctxt);
-}
-
-
-/* A cheap DCE interface. WORKLIST is a list of possibly dead stmts and
- is consumed by this function. The function has linear complexity in
- the number of dead stmts with a constant factor like the average SSA
- use operands number. */
-
-void
-simple_dce_from_worklist (bitmap worklist)
-{
- while (! bitmap_empty_p (worklist))
- {
- /* Pop item. */
- unsigned i = bitmap_first_set_bit (worklist);
- bitmap_clear_bit (worklist, i);
-
- tree def = ssa_name (i);
- /* Removed by somebody else or still in use. */
- if (! def || ! has_zero_uses (def))
- continue;
-
- gimple *t = SSA_NAME_DEF_STMT (def);
- if (gimple_has_side_effects (t))
- continue;
-
- /* Don't remove statements that are needed for non-call
- eh to work. */
- if (stmt_unremovable_because_of_non_call_eh_p (cfun, t))
- continue;
-
- /* Add uses to the worklist. */
- ssa_op_iter iter;
- use_operand_p use_p;
- FOR_EACH_PHI_OR_STMT_USE (use_p, t, iter, SSA_OP_USE)
- {
- tree use = USE_FROM_PTR (use_p);
- if (TREE_CODE (use) == SSA_NAME
- && ! SSA_NAME_IS_DEFAULT_DEF (use))
- bitmap_set_bit (worklist, SSA_NAME_VERSION (use));
- }
-
- /* Remove stmt. */
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Removing dead stmt:");
- print_gimple_stmt (dump_file, t, 0);
- }
- gimple_stmt_iterator gsi = gsi_for_stmt (t);
- if (gimple_code (t) == GIMPLE_PHI)
- remove_phi_node (&gsi, true);
- else
- {
- gsi_remove (&gsi, true);
- release_defs (t);
- }
- }
-}
generated by cgit v1.1 at 2025-08-11 12:40:05 +0000