aboutsummaryrefslogtreecommitdiff
path: root/gcc/cprop.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/cprop.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/cprop.c')
-rw-r--r--gcc/cprop.c1974
1 files changed, 0 insertions, 1974 deletions
diff --git a/gcc/cprop.c b/gcc/cprop.c
deleted file mode 100644
index c60f7e5..0000000
--- a/gcc/cprop.c
+++ /dev/null
@@ -1,1974 +0,0 @@
-/* Global constant/copy propagation for RTL.
- Copyright (C) 1997-2022 Free Software Foundation, Inc.
-
-This file is part of GCC.
-
-GCC is free software; you can redistribute it and/or modify it under
-the terms of the GNU General Public License as published by the Free
-Software Foundation; either version 3, or (at your option) any later
-version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-#include "config.h"
-#include "system.h"
-#include "coretypes.h"
-#include "backend.h"
-#include "rtl.h"
-#include "cfghooks.h"
-#include "df.h"
-#include "insn-config.h"
-#include "memmodel.h"
-#include "emit-rtl.h"
-#include "recog.h"
-#include "diagnostic-core.h"
-#include "toplev.h"
-#include "cfgrtl.h"
-#include "cfganal.h"
-#include "lcm.h"
-#include "cfgcleanup.h"
-#include "cselib.h"
-#include "intl.h"
-#include "tree-pass.h"
-#include "dbgcnt.h"
-#include "cfgloop.h"
-#include "gcse.h"
-
-
-/* An obstack for our working variables. */
-static struct obstack cprop_obstack;
-
-/* Occurrence of an expression.
- There is one per basic block. If a pattern appears more than once the
- last appearance is used. */
-
-struct cprop_occr
-{
- /* Next occurrence of this expression. */
- struct cprop_occr *next;
- /* The insn that computes the expression. */
- rtx_insn *insn;
-};
-
-/* Hash table entry for assignment expressions. */
-
-struct cprop_expr
-{
- /* The expression (DEST := SRC). */
- rtx dest;
- rtx src;
-
- /* Index in the available expression bitmaps. */
- int bitmap_index;
- /* Next entry with the same hash. */
- struct cprop_expr *next_same_hash;
- /* List of available occurrence in basic blocks in the function.
- An "available occurrence" is one that is the last occurrence in the
- basic block and whose operands are not modified by following statements
- in the basic block [including this insn]. */
- struct cprop_occr *avail_occr;
-};
-
-/* Hash table for copy propagation expressions.
- Each hash table is an array of buckets.
- ??? It is known that if it were an array of entries, structure elements
- `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
- not clear whether in the final analysis a sufficient amount of memory would
- be saved as the size of the available expression bitmaps would be larger
- [one could build a mapping table without holes afterwards though].
- Someday I'll perform the computation and figure it out. */
-
-struct hash_table_d
-{
- /* The table itself.
- This is an array of `set_hash_table_size' elements. */
- struct cprop_expr **table;
-
- /* Size of the hash table, in elements. */
- unsigned int size;
-
- /* Number of hash table elements. */
- unsigned int n_elems;
-};
-
-/* Copy propagation hash table. */
-static struct hash_table_d set_hash_table;
-
-/* Array of implicit set patterns indexed by basic block index. */
-static rtx *implicit_sets;
-
-/* Array of indexes of expressions for implicit set patterns indexed by basic
- block index. In other words, implicit_set_indexes[i] is the bitmap_index
- of the expression whose RTX is implicit_sets[i]. */
-static int *implicit_set_indexes;
-
-/* Bitmap containing one bit for each register in the program.
- Used when performing GCSE to track which registers have been set since
- the start or end of the basic block while traversing that block. */
-static regset reg_set_bitmap;
-
-/* Various variables for statistics gathering. */
-
-/* Memory used in a pass.
- This isn't intended to be absolutely precise. Its intent is only
- to keep an eye on memory usage. */
-static int bytes_used;
-
-/* Number of local constants propagated. */
-static int local_const_prop_count;
-/* Number of local copies propagated. */
-static int local_copy_prop_count;
-/* Number of global constants propagated. */
-static int global_const_prop_count;
-/* Number of global copies propagated. */
-static int global_copy_prop_count;
-
-#define GOBNEW(T) ((T *) cprop_alloc (sizeof (T)))
-#define GOBNEWVAR(T, S) ((T *) cprop_alloc ((S)))
-
-/* Cover function to obstack_alloc. */
-
-static void *
-cprop_alloc (unsigned long size)
-{
- bytes_used += size;
- return obstack_alloc (&cprop_obstack, size);
-}
-
-/* Return nonzero if register X is unchanged from INSN to the end
- of INSN's basic block. */
-
-static int
-reg_available_p (const_rtx x, const rtx_insn *insn ATTRIBUTE_UNUSED)
-{
- return ! REGNO_REG_SET_P (reg_set_bitmap, REGNO (x));
-}
-
-/* Hash a set of register REGNO.
-
- Sets are hashed on the register that is set. This simplifies the PRE copy
- propagation code.
-
- ??? May need to make things more elaborate. Later, as necessary. */
-
-static unsigned int
-hash_mod (int regno, int hash_table_size)
-{
- return (unsigned) regno % hash_table_size;
-}
-
-/* Insert assignment DEST:=SET from INSN in the hash table.
- DEST is a register and SET is a register or a suitable constant.
- If the assignment is already present in the table, record it as
- the last occurrence in INSN's basic block.
- IMPLICIT is true if it's an implicit set, false otherwise. */
-
-static void
-insert_set_in_table (rtx dest, rtx src, rtx_insn *insn,
- struct hash_table_d *table, bool implicit)
-{
- bool found = false;
- unsigned int hash;
- struct cprop_expr *cur_expr, *last_expr = NULL;
- struct cprop_occr *cur_occr;
-
- hash = hash_mod (REGNO (dest), table->size);
-
- for (cur_expr = table->table[hash]; cur_expr;
- cur_expr = cur_expr->next_same_hash)
- {
- if (dest == cur_expr->dest
- && src == cur_expr->src)
- {
- found = true;
- break;
- }
- last_expr = cur_expr;
- }
-
- if (! found)
- {
- cur_expr = GOBNEW (struct cprop_expr);
- bytes_used += sizeof (struct cprop_expr);
- if (table->table[hash] == NULL)
- /* This is the first pattern that hashed to this index. */
- table->table[hash] = cur_expr;
- else
- /* Add EXPR to end of this hash chain. */
- last_expr->next_same_hash = cur_expr;
-
- /* Set the fields of the expr element.
- We must copy X because it can be modified when copy propagation is
- performed on its operands. */
- cur_expr->dest = copy_rtx (dest);
- cur_expr->src = copy_rtx (src);
- cur_expr->bitmap_index = table->n_elems++;
- cur_expr->next_same_hash = NULL;
- cur_expr->avail_occr = NULL;
- }
-
- /* Now record the occurrence. */
- cur_occr = cur_expr->avail_occr;
-
- if (cur_occr
- && BLOCK_FOR_INSN (cur_occr->insn) == BLOCK_FOR_INSN (insn))
- {
- /* Found another instance of the expression in the same basic block.
- Prefer this occurrence to the currently recorded one. We want
- the last one in the block and the block is scanned from start
- to end. */
- cur_occr->insn = insn;
- }
- else
- {
- /* First occurrence of this expression in this basic block. */
- cur_occr = GOBNEW (struct cprop_occr);
- bytes_used += sizeof (struct cprop_occr);
- cur_occr->insn = insn;
- cur_occr->next = cur_expr->avail_occr;
- cur_expr->avail_occr = cur_occr;
- }
-
- /* Record bitmap_index of the implicit set in implicit_set_indexes. */
- if (implicit)
- implicit_set_indexes[BLOCK_FOR_INSN (insn)->index]
- = cur_expr->bitmap_index;
-}
-
-/* Determine whether the rtx X should be treated as a constant for CPROP.
- Since X might be inserted more than once we have to take care that it
- is sharable. */
-
-static bool
-cprop_constant_p (const_rtx x)
-{
- return CONSTANT_P (x) && (GET_CODE (x) != CONST || shared_const_p (x));
-}
-
-/* Determine whether the rtx X should be treated as a register that can
- be propagated. Any pseudo-register is fine. */
-
-static bool
-cprop_reg_p (const_rtx x)
-{
- return REG_P (x) && !HARD_REGISTER_P (x);
-}
-
-/* Scan SET present in INSN and add an entry to the hash TABLE.
- IMPLICIT is true if it's an implicit set, false otherwise. */
-
-static void
-hash_scan_set (rtx set, rtx_insn *insn, struct hash_table_d *table,
- bool implicit)
-{
- rtx src = SET_SRC (set);
- rtx dest = SET_DEST (set);
-
- if (cprop_reg_p (dest)
- && reg_available_p (dest, insn)
- && can_copy_p (GET_MODE (dest)))
- {
- /* See if a REG_EQUAL note shows this equivalent to a simpler expression.
-
- This allows us to do a single CPROP pass and still eliminate
- redundant constants, addresses or other expressions that are
- constructed with multiple instructions.
-
- However, keep the original SRC if INSN is a simple reg-reg move. In
- In this case, there will almost always be a REG_EQUAL note on the
- insn that sets SRC. By recording the REG_EQUAL value here as SRC
- for INSN, we miss copy propagation opportunities.
-
- Note that this does not impede profitable constant propagations. We
- "look through" reg-reg sets in lookup_set. */
- rtx note = find_reg_equal_equiv_note (insn);
- if (note != 0
- && REG_NOTE_KIND (note) == REG_EQUAL
- && !REG_P (src)
- && cprop_constant_p (XEXP (note, 0)))
- src = XEXP (note, 0), set = gen_rtx_SET (dest, src);
-
- /* Record sets for constant/copy propagation. */
- if ((cprop_reg_p (src)
- && src != dest
- && reg_available_p (src, insn))
- || cprop_constant_p (src))
- insert_set_in_table (dest, src, insn, table, implicit);
- }
-}
-
-/* Process INSN and add hash table entries as appropriate. */
-
-static void
-hash_scan_insn (rtx_insn *insn, struct hash_table_d *table)
-{
- rtx pat = PATTERN (insn);
- int i;
-
- /* Pick out the sets of INSN and for other forms of instructions record
- what's been modified. */
-
- if (GET_CODE (pat) == SET)
- hash_scan_set (pat, insn, table, false);
- else if (GET_CODE (pat) == PARALLEL)
- for (i = 0; i < XVECLEN (pat, 0); i++)
- {
- rtx x = XVECEXP (pat, 0, i);
-
- if (GET_CODE (x) == SET)
- hash_scan_set (x, insn, table, false);
- }
-}
-
-/* Dump the hash table TABLE to file FILE under the name NAME. */
-
-static void
-dump_hash_table (FILE *file, const char *name, struct hash_table_d *table)
-{
- int i;
- /* Flattened out table, so it's printed in proper order. */
- struct cprop_expr **flat_table;
- unsigned int *hash_val;
- struct cprop_expr *expr;
-
- flat_table = XCNEWVEC (struct cprop_expr *, table->n_elems);
- hash_val = XNEWVEC (unsigned int, table->n_elems);
-
- for (i = 0; i < (int) table->size; i++)
- for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
- {
- flat_table[expr->bitmap_index] = expr;
- hash_val[expr->bitmap_index] = i;
- }
-
- fprintf (file, "%s hash table (%d buckets, %d entries)\n",
- name, table->size, table->n_elems);
-
- for (i = 0; i < (int) table->n_elems; i++)
- if (flat_table[i] != 0)
- {
- expr = flat_table[i];
- fprintf (file, "Index %d (hash value %d)\n ",
- expr->bitmap_index, hash_val[i]);
- print_rtl (file, expr->dest);
- fprintf (file, " := ");
- print_rtl (file, expr->src);
- fprintf (file, "\n");
- }
-
- fprintf (file, "\n");
-
- free (flat_table);
- free (hash_val);
-}
-
-/* Record as unavailable all registers that are DEF operands of INSN. */
-
-static void
-make_set_regs_unavailable (rtx_insn *insn)
-{
- df_ref def;
-
- FOR_EACH_INSN_DEF (def, insn)
- SET_REGNO_REG_SET (reg_set_bitmap, DF_REF_REGNO (def));
-}
-
-/* Top level function to create an assignment hash table.
-
- Assignment entries are placed in the hash table if
- - they are of the form (set (pseudo-reg) src),
- - src is something we want to perform const/copy propagation on,
- - none of the operands or target are subsequently modified in the block
-
- Currently src must be a pseudo-reg or a const_int.
-
- TABLE is the table computed. */
-
-static void
-compute_hash_table_work (struct hash_table_d *table)
-{
- basic_block bb;
-
- /* Allocate vars to track sets of regs. */
- reg_set_bitmap = ALLOC_REG_SET (NULL);
-
- FOR_EACH_BB_FN (bb, cfun)
- {
- rtx_insn *insn;
-
- /* Reset tables used to keep track of what's not yet invalid [since
- the end of the block]. */
- CLEAR_REG_SET (reg_set_bitmap);
-
- /* Go over all insns from the last to the first. This is convenient
- for tracking available registers, i.e. not set between INSN and
- the end of the basic block BB. */
- FOR_BB_INSNS_REVERSE (bb, insn)
- {
- /* Only real insns are interesting. */
- if (!NONDEBUG_INSN_P (insn))
- continue;
-
- /* Record interesting sets from INSN in the hash table. */
- hash_scan_insn (insn, table);
-
- /* Any registers set in INSN will make SETs above it not AVAIL. */
- make_set_regs_unavailable (insn);
- }
-
- /* Insert implicit sets in the hash table, pretending they appear as
- insns at the head of the basic block. */
- if (implicit_sets[bb->index] != NULL_RTX)
- hash_scan_set (implicit_sets[bb->index], BB_HEAD (bb), table, true);
- }
-
- FREE_REG_SET (reg_set_bitmap);
-}
-
-/* Allocate space for the set/expr hash TABLE.
- It is used to determine the number of buckets to use. */
-
-static void
-alloc_hash_table (struct hash_table_d *table)
-{
- int n;
-
- n = get_max_insn_count ();
-
- table->size = n / 4;
- if (table->size < 11)
- table->size = 11;
-
- /* Attempt to maintain efficient use of hash table.
- Making it an odd number is simplest for now.
- ??? Later take some measurements. */
- table->size |= 1;
- n = table->size * sizeof (struct cprop_expr *);
- table->table = XNEWVAR (struct cprop_expr *, n);
-}
-
-/* Free things allocated by alloc_hash_table. */
-
-static void
-free_hash_table (struct hash_table_d *table)
-{
- free (table->table);
-}
-
-/* Compute the hash TABLE for doing copy/const propagation or
- expression hash table. */
-
-static void
-compute_hash_table (struct hash_table_d *table)
-{
- /* Initialize count of number of entries in hash table. */
- table->n_elems = 0;
- memset (table->table, 0, table->size * sizeof (struct cprop_expr *));
-
- compute_hash_table_work (table);
-}
-
-/* Expression tracking support. */
-
-/* Lookup REGNO in the set TABLE. The result is a pointer to the
- table entry, or NULL if not found. */
-
-static struct cprop_expr *
-lookup_set (unsigned int regno, struct hash_table_d *table)
-{
- unsigned int hash = hash_mod (regno, table->size);
- struct cprop_expr *expr;
-
- expr = table->table[hash];
-
- while (expr && REGNO (expr->dest) != regno)
- expr = expr->next_same_hash;
-
- return expr;
-}
-
-/* Return the next entry for REGNO in list EXPR. */
-
-static struct cprop_expr *
-next_set (unsigned int regno, struct cprop_expr *expr)
-{
- do
- expr = expr->next_same_hash;
- while (expr && REGNO (expr->dest) != regno);
-
- return expr;
-}
-
-/* Reset tables used to keep track of what's still available [since the
- start of the block]. */
-
-static void
-reset_opr_set_tables (void)
-{
- /* Maintain a bitmap of which regs have been set since beginning of
- the block. */
- CLEAR_REG_SET (reg_set_bitmap);
-}
-
-/* Return nonzero if the register X has not been set yet [since the
- start of the basic block containing INSN]. */
-
-static int
-reg_not_set_p (const_rtx x, const rtx_insn *insn ATTRIBUTE_UNUSED)
-{
- return ! REGNO_REG_SET_P (reg_set_bitmap, REGNO (x));
-}
-
-/* Record things set by INSN.
- This data is used by reg_not_set_p. */
-
-static void
-mark_oprs_set (rtx_insn *insn)
-{
- df_ref def;
-
- FOR_EACH_INSN_DEF (def, insn)
- SET_REGNO_REG_SET (reg_set_bitmap, DF_REF_REGNO (def));
-}
-
-/* Compute copy/constant propagation working variables. */
-
-/* Local properties of assignments. */
-static sbitmap *cprop_avloc;
-static sbitmap *cprop_kill;
-
-/* Global properties of assignments (computed from the local properties). */
-static sbitmap *cprop_avin;
-static sbitmap *cprop_avout;
-
-/* Allocate vars used for copy/const propagation. N_BLOCKS is the number of
- basic blocks. N_SETS is the number of sets. */
-
-static void
-alloc_cprop_mem (int n_blocks, int n_sets)
-{
- cprop_avloc = sbitmap_vector_alloc (n_blocks, n_sets);
- cprop_kill = sbitmap_vector_alloc (n_blocks, n_sets);
-
- cprop_avin = sbitmap_vector_alloc (n_blocks, n_sets);
- cprop_avout = sbitmap_vector_alloc (n_blocks, n_sets);
-}
-
-/* Free vars used by copy/const propagation. */
-
-static void
-free_cprop_mem (void)
-{
- sbitmap_vector_free (cprop_avloc);
- sbitmap_vector_free (cprop_kill);
- sbitmap_vector_free (cprop_avin);
- sbitmap_vector_free (cprop_avout);
-}
-
-/* Compute the local properties of each recorded expression.
-
- Local properties are those that are defined by the block, irrespective of
- other blocks.
-
- An expression is killed in a block if its operands, either DEST or SRC, are
- modified in the block.
-
- An expression is computed (locally available) in a block if it is computed
- at least once and expression would contain the same value if the
- computation was moved to the end of the block.
-
- KILL and COMP are destination sbitmaps for recording local properties. */
-
-static void
-compute_local_properties (sbitmap *kill, sbitmap *comp,
- struct hash_table_d *table)
-{
- unsigned int i;
-
- /* Initialize the bitmaps that were passed in. */
- bitmap_vector_clear (kill, last_basic_block_for_fn (cfun));
- bitmap_vector_clear (comp, last_basic_block_for_fn (cfun));
-
- for (i = 0; i < table->size; i++)
- {
- struct cprop_expr *expr;
-
- for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
- {
- int indx = expr->bitmap_index;
- df_ref def;
- struct cprop_occr *occr;
-
- /* For each definition of the destination pseudo-reg, the expression
- is killed in the block where the definition is. */
- for (def = DF_REG_DEF_CHAIN (REGNO (expr->dest));
- def; def = DF_REF_NEXT_REG (def))
- bitmap_set_bit (kill[DF_REF_BB (def)->index], indx);
-
- /* If the source is a pseudo-reg, for each definition of the source,
- the expression is killed in the block where the definition is. */
- if (REG_P (expr->src))
- for (def = DF_REG_DEF_CHAIN (REGNO (expr->src));
- def; def = DF_REF_NEXT_REG (def))
- bitmap_set_bit (kill[DF_REF_BB (def)->index], indx);
-
- /* The occurrences recorded in avail_occr are exactly those that
- are locally available in the block where they are. */
- for (occr = expr->avail_occr; occr != NULL; occr = occr->next)
- {
- bitmap_set_bit (comp[BLOCK_FOR_INSN (occr->insn)->index], indx);
- }
- }
- }
-}
-
-/* Hash table support. */
-
-/* Top level routine to do the dataflow analysis needed by copy/const
- propagation. */
-
-static void
-compute_cprop_data (void)
-{
- basic_block bb;
-
- compute_local_properties (cprop_kill, cprop_avloc, &set_hash_table);
- compute_available (cprop_avloc, cprop_kill, cprop_avout, cprop_avin);
-
- /* Merge implicit sets into CPROP_AVIN. They are always available at the
- entry of their basic block. We need to do this because 1) implicit sets
- aren't recorded for the local pass so they cannot be propagated within
- their basic block by this pass and 2) the global pass would otherwise
- propagate them only in the successors of their basic block. */
- FOR_EACH_BB_FN (bb, cfun)
- {
- int index = implicit_set_indexes[bb->index];
- if (index != -1)
- bitmap_set_bit (cprop_avin[bb->index], index);
- }
-}
-
-/* Copy/constant propagation. */
-
-/* Maximum number of register uses in an insn that we handle. */
-#define MAX_USES 8
-
-/* Table of uses (registers, both hard and pseudo) found in an insn.
- Allocated statically to avoid alloc/free complexity and overhead. */
-static rtx reg_use_table[MAX_USES];
-
-/* Index into `reg_use_table' while building it. */
-static unsigned reg_use_count;
-
-/* Set up a list of register numbers used in INSN. The found uses are stored
- in `reg_use_table'. `reg_use_count' is initialized to zero before entry,
- and contains the number of uses in the table upon exit.
-
- ??? If a register appears multiple times we will record it multiple times.
- This doesn't hurt anything but it will slow things down. */
-
-static void
-find_used_regs (rtx *xptr, void *data ATTRIBUTE_UNUSED)
-{
- int i, j;
- enum rtx_code code;
- const char *fmt;
- rtx x = *xptr;
-
- /* repeat is used to turn tail-recursion into iteration since GCC
- can't do it when there's no return value. */
- repeat:
- if (x == 0)
- return;
-
- code = GET_CODE (x);
- if (REG_P (x))
- {
- if (reg_use_count == MAX_USES)
- return;
-
- reg_use_table[reg_use_count] = x;
- reg_use_count++;
- }
-
- /* Recursively scan the operands of this expression. */
-
- for (i = GET_RTX_LENGTH (code) - 1, fmt = GET_RTX_FORMAT (code); i >= 0; i--)
- {
- if (fmt[i] == 'e')
- {
- /* If we are about to do the last recursive call
- needed at this level, change it into iteration.
- This function is called enough to be worth it. */
- if (i == 0)
- {
- x = XEXP (x, 0);
- goto repeat;
- }
-
- find_used_regs (&XEXP (x, i), data);
- }
- else if (fmt[i] == 'E')
- for (j = 0; j < XVECLEN (x, i); j++)
- find_used_regs (&XVECEXP (x, i, j), data);
- }
-}
-
-/* Try to replace all uses of FROM in INSN with TO.
- Return nonzero if successful. */
-
-static int
-try_replace_reg (rtx from, rtx to, rtx_insn *insn)
-{
- rtx note = find_reg_equal_equiv_note (insn);
- rtx src = 0;
- int success = 0;
- rtx set = single_set (insn);
-
- bool check_rtx_costs = true;
- bool speed = optimize_bb_for_speed_p (BLOCK_FOR_INSN (insn));
- int old_cost = set ? set_rtx_cost (set, speed) : 0;
-
- if (!set
- || CONSTANT_P (SET_SRC (set))
- || (note != 0
- && REG_NOTE_KIND (note) == REG_EQUAL
- && (GET_CODE (XEXP (note, 0)) == CONST
- || CONSTANT_P (XEXP (note, 0)))))
- check_rtx_costs = false;
-
- /* Usually we substitute easy stuff, so we won't copy everything.
- We however need to take care to not duplicate non-trivial CONST
- expressions. */
- to = copy_rtx (to);
-
- validate_replace_src_group (from, to, insn);
-
- /* If TO is a constant, check the cost of the set after propagation
- to the cost of the set before the propagation. If the cost is
- higher, then do not replace FROM with TO. */
-
- if (check_rtx_costs
- && CONSTANT_P (to)
- && set_rtx_cost (set, speed) > old_cost)
- {
- cancel_changes (0);
- return false;
- }
-
-
- if (num_changes_pending () && apply_change_group ())
- success = 1;
-
- /* Try to simplify SET_SRC if we have substituted a constant. */
- if (success && set && CONSTANT_P (to))
- {
- src = simplify_rtx (SET_SRC (set));
-
- if (src)
- validate_change (insn, &SET_SRC (set), src, 0);
- }
-
- /* If there is already a REG_EQUAL note, update the expression in it
- with our replacement. */
- if (note != 0 && REG_NOTE_KIND (note) == REG_EQUAL)
- set_unique_reg_note (insn, REG_EQUAL,
- simplify_replace_rtx (XEXP (note, 0), from, to));
- if (!success && set && reg_mentioned_p (from, SET_SRC (set)))
- {
- /* If above failed and this is a single set, try to simplify the source
- of the set given our substitution. We could perhaps try this for
- multiple SETs, but it probably won't buy us anything. */
- src = simplify_replace_rtx (SET_SRC (set), from, to);
-
- if (!rtx_equal_p (src, SET_SRC (set))
- && validate_change (insn, &SET_SRC (set), src, 0))
- success = 1;
-
- /* If we've failed perform the replacement, have a single SET to
- a REG destination and don't yet have a note, add a REG_EQUAL note
- to not lose information. */
- if (!success && note == 0 && set != 0 && REG_P (SET_DEST (set)))
- note = set_unique_reg_note (insn, REG_EQUAL, copy_rtx (src));
- }
-
- if (set && MEM_P (SET_DEST (set)) && reg_mentioned_p (from, SET_DEST (set)))
- {
- /* Registers can also appear as uses in SET_DEST if it is a MEM.
- We could perhaps try this for multiple SETs, but it probably
- won't buy us anything. */
- rtx dest = simplify_replace_rtx (SET_DEST (set), from, to);
-
- if (!rtx_equal_p (dest, SET_DEST (set))
- && validate_change (insn, &SET_DEST (set), dest, 0))
- success = 1;
- }
-
- /* REG_EQUAL may get simplified into register.
- We don't allow that. Remove that note. This code ought
- not to happen, because previous code ought to synthesize
- reg-reg move, but be on the safe side. */
- if (note && REG_NOTE_KIND (note) == REG_EQUAL && REG_P (XEXP (note, 0)))
- remove_note (insn, note);
-
- return success;
-}
-
-/* Find a set of REGNOs that are available on entry to INSN's block. If found,
- SET_RET[0] will be assigned a set with a register source and SET_RET[1] a
- set with a constant source. If not found the corresponding entry is set to
- NULL. */
-
-static void
-find_avail_set (int regno, rtx_insn *insn, struct cprop_expr *set_ret[2])
-{
- set_ret[0] = set_ret[1] = NULL;
-
- /* Loops are not possible here. To get a loop we would need two sets
- available at the start of the block containing INSN. i.e. we would
- need two sets like this available at the start of the block:
-
- (set (reg X) (reg Y))
- (set (reg Y) (reg X))
-
- This cannot happen since the set of (reg Y) would have killed the
- set of (reg X) making it unavailable at the start of this block. */
- while (1)
- {
- rtx src;
- struct cprop_expr *set = lookup_set (regno, &set_hash_table);
-
- /* Find a set that is available at the start of the block
- which contains INSN. */
- while (set)
- {
- if (bitmap_bit_p (cprop_avin[BLOCK_FOR_INSN (insn)->index],
- set->bitmap_index))
- break;
- set = next_set (regno, set);
- }
-
- /* If no available set was found we've reached the end of the
- (possibly empty) copy chain. */
- if (set == 0)
- break;
-
- src = set->src;
-
- /* We know the set is available.
- Now check that SRC is locally anticipatable (i.e. none of the
- source operands have changed since the start of the block).
-
- If the source operand changed, we may still use it for the next
- iteration of this loop, but we may not use it for substitutions. */
-
- if (cprop_constant_p (src))
- set_ret[1] = set;
- else if (reg_not_set_p (src, insn))
- set_ret[0] = set;
-
- /* If the source of the set is anything except a register, then
- we have reached the end of the copy chain. */
- if (! REG_P (src))
- break;
-
- /* Follow the copy chain, i.e. start another iteration of the loop
- and see if we have an available copy into SRC. */
- regno = REGNO (src);
- }
-}
-
-/* Subroutine of cprop_insn that tries to propagate constants into
- JUMP_INSNS. JUMP must be a conditional jump. If SETCC is non-NULL
- it is the instruction that immediately precedes JUMP, and must be a
- single SET of a register. FROM is what we will try to replace,
- SRC is the constant we will try to substitute for it. Return nonzero
- if a change was made. */
-
-static int
-cprop_jump (basic_block bb, rtx_insn *setcc, rtx_insn *jump, rtx from, rtx src)
-{
- rtx new_rtx, set_src, note_src;
- rtx set = pc_set (jump);
- rtx note = find_reg_equal_equiv_note (jump);
-
- if (note)
- {
- note_src = XEXP (note, 0);
- if (GET_CODE (note_src) == EXPR_LIST)
- note_src = NULL_RTX;
- }
- else note_src = NULL_RTX;
-
- /* Prefer REG_EQUAL notes except those containing EXPR_LISTs. */
- set_src = note_src ? note_src : SET_SRC (set);
-
- /* First substitute the SETCC condition into the JUMP instruction,
- then substitute that given values into this expanded JUMP. */
- if (setcc != NULL_RTX
- && !modified_between_p (from, setcc, jump)
- && !modified_between_p (src, setcc, jump))
- {
- rtx setcc_src;
- rtx setcc_set = single_set (setcc);
- rtx setcc_note = find_reg_equal_equiv_note (setcc);
- setcc_src = (setcc_note && GET_CODE (XEXP (setcc_note, 0)) != EXPR_LIST)
- ? XEXP (setcc_note, 0) : SET_SRC (setcc_set);
- set_src = simplify_replace_rtx (set_src, SET_DEST (setcc_set),
- setcc_src);
- }
- else
- setcc = NULL;
-
- new_rtx = simplify_replace_rtx (set_src, from, src);
-
- /* If no simplification can be made, then try the next register. */
- if (rtx_equal_p (new_rtx, SET_SRC (set)))
- return 0;
-
- /* If this is now a no-op delete it, otherwise this must be a valid insn. */
- if (new_rtx == pc_rtx)
- delete_insn (jump);
- else
- {
- /* Ensure the value computed inside the jump insn to be equivalent
- to one computed by setcc. */
- if (setcc && modified_in_p (new_rtx, setcc))
- return 0;
- if (! validate_unshare_change (jump, &SET_SRC (set), new_rtx, 0))
- {
- /* When (some) constants are not valid in a comparison, and there
- are two registers to be replaced by constants before the entire
- comparison can be folded into a constant, we need to keep
- intermediate information in REG_EQUAL notes. For targets with
- separate compare insns, such notes are added by try_replace_reg.
- When we have a combined compare-and-branch instruction, however,
- we need to attach a note to the branch itself to make this
- optimization work. */
-
- if (!rtx_equal_p (new_rtx, note_src))
- set_unique_reg_note (jump, REG_EQUAL, copy_rtx (new_rtx));
- return 0;
- }
-
- /* Remove REG_EQUAL note after simplification. */
- if (note_src)
- remove_note (jump, note);
- }
-
- global_const_prop_count++;
- if (dump_file != NULL)
- {
- fprintf (dump_file,
- "GLOBAL CONST-PROP: Replacing reg %d in jump_insn %d with "
- "constant ", REGNO (from), INSN_UID (jump));
- print_rtl (dump_file, src);
- fprintf (dump_file, "\n");
- }
- purge_dead_edges (bb);
-
- /* If a conditional jump has been changed into unconditional jump, remove
- the jump and make the edge fallthru - this is always called in
- cfglayout mode. */
- if (new_rtx != pc_rtx && simplejump_p (jump))
- {
- edge e;
- edge_iterator ei;
-
- FOR_EACH_EDGE (e, ei, bb->succs)
- if (e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
- && BB_HEAD (e->dest) == JUMP_LABEL (jump))
- {
- e->flags |= EDGE_FALLTHRU;
- break;
- }
- delete_insn (jump);
- }
-
- return 1;
-}
-
-/* Subroutine of cprop_insn that tries to propagate constants. FROM is what
- we will try to replace, SRC is the constant we will try to substitute for
- it and INSN is the instruction where this will be happening. */
-
-static int
-constprop_register (rtx from, rtx src, rtx_insn *insn)
-{
- rtx sset;
- rtx_insn *next_insn;
-
- /* Check for reg setting instructions followed by conditional branch
- instructions first. */
- if ((sset = single_set (insn)) != NULL
- && (next_insn = next_nondebug_insn (insn)) != NULL
- && any_condjump_p (next_insn)
- && onlyjump_p (next_insn))
- {
- rtx dest = SET_DEST (sset);
- if (REG_P (dest)
- && cprop_jump (BLOCK_FOR_INSN (insn), insn, next_insn,
- from, src))
- return 1;
- }
-
- /* Handle normal insns next. */
- if (NONJUMP_INSN_P (insn) && try_replace_reg (from, src, insn))
- return 1;
-
- /* Try to propagate a CONST_INT into a conditional jump.
- We're pretty specific about what we will handle in this
- code, we can extend this as necessary over time.
-
- Right now the insn in question must look like
- (set (pc) (if_then_else ...)) */
- else if (any_condjump_p (insn) && onlyjump_p (insn))
- return cprop_jump (BLOCK_FOR_INSN (insn), NULL, insn, from, src);
- return 0;
-}
-
-/* Perform constant and copy propagation on INSN.
- Return nonzero if a change was made. */
-
-static int
-cprop_insn (rtx_insn *insn)
-{
- unsigned i;
- int changed = 0, changed_this_round;
- rtx note;
-
- do
- {
- changed_this_round = 0;
- reg_use_count = 0;
- note_uses (&PATTERN (insn), find_used_regs, NULL);
-
- /* We may win even when propagating constants into notes. */
- note = find_reg_equal_equiv_note (insn);
- if (note)
- find_used_regs (&XEXP (note, 0), NULL);
-
- for (i = 0; i < reg_use_count; i++)
- {
- rtx reg_used = reg_use_table[i];
- unsigned int regno = REGNO (reg_used);
- rtx src_cst = NULL, src_reg = NULL;
- struct cprop_expr *set[2];
-
- /* If the register has already been set in this block, there's
- nothing we can do. */
- if (! reg_not_set_p (reg_used, insn))
- continue;
-
- /* Find an assignment that sets reg_used and is available
- at the start of the block. */
- find_avail_set (regno, insn, set);
- if (set[0])
- src_reg = set[0]->src;
- if (set[1])
- src_cst = set[1]->src;
-
- /* Constant propagation. */
- if (src_cst && cprop_constant_p (src_cst)
- && constprop_register (reg_used, src_cst, insn))
- {
- changed_this_round = changed = 1;
- global_const_prop_count++;
- if (dump_file != NULL)
- {
- fprintf (dump_file,
- "GLOBAL CONST-PROP: Replacing reg %d in ", regno);
- fprintf (dump_file, "insn %d with constant ",
- INSN_UID (insn));
- print_rtl (dump_file, src_cst);
- fprintf (dump_file, "\n");
- }
- if (insn->deleted ())
- return 1;
- }
- /* Copy propagation. */
- else if (src_reg && cprop_reg_p (src_reg)
- && REGNO (src_reg) != regno
- && try_replace_reg (reg_used, src_reg, insn))
- {
- changed_this_round = changed = 1;
- global_copy_prop_count++;
- if (dump_file != NULL)
- {
- fprintf (dump_file,
- "GLOBAL COPY-PROP: Replacing reg %d in insn %d",
- regno, INSN_UID (insn));
- fprintf (dump_file, " with reg %d\n", REGNO (src_reg));
- }
-
- /* The original insn setting reg_used may or may not now be
- deletable. We leave the deletion to DCE. */
- /* FIXME: If it turns out that the insn isn't deletable,
- then we may have unnecessarily extended register lifetimes
- and made things worse. */
- }
- }
- }
- /* If try_replace_reg simplified the insn, the regs found by find_used_regs
- may not be valid anymore. Start over. */
- while (changed_this_round);
-
- if (changed && DEBUG_INSN_P (insn))
- return 0;
-
- return changed;
-}
-
-/* Like find_used_regs, but avoid recording uses that appear in
- input-output contexts such as zero_extract or pre_dec. This
- restricts the cases we consider to those for which local cprop
- can legitimately make replacements. */
-
-static void
-local_cprop_find_used_regs (rtx *xptr, void *data)
-{
- rtx x = *xptr;
-
- if (x == 0)
- return;
-
- switch (GET_CODE (x))
- {
- case ZERO_EXTRACT:
- case SIGN_EXTRACT:
- case STRICT_LOW_PART:
- return;
-
- case PRE_DEC:
- case PRE_INC:
- case POST_DEC:
- case POST_INC:
- case PRE_MODIFY:
- case POST_MODIFY:
- /* Can only legitimately appear this early in the context of
- stack pushes for function arguments, but handle all of the
- codes nonetheless. */
- return;
-
- case SUBREG:
- if (read_modify_subreg_p (x))
- return;
- break;
-
- default:
- break;
- }
-
- find_used_regs (xptr, data);
-}
-
-/* Try to perform local const/copy propagation on X in INSN. */
-
-static bool
-do_local_cprop (rtx x, rtx_insn *insn)
-{
- rtx newreg = NULL, newcnst = NULL;
-
- /* Rule out USE instructions and ASM statements as we don't want to
- change the hard registers mentioned. */
- if (REG_P (x)
- && (cprop_reg_p (x)
- || (GET_CODE (PATTERN (insn)) != USE
- && asm_noperands (PATTERN (insn)) < 0)))
- {
- cselib_val *val = cselib_lookup (x, GET_MODE (x), 0, VOIDmode);
- struct elt_loc_list *l;
-
- if (!val)
- return false;
- for (l = val->locs; l; l = l->next)
- {
- rtx this_rtx = l->loc;
- rtx note;
-
- if (cprop_constant_p (this_rtx))
- newcnst = this_rtx;
- if (cprop_reg_p (this_rtx)
- /* Don't copy propagate if it has attached REG_EQUIV note.
- At this point this only function parameters should have
- REG_EQUIV notes and if the argument slot is used somewhere
- explicitly, it means address of parameter has been taken,
- so we should not extend the lifetime of the pseudo. */
- && (!(note = find_reg_note (l->setting_insn, REG_EQUIV, NULL_RTX))
- || ! MEM_P (XEXP (note, 0))))
- newreg = this_rtx;
- }
- if (newcnst && constprop_register (x, newcnst, insn))
- {
- if (dump_file != NULL)
- {
- fprintf (dump_file, "LOCAL CONST-PROP: Replacing reg %d in ",
- REGNO (x));
- fprintf (dump_file, "insn %d with constant ",
- INSN_UID (insn));
- print_rtl (dump_file, newcnst);
- fprintf (dump_file, "\n");
- }
- local_const_prop_count++;
- return true;
- }
- else if (newreg && newreg != x && try_replace_reg (x, newreg, insn))
- {
- if (dump_file != NULL)
- {
- fprintf (dump_file,
- "LOCAL COPY-PROP: Replacing reg %d in insn %d",
- REGNO (x), INSN_UID (insn));
- fprintf (dump_file, " with reg %d\n", REGNO (newreg));
- }
- local_copy_prop_count++;
- return true;
- }
- }
- return false;
-}
-
-/* Do local const/copy propagation (i.e. within each basic block). */
-
-static int
-local_cprop_pass (void)
-{
- basic_block bb;
- rtx_insn *insn;
- bool changed = false;
- unsigned i;
-
- auto_vec<rtx_insn *> uncond_traps;
-
- cselib_init (0);
- FOR_EACH_BB_FN (bb, cfun)
- {
- FOR_BB_INSNS (bb, insn)
- {
- if (INSN_P (insn))
- {
- bool was_uncond_trap
- = (GET_CODE (PATTERN (insn)) == TRAP_IF
- && XEXP (PATTERN (insn), 0) == const1_rtx);
- rtx note = find_reg_equal_equiv_note (insn);
- do
- {
- reg_use_count = 0;
- note_uses (&PATTERN (insn), local_cprop_find_used_regs,
- NULL);
- if (note)
- local_cprop_find_used_regs (&XEXP (note, 0), NULL);
-
- for (i = 0; i < reg_use_count; i++)
- {
- if (do_local_cprop (reg_use_table[i], insn))
- {
- if (!DEBUG_INSN_P (insn))
- changed = true;
- break;
- }
- }
- if (!was_uncond_trap
- && GET_CODE (PATTERN (insn)) == TRAP_IF
- && XEXP (PATTERN (insn), 0) == const1_rtx)
- {
- uncond_traps.safe_push (insn);
- break;
- }
- if (insn->deleted ())
- break;
- }
- while (i < reg_use_count);
- }
- cselib_process_insn (insn);
- }
-
- /* Forget everything at the end of a basic block. */
- cselib_clear_table ();
- }
-
- cselib_finish ();
-
- while (!uncond_traps.is_empty ())
- {
- rtx_insn *insn = uncond_traps.pop ();
- basic_block to_split = BLOCK_FOR_INSN (insn);
- remove_edge (split_block (to_split, insn));
- emit_barrier_after_bb (to_split);
- }
-
- return changed;
-}
-
-/* Similar to get_condition, only the resulting condition must be
- valid at JUMP, instead of at EARLIEST.
-
- This differs from noce_get_condition in ifcvt.c in that we prefer not to
- settle for the condition variable in the jump instruction being integral.
- We prefer to be able to record the value of a user variable, rather than
- the value of a temporary used in a condition. This could be solved by
- recording the value of *every* register scanned by canonicalize_condition,
- but this would require some code reorganization. */
-
-rtx
-fis_get_condition (rtx_insn *jump)
-{
- return get_condition (jump, NULL, false, true);
-}
-
-/* Check the comparison COND to see if we can safely form an implicit
- set from it. */
-
-static bool
-implicit_set_cond_p (const_rtx cond)
-{
- machine_mode mode;
- rtx cst;
-
- /* COND must be either an EQ or NE comparison. */
- if (GET_CODE (cond) != EQ && GET_CODE (cond) != NE)
- return false;
-
- /* The first operand of COND must be a register we can propagate. */
- if (!cprop_reg_p (XEXP (cond, 0)))
- return false;
-
- /* The second operand of COND must be a suitable constant. */
- mode = GET_MODE (XEXP (cond, 0));
- cst = XEXP (cond, 1);
-
- /* We can't perform this optimization if either operand might be or might
- contain a signed zero. */
- if (HONOR_SIGNED_ZEROS (mode))
- {
- /* It is sufficient to check if CST is or contains a zero. We must
- handle float, complex, and vector. If any subpart is a zero, then
- the optimization can't be performed. */
- /* ??? The complex and vector checks are not implemented yet. We just
- always return zero for them. */
- if (CONST_DOUBLE_AS_FLOAT_P (cst)
- && real_equal (CONST_DOUBLE_REAL_VALUE (cst), &dconst0))
- return 0;
- else
- return 0;
- }
-
- return cprop_constant_p (cst);
-}
-
-/* Find the implicit sets of a function. An "implicit set" is a constraint
- on the value of a variable, implied by a conditional jump. For example,
- following "if (x == 2)", the then branch may be optimized as though the
- conditional performed an "explicit set", in this example, "x = 2". This
- function records the set patterns that are implicit at the start of each
- basic block.
-
- If an implicit set is found but the set is implicit on a critical edge,
- this critical edge is split.
-
- Return true if the CFG was modified, false otherwise. */
-
-static bool
-find_implicit_sets (void)
-{
- basic_block bb, dest;
- rtx cond, new_rtx;
- unsigned int count = 0;
- bool edges_split = false;
- size_t implicit_sets_size = last_basic_block_for_fn (cfun) + 10;
-
- implicit_sets = XCNEWVEC (rtx, implicit_sets_size);
-
- FOR_EACH_BB_FN (bb, cfun)
- {
- /* Check for more than one successor. */
- if (EDGE_COUNT (bb->succs) <= 1)
- continue;
-
- cond = fis_get_condition (BB_END (bb));
-
- /* If no condition is found or if it isn't of a suitable form,
- ignore it. */
- if (! cond || ! implicit_set_cond_p (cond))
- continue;
-
- dest = GET_CODE (cond) == EQ
- ? BRANCH_EDGE (bb)->dest : FALLTHRU_EDGE (bb)->dest;
-
- /* If DEST doesn't go anywhere, ignore it. */
- if (! dest || dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
- continue;
-
- /* We have found a suitable implicit set. Try to record it now as
- a SET in DEST. If DEST has more than one predecessor, the edge
- between BB and DEST is a critical edge and we must split it,
- because we can only record one implicit set per DEST basic block. */
- if (! single_pred_p (dest))
- {
- dest = split_edge (find_edge (bb, dest));
- edges_split = true;
- }
-
- if (implicit_sets_size <= (size_t) dest->index)
- {
- size_t old_implicit_sets_size = implicit_sets_size;
- implicit_sets_size *= 2;
- implicit_sets = XRESIZEVEC (rtx, implicit_sets, implicit_sets_size);
- memset (implicit_sets + old_implicit_sets_size, 0,
- (implicit_sets_size - old_implicit_sets_size) * sizeof (rtx));
- }
-
- new_rtx = gen_rtx_SET (XEXP (cond, 0), XEXP (cond, 1));
- implicit_sets[dest->index] = new_rtx;
- if (dump_file)
- {
- fprintf (dump_file, "Implicit set of reg %d in ",
- REGNO (XEXP (cond, 0)));
- fprintf (dump_file, "basic block %d\n", dest->index);
- }
- count++;
- }
-
- if (dump_file)
- fprintf (dump_file, "Found %d implicit sets\n", count);
-
- /* Confess our sins. */
- return edges_split;
-}
-
-/* Bypass conditional jumps. */
-
-/* The value of last_basic_block at the beginning of the jump_bypass
- pass. The use of redirect_edge_and_branch_force may introduce new
- basic blocks, but the data flow analysis is only valid for basic
- block indices less than bypass_last_basic_block. */
-
-static int bypass_last_basic_block;
-
-/* Find a set of REGNO to a constant that is available at the end of basic
- block BB. Return NULL if no such set is found. Based heavily upon
- find_avail_set. */
-
-static struct cprop_expr *
-find_bypass_set (int regno, int bb)
-{
- struct cprop_expr *result = 0;
-
- for (;;)
- {
- rtx src;
- struct cprop_expr *set = lookup_set (regno, &set_hash_table);
-
- while (set)
- {
- if (bitmap_bit_p (cprop_avout[bb], set->bitmap_index))
- break;
- set = next_set (regno, set);
- }
-
- if (set == 0)
- break;
-
- src = set->src;
- if (cprop_constant_p (src))
- result = set;
-
- if (! REG_P (src))
- break;
-
- regno = REGNO (src);
- }
- return result;
-}
-
-/* Subroutine of bypass_block that checks whether a pseudo is killed by
- any of the instructions inserted on an edge. Jump bypassing places
- condition code setters on CFG edges using insert_insn_on_edge. This
- function is required to check that our data flow analysis is still
- valid prior to commit_edge_insertions. */
-
-static bool
-reg_killed_on_edge (const_rtx reg, const_edge e)
-{
- rtx_insn *insn;
-
- for (insn = e->insns.r; insn; insn = NEXT_INSN (insn))
- if (INSN_P (insn) && reg_set_p (reg, insn))
- return true;
-
- return false;
-}
-
-/* Subroutine of bypass_conditional_jumps that attempts to bypass the given
- basic block BB which has more than one predecessor. If not NULL, SETCC
- is the first instruction of BB, which is immediately followed by JUMP_INSN
- JUMP. Otherwise, SETCC is NULL, and JUMP is the first insn of BB.
- Returns nonzero if a change was made.
-
- During the jump bypassing pass, we may place copies of SETCC instructions
- on CFG edges. The following routine must be careful to pay attention to
- these inserted insns when performing its transformations. */
-
-static int
-bypass_block (basic_block bb, rtx_insn *setcc, rtx_insn *jump)
-{
- rtx_insn *insn;
- rtx note;
- edge e, edest;
- int change;
- int may_be_loop_header = false;
- unsigned removed_p;
- unsigned i;
- edge_iterator ei;
-
- insn = (setcc != NULL) ? setcc : jump;
-
- /* Determine set of register uses in INSN. */
- reg_use_count = 0;
- note_uses (&PATTERN (insn), find_used_regs, NULL);
- note = find_reg_equal_equiv_note (insn);
- if (note)
- find_used_regs (&XEXP (note, 0), NULL);
-
- if (current_loops)
- {
- /* If we are to preserve loop structure then do not bypass
- a loop header. This will either rotate the loop, create
- multiple entry loops or even irreducible regions. */
- if (bb == bb->loop_father->header)
- return 0;
- }
- else
- {
- FOR_EACH_EDGE (e, ei, bb->preds)
- if (e->flags & EDGE_DFS_BACK)
- {
- may_be_loop_header = true;
- break;
- }
- }
-
- change = 0;
- for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); )
- {
- removed_p = 0;
-
- if (e->flags & EDGE_COMPLEX)
- {
- ei_next (&ei);
- continue;
- }
-
- /* We can't redirect edges from new basic blocks. */
- if (e->src->index >= bypass_last_basic_block)
- {
- ei_next (&ei);
- continue;
- }
-
- /* The irreducible loops created by redirecting of edges entering the
- loop from outside would decrease effectiveness of some of the
- following optimizations, so prevent this. */
- if (may_be_loop_header
- && !(e->flags & EDGE_DFS_BACK))
- {
- ei_next (&ei);
- continue;
- }
-
- for (i = 0; i < reg_use_count; i++)
- {
- rtx reg_used = reg_use_table[i];
- unsigned int regno = REGNO (reg_used);
- basic_block dest, old_dest;
- struct cprop_expr *set;
- rtx src, new_rtx;
-
- set = find_bypass_set (regno, e->src->index);
-
- if (! set)
- continue;
-
- /* Check the data flow is valid after edge insertions. */
- if (e->insns.r && reg_killed_on_edge (reg_used, e))
- continue;
-
- src = SET_SRC (pc_set (jump));
-
- if (setcc != NULL)
- src = simplify_replace_rtx (src,
- SET_DEST (PATTERN (setcc)),
- SET_SRC (PATTERN (setcc)));
-
- new_rtx = simplify_replace_rtx (src, reg_used, set->src);
-
- /* Jump bypassing may have already placed instructions on
- edges of the CFG. We can't bypass an outgoing edge that
- has instructions associated with it, as these insns won't
- get executed if the incoming edge is redirected. */
- if (new_rtx == pc_rtx)
- {
- edest = FALLTHRU_EDGE (bb);
- dest = edest->insns.r ? NULL : edest->dest;
- }
- else if (GET_CODE (new_rtx) == LABEL_REF)
- {
- dest = BLOCK_FOR_INSN (XEXP (new_rtx, 0));
- /* Don't bypass edges containing instructions. */
- edest = find_edge (bb, dest);
- if (edest && edest->insns.r)
- dest = NULL;
- }
- else
- dest = NULL;
-
- /* Avoid unification of the edge with other edges from original
- branch. We would end up emitting the instruction on "both"
- edges. */
- if (dest && setcc && find_edge (e->src, dest))
- dest = NULL;
-
- old_dest = e->dest;
- if (dest != NULL
- && dest != old_dest
- && dest != EXIT_BLOCK_PTR_FOR_FN (cfun))
- {
- redirect_edge_and_branch_force (e, dest);
-
- /* Copy the register setter to the redirected edge. */
- if (setcc)
- {
- rtx pat = PATTERN (setcc);
- insert_insn_on_edge (copy_insn (pat), e);
- }
-
- if (dump_file != NULL)
- {
- fprintf (dump_file, "JUMP-BYPASS: Proved reg %d "
- "in jump_insn %d equals constant ",
- regno, INSN_UID (jump));
- print_rtl (dump_file, set->src);
- fprintf (dump_file, "\n\t when BB %d is entered from "
- "BB %d. Redirect edge %d->%d to %d.\n",
- old_dest->index, e->src->index, e->src->index,
- old_dest->index, dest->index);
- }
- change = 1;
- removed_p = 1;
- break;
- }
- }
- if (!removed_p)
- ei_next (&ei);
- }
- return change;
-}
-
-/* Find basic blocks with more than one predecessor that only contain a
- single conditional jump. If the result of the comparison is known at
- compile-time from any incoming edge, redirect that edge to the
- appropriate target. Return nonzero if a change was made.
-
- This function is now mis-named, because we also handle indirect jumps. */
-
-static int
-bypass_conditional_jumps (void)
-{
- basic_block bb;
- int changed;
- rtx_insn *setcc;
- rtx_insn *insn;
- rtx dest;
-
- /* Note we start at block 1. */
- if (ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb == EXIT_BLOCK_PTR_FOR_FN (cfun))
- return 0;
-
- mark_dfs_back_edges ();
-
- changed = 0;
- FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb->next_bb,
- EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb)
- {
- /* Check for more than one predecessor. */
- if (!single_pred_p (bb))
- {
- setcc = NULL;
- FOR_BB_INSNS (bb, insn)
- if (DEBUG_INSN_P (insn))
- continue;
- else if (NONJUMP_INSN_P (insn))
- {
- if (setcc)
- break;
- if (GET_CODE (PATTERN (insn)) != SET)
- break;
-
- dest = SET_DEST (PATTERN (insn));
- if (REG_P (dest))
- setcc = insn;
- else
- break;
- }
- else if (JUMP_P (insn))
- {
- if ((any_condjump_p (insn) || computed_jump_p (insn))
- && onlyjump_p (insn))
- changed |= bypass_block (bb, setcc, insn);
- break;
- }
- else if (INSN_P (insn))
- break;
- }
- }
-
- /* If we bypassed any register setting insns, we inserted a
- copy on the redirected edge. These need to be committed. */
- if (changed)
- commit_edge_insertions ();
-
- return changed;
-}
-
-/* Main function for the CPROP pass. */
-
-static int
-one_cprop_pass (void)
-{
- int i;
- int changed = 0;
-
- /* Return if there's nothing to do, or it is too expensive. */
- if (n_basic_blocks_for_fn (cfun) <= NUM_FIXED_BLOCKS + 1
- || gcse_or_cprop_is_too_expensive (_ ("const/copy propagation disabled")))
- return 0;
-
- global_const_prop_count = local_const_prop_count = 0;
- global_copy_prop_count = local_copy_prop_count = 0;
-
- bytes_used = 0;
- gcc_obstack_init (&cprop_obstack);
-
- /* Do a local const/copy propagation pass first. The global pass
- only handles global opportunities.
- If the local pass changes something, remove any unreachable blocks
- because the CPROP global dataflow analysis may get into infinite
- loops for CFGs with unreachable blocks.
-
- FIXME: This local pass should not be necessary after CSE (but for
- some reason it still is). It is also (proven) not necessary
- to run the local pass right after FWPWOP.
-
- FIXME: The global analysis would not get into infinite loops if it
- would use the DF solver (via df_simple_dataflow) instead of
- the solver implemented in this file. */
- changed |= local_cprop_pass ();
- if (changed)
- delete_unreachable_blocks ();
-
- /* Determine implicit sets. This may change the CFG (split critical
- edges if that exposes an implicit set).
- Note that find_implicit_sets() does not rely on up-to-date DF caches
- so that we do not have to re-run df_analyze() even if local CPROP
- changed something.
- ??? This could run earlier so that any uncovered implicit sets
- sets could be exploited in local_cprop_pass() also. Later. */
- changed |= find_implicit_sets ();
-
- /* If local_cprop_pass() or find_implicit_sets() changed something,
- run df_analyze() to bring all insn caches up-to-date, and to take
- new basic blocks from edge splitting on the DF radar.
- NB: This also runs the fast DCE pass, because execute_rtl_cprop
- sets DF_LR_RUN_DCE. */
- if (changed)
- df_analyze ();
-
- /* Initialize implicit_set_indexes array. */
- implicit_set_indexes = XNEWVEC (int, last_basic_block_for_fn (cfun));
- for (i = 0; i < last_basic_block_for_fn (cfun); i++)
- implicit_set_indexes[i] = -1;
-
- alloc_hash_table (&set_hash_table);
- compute_hash_table (&set_hash_table);
-
- /* Free implicit_sets before peak usage. */
- free (implicit_sets);
- implicit_sets = NULL;
-
- if (dump_file)
- dump_hash_table (dump_file, "SET", &set_hash_table);
- if (set_hash_table.n_elems > 0)
- {
- basic_block bb;
- auto_vec<rtx_insn *> uncond_traps;
-
- alloc_cprop_mem (last_basic_block_for_fn (cfun),
- set_hash_table.n_elems);
- compute_cprop_data ();
-
- free (implicit_set_indexes);
- implicit_set_indexes = NULL;
-
- /* Allocate vars to track sets of regs. */
- reg_set_bitmap = ALLOC_REG_SET (NULL);
-
- FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb->next_bb,
- EXIT_BLOCK_PTR_FOR_FN (cfun),
- next_bb)
- {
- bool seen_uncond_trap = false;
- rtx_insn *insn;
-
- /* Reset tables used to keep track of what's still valid [since
- the start of the block]. */
- reset_opr_set_tables ();
-
- FOR_BB_INSNS (bb, insn)
- if (INSN_P (insn))
- {
- bool was_uncond_trap
- = (GET_CODE (PATTERN (insn)) == TRAP_IF
- && XEXP (PATTERN (insn), 0) == const1_rtx);
-
- changed |= cprop_insn (insn);
-
- /* Keep track of everything modified by this insn. */
- /* ??? Need to be careful w.r.t. mods done to INSN.
- Don't call mark_oprs_set if we turned the
- insn into a NOTE, or deleted the insn. */
- if (! NOTE_P (insn) && ! insn->deleted ())
- mark_oprs_set (insn);
-
- if (!was_uncond_trap
- && GET_CODE (PATTERN (insn)) == TRAP_IF
- && XEXP (PATTERN (insn), 0) == const1_rtx)
- {
- /* If we have already seen an unconditional trap
- earlier, the rest of the bb is going to be removed
- as unreachable. Just turn it into a note, so that
- RTL verification doesn't complain about it before
- it is finally removed. */
- if (seen_uncond_trap)
- set_insn_deleted (insn);
- else
- {
- seen_uncond_trap = true;
- uncond_traps.safe_push (insn);
- }
- }
- }
- }
-
- /* Make sure bypass_conditional_jumps will ignore not just its new
- basic blocks, but also the ones after unconditional traps (those are
- unreachable and will be eventually removed as such). */
- bypass_last_basic_block = last_basic_block_for_fn (cfun);
-
- while (!uncond_traps.is_empty ())
- {
- rtx_insn *insn = uncond_traps.pop ();
- basic_block to_split = BLOCK_FOR_INSN (insn);
- remove_edge (split_block (to_split, insn));
- emit_barrier_after_bb (to_split);
- }
-
- changed |= bypass_conditional_jumps ();
-
- FREE_REG_SET (reg_set_bitmap);
- free_cprop_mem ();
- }
- else
- {
- free (implicit_set_indexes);
- implicit_set_indexes = NULL;
- }
-
- free_hash_table (&set_hash_table);
- obstack_free (&cprop_obstack, NULL);
-
- if (dump_file)
- {
- fprintf (dump_file, "CPROP of %s, %d basic blocks, %d bytes needed, ",
- current_function_name (), n_basic_blocks_for_fn (cfun),
- bytes_used);
- fprintf (dump_file, "%d local const props, %d local copy props, ",
- local_const_prop_count, local_copy_prop_count);
- fprintf (dump_file, "%d global const props, %d global copy props\n\n",
- global_const_prop_count, global_copy_prop_count);
- }
-
- return changed;
-}
-
-/* All the passes implemented in this file. Each pass has its
- own gate and execute function, and at the end of the file a
- pass definition for passes.c.
-
- We do not construct an accurate cfg in functions which call
- setjmp, so none of these passes runs if the function calls
- setjmp.
- FIXME: Should just handle setjmp via REG_SETJMP notes. */
-
-static unsigned int
-execute_rtl_cprop (void)
-{
- int changed;
- delete_unreachable_blocks ();
- df_set_flags (DF_LR_RUN_DCE);
- df_analyze ();
- changed = one_cprop_pass ();
- flag_rerun_cse_after_global_opts |= changed;
- if (changed)
- cleanup_cfg (CLEANUP_CFG_CHANGED);
- return 0;
-}
-
-namespace {
-
-const pass_data pass_data_rtl_cprop =
-{
- RTL_PASS, /* type */
- "cprop", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_CPROP, /* tv_id */
- PROP_cfglayout, /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- TODO_df_finish, /* todo_flags_finish */
-};
-
-class pass_rtl_cprop : public rtl_opt_pass
-{
-public:
- pass_rtl_cprop (gcc::context *ctxt)
- : rtl_opt_pass (pass_data_rtl_cprop, ctxt)
- {}
-
- /* opt_pass methods: */
- opt_pass * clone () { return new pass_rtl_cprop (m_ctxt); }
- virtual bool gate (function *fun)
- {
- return optimize > 0 && flag_gcse
- && !fun->calls_setjmp
- && dbg_cnt (cprop);
- }
-
- virtual unsigned int execute (function *) { return execute_rtl_cprop (); }
-
-}; // class pass_rtl_cprop
-
-} // anon namespace
-
-rtl_opt_pass *
-make_pass_rtl_cprop (gcc::context *ctxt)
-{
- return new pass_rtl_cprop (ctxt);
-}
generated by cgit v1.1 at 2025-08-31 20:10:58 +0000