aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-ssa-pre.c
diff options
context:
space:
mode:
authorMartin Liska <mliska@suse.cz>2022-01-14 16:56:44 +0100
committerMartin Liska <mliska@suse.cz>2022-01-17 22:12:04 +0100
commit5c69acb32329d49e58c26fa41ae74229a52b9106 (patch)
treeddb05f9d73afb6f998457d2ac4b720e3b3b60483 /gcc/tree-ssa-pre.c
parent490e23032baaece71f2ec09fa1805064b150fbc2 (diff)
downloadgcc-5c69acb32329d49e58c26fa41ae74229a52b9106.zip
gcc-5c69acb32329d49e58c26fa41ae74229a52b9106.tar.gz
gcc-5c69acb32329d49e58c26fa41ae74229a52b9106.tar.bz2
Rename .c files to .cc files.
gcc/ada/ChangeLog: * adadecode.c: Moved to... * adadecode.cc: ...here. * affinity.c: Moved to... * affinity.cc: ...here. * argv-lynxos178-raven-cert.c: Moved to... * argv-lynxos178-raven-cert.cc: ...here. * argv.c: Moved to... * argv.cc: ...here. * aux-io.c: Moved to... * aux-io.cc: ...here. * cio.c: Moved to... * cio.cc: ...here. * cstreams.c: Moved to... * cstreams.cc: ...here. * env.c: Moved to... * env.cc: ...here. * exit.c: Moved to... * exit.cc: ...here. * expect.c: Moved to... * expect.cc: ...here. * final.c: Moved to... * final.cc: ...here. * gcc-interface/cuintp.c: Moved to... * gcc-interface/cuintp.cc: ...here. * gcc-interface/decl.c: Moved to... * gcc-interface/decl.cc: ...here. * gcc-interface/misc.c: Moved to... * gcc-interface/misc.cc: ...here. * gcc-interface/targtyps.c: Moved to... * gcc-interface/targtyps.cc: ...here. * gcc-interface/trans.c: Moved to... * gcc-interface/trans.cc: ...here. * gcc-interface/utils.c: Moved to... * gcc-interface/utils.cc: ...here. * gcc-interface/utils2.c: Moved to... * gcc-interface/utils2.cc: ...here. * init.c: Moved to... * init.cc: ...here. * initialize.c: Moved to... * initialize.cc: ...here. * libgnarl/thread.c: Moved to... * libgnarl/thread.cc: ...here. * link.c: Moved to... * link.cc: ...here. * locales.c: Moved to... * locales.cc: ...here. * mkdir.c: Moved to... * mkdir.cc: ...here. * raise.c: Moved to... * raise.cc: ...here. * rtfinal.c: Moved to... * rtfinal.cc: ...here. * rtinit.c: Moved to... * rtinit.cc: ...here. * seh_init.c: Moved to... * seh_init.cc: ...here. * sigtramp-armdroid.c: Moved to... * sigtramp-armdroid.cc: ...here. * sigtramp-ios.c: Moved to... * sigtramp-ios.cc: ...here. * sigtramp-qnx.c: Moved to... * sigtramp-qnx.cc: ...here. * sigtramp-vxworks.c: Moved to... * sigtramp-vxworks.cc: ...here. * socket.c: Moved to... * socket.cc: ...here. * tracebak.c: Moved to... * tracebak.cc: ...here. * version.c: Moved to... * version.cc: ...here. * vx_stack_info.c: Moved to... * vx_stack_info.cc: ...here. gcc/ChangeLog: * adjust-alignment.c: Moved to... * adjust-alignment.cc: ...here. * alias.c: Moved to... * alias.cc: ...here. * alloc-pool.c: Moved to... * alloc-pool.cc: ...here. * asan.c: Moved to... * asan.cc: ...here. * attribs.c: Moved to... * attribs.cc: ...here. * auto-inc-dec.c: Moved to... * auto-inc-dec.cc: ...here. * auto-profile.c: Moved to... * auto-profile.cc: ...here. * bb-reorder.c: Moved to... * bb-reorder.cc: ...here. * bitmap.c: Moved to... * bitmap.cc: ...here. * btfout.c: Moved to... * btfout.cc: ...here. * builtins.c: Moved to... * builtins.cc: ...here. * caller-save.c: Moved to... * caller-save.cc: ...here. * calls.c: Moved to... * calls.cc: ...here. * ccmp.c: Moved to... * ccmp.cc: ...here. * cfg.c: Moved to... * cfg.cc: ...here. * cfganal.c: Moved to... * cfganal.cc: ...here. * cfgbuild.c: Moved to... * cfgbuild.cc: ...here. * cfgcleanup.c: Moved to... * cfgcleanup.cc: ...here. * cfgexpand.c: Moved to... * cfgexpand.cc: ...here. * cfghooks.c: Moved to... * cfghooks.cc: ...here. * cfgloop.c: Moved to... * cfgloop.cc: ...here. * cfgloopanal.c: Moved to... * cfgloopanal.cc: ...here. * cfgloopmanip.c: Moved to... * cfgloopmanip.cc: ...here. * cfgrtl.c: Moved to... * cfgrtl.cc: ...here. * cgraph.c: Moved to... * cgraph.cc: ...here. * cgraphbuild.c: Moved to... * cgraphbuild.cc: ...here. * cgraphclones.c: Moved to... * cgraphclones.cc: ...here. * cgraphunit.c: Moved to... * cgraphunit.cc: ...here. * collect-utils.c: Moved to... * collect-utils.cc: ...here. * collect2-aix.c: Moved to... * collect2-aix.cc: ...here. * collect2.c: Moved to... * collect2.cc: ...here. * combine-stack-adj.c: Moved to... * combine-stack-adj.cc: ...here. * combine.c: Moved to... * combine.cc: ...here. * common/common-targhooks.c: Moved to... * common/common-targhooks.cc: ...here. * common/config/aarch64/aarch64-common.c: Moved to... * common/config/aarch64/aarch64-common.cc: ...here. * common/config/alpha/alpha-common.c: Moved to... * common/config/alpha/alpha-common.cc: ...here. * common/config/arc/arc-common.c: Moved to... * common/config/arc/arc-common.cc: ...here. * common/config/arm/arm-common.c: Moved to... * common/config/arm/arm-common.cc: ...here. * common/config/avr/avr-common.c: Moved to... * common/config/avr/avr-common.cc: ...here. * common/config/bfin/bfin-common.c: Moved to... * common/config/bfin/bfin-common.cc: ...here. * common/config/bpf/bpf-common.c: Moved to... * common/config/bpf/bpf-common.cc: ...here. * common/config/c6x/c6x-common.c: Moved to... * common/config/c6x/c6x-common.cc: ...here. * common/config/cr16/cr16-common.c: Moved to... * common/config/cr16/cr16-common.cc: ...here. * common/config/cris/cris-common.c: Moved to... * common/config/cris/cris-common.cc: ...here. * common/config/csky/csky-common.c: Moved to... * common/config/csky/csky-common.cc: ...here. * common/config/default-common.c: Moved to... * common/config/default-common.cc: ...here. * common/config/epiphany/epiphany-common.c: Moved to... * common/config/epiphany/epiphany-common.cc: ...here. * common/config/fr30/fr30-common.c: Moved to... * common/config/fr30/fr30-common.cc: ...here. * common/config/frv/frv-common.c: Moved to... * common/config/frv/frv-common.cc: ...here. * common/config/gcn/gcn-common.c: Moved to... * common/config/gcn/gcn-common.cc: ...here. * common/config/h8300/h8300-common.c: Moved to... * common/config/h8300/h8300-common.cc: ...here. * common/config/i386/i386-common.c: Moved to... * common/config/i386/i386-common.cc: ...here. * common/config/ia64/ia64-common.c: Moved to... * common/config/ia64/ia64-common.cc: ...here. * common/config/iq2000/iq2000-common.c: Moved to... * common/config/iq2000/iq2000-common.cc: ...here. * common/config/lm32/lm32-common.c: Moved to... * common/config/lm32/lm32-common.cc: ...here. * common/config/m32r/m32r-common.c: Moved to... * common/config/m32r/m32r-common.cc: ...here. * common/config/m68k/m68k-common.c: Moved to... * common/config/m68k/m68k-common.cc: ...here. * common/config/mcore/mcore-common.c: Moved to... * common/config/mcore/mcore-common.cc: ...here. * common/config/microblaze/microblaze-common.c: Moved to... * common/config/microblaze/microblaze-common.cc: ...here. * common/config/mips/mips-common.c: Moved to... * common/config/mips/mips-common.cc: ...here. * common/config/mmix/mmix-common.c: Moved to... * common/config/mmix/mmix-common.cc: ...here. * common/config/mn10300/mn10300-common.c: Moved to... * common/config/mn10300/mn10300-common.cc: ...here. * common/config/msp430/msp430-common.c: Moved to... * common/config/msp430/msp430-common.cc: ...here. * common/config/nds32/nds32-common.c: Moved to... * common/config/nds32/nds32-common.cc: ...here. * common/config/nios2/nios2-common.c: Moved to... * common/config/nios2/nios2-common.cc: ...here. * common/config/nvptx/nvptx-common.c: Moved to... * common/config/nvptx/nvptx-common.cc: ...here. * common/config/or1k/or1k-common.c: Moved to... * common/config/or1k/or1k-common.cc: ...here. * common/config/pa/pa-common.c: Moved to... * common/config/pa/pa-common.cc: ...here. * common/config/pdp11/pdp11-common.c: Moved to... * common/config/pdp11/pdp11-common.cc: ...here. * common/config/pru/pru-common.c: Moved to... * common/config/pru/pru-common.cc: ...here. * common/config/riscv/riscv-common.c: Moved to... * common/config/riscv/riscv-common.cc: ...here. * common/config/rs6000/rs6000-common.c: Moved to... * common/config/rs6000/rs6000-common.cc: ...here. * common/config/rx/rx-common.c: Moved to... * common/config/rx/rx-common.cc: ...here. * common/config/s390/s390-common.c: Moved to... * common/config/s390/s390-common.cc: ...here. * common/config/sh/sh-common.c: Moved to... * common/config/sh/sh-common.cc: ...here. * common/config/sparc/sparc-common.c: Moved to... * common/config/sparc/sparc-common.cc: ...here. * common/config/tilegx/tilegx-common.c: Moved to... * common/config/tilegx/tilegx-common.cc: ...here. * common/config/tilepro/tilepro-common.c: Moved to... * common/config/tilepro/tilepro-common.cc: ...here. * common/config/v850/v850-common.c: Moved to... * common/config/v850/v850-common.cc: ...here. * common/config/vax/vax-common.c: Moved to... * common/config/vax/vax-common.cc: ...here. * common/config/visium/visium-common.c: Moved to... * common/config/visium/visium-common.cc: ...here. * common/config/xstormy16/xstormy16-common.c: Moved to... * common/config/xstormy16/xstormy16-common.cc: ...here. * common/config/xtensa/xtensa-common.c: Moved to... * common/config/xtensa/xtensa-common.cc: ...here. * compare-elim.c: Moved to... * compare-elim.cc: ...here. * config/aarch64/aarch64-bti-insert.c: Moved to... * config/aarch64/aarch64-bti-insert.cc: ...here. * config/aarch64/aarch64-builtins.c: Moved to... * config/aarch64/aarch64-builtins.cc: ...here. * config/aarch64/aarch64-c.c: Moved to... * config/aarch64/aarch64-c.cc: ...here. * config/aarch64/aarch64-d.c: Moved to... * config/aarch64/aarch64-d.cc: ...here. * config/aarch64/aarch64.c: Moved to... * config/aarch64/aarch64.cc: ...here. * config/aarch64/cortex-a57-fma-steering.c: Moved to... * config/aarch64/cortex-a57-fma-steering.cc: ...here. * config/aarch64/driver-aarch64.c: Moved to... * config/aarch64/driver-aarch64.cc: ...here. * config/aarch64/falkor-tag-collision-avoidance.c: Moved to... * config/aarch64/falkor-tag-collision-avoidance.cc: ...here. * config/aarch64/host-aarch64-darwin.c: Moved to... * config/aarch64/host-aarch64-darwin.cc: ...here. * config/alpha/alpha.c: Moved to... * config/alpha/alpha.cc: ...here. * config/alpha/driver-alpha.c: Moved to... * config/alpha/driver-alpha.cc: ...here. * config/arc/arc-c.c: Moved to... * config/arc/arc-c.cc: ...here. * config/arc/arc.c: Moved to... * config/arc/arc.cc: ...here. * config/arc/driver-arc.c: Moved to... * config/arc/driver-arc.cc: ...here. * config/arm/aarch-common.c: Moved to... * config/arm/aarch-common.cc: ...here. * config/arm/arm-builtins.c: Moved to... * config/arm/arm-builtins.cc: ...here. * config/arm/arm-c.c: Moved to... * config/arm/arm-c.cc: ...here. * config/arm/arm-d.c: Moved to... * config/arm/arm-d.cc: ...here. * config/arm/arm.c: Moved to... * config/arm/arm.cc: ...here. * config/arm/driver-arm.c: Moved to... * config/arm/driver-arm.cc: ...here. * config/avr/avr-c.c: Moved to... * config/avr/avr-c.cc: ...here. * config/avr/avr-devices.c: Moved to... * config/avr/avr-devices.cc: ...here. * config/avr/avr-log.c: Moved to... * config/avr/avr-log.cc: ...here. * config/avr/avr.c: Moved to... * config/avr/avr.cc: ...here. * config/avr/driver-avr.c: Moved to... * config/avr/driver-avr.cc: ...here. * config/avr/gen-avr-mmcu-specs.c: Moved to... * config/avr/gen-avr-mmcu-specs.cc: ...here. * config/avr/gen-avr-mmcu-texi.c: Moved to... * config/avr/gen-avr-mmcu-texi.cc: ...here. * config/bfin/bfin.c: Moved to... * config/bfin/bfin.cc: ...here. * config/bpf/bpf.c: Moved to... * config/bpf/bpf.cc: ...here. * config/bpf/coreout.c: Moved to... * config/bpf/coreout.cc: ...here. * config/c6x/c6x.c: Moved to... * config/c6x/c6x.cc: ...here. * config/cr16/cr16.c: Moved to... * config/cr16/cr16.cc: ...here. * config/cris/cris.c: Moved to... * config/cris/cris.cc: ...here. * config/csky/csky.c: Moved to... * config/csky/csky.cc: ...here. * config/darwin-c.c: Moved to... * config/darwin-c.cc: ...here. * config/darwin-d.c: Moved to... * config/darwin-d.cc: ...here. * config/darwin-driver.c: Moved to... * config/darwin-driver.cc: ...here. * config/darwin-f.c: Moved to... * config/darwin-f.cc: ...here. * config/darwin.c: Moved to... * config/darwin.cc: ...here. * config/default-c.c: Moved to... * config/default-c.cc: ...here. * config/default-d.c: Moved to... * config/default-d.cc: ...here. * config/dragonfly-d.c: Moved to... * config/dragonfly-d.cc: ...here. * config/epiphany/epiphany.c: Moved to... * config/epiphany/epiphany.cc: ...here. * config/epiphany/mode-switch-use.c: Moved to... * config/epiphany/mode-switch-use.cc: ...here. * config/epiphany/resolve-sw-modes.c: Moved to... * config/epiphany/resolve-sw-modes.cc: ...here. * config/fr30/fr30.c: Moved to... * config/fr30/fr30.cc: ...here. * config/freebsd-d.c: Moved to... * config/freebsd-d.cc: ...here. * config/frv/frv.c: Moved to... * config/frv/frv.cc: ...here. * config/ft32/ft32.c: Moved to... * config/ft32/ft32.cc: ...here. * config/gcn/driver-gcn.c: Moved to... * config/gcn/driver-gcn.cc: ...here. * config/gcn/gcn-run.c: Moved to... * config/gcn/gcn-run.cc: ...here. * config/gcn/gcn-tree.c: Moved to... * config/gcn/gcn-tree.cc: ...here. * config/gcn/gcn.c: Moved to... * config/gcn/gcn.cc: ...here. * config/gcn/mkoffload.c: Moved to... * config/gcn/mkoffload.cc: ...here. * config/glibc-c.c: Moved to... * config/glibc-c.cc: ...here. * config/glibc-d.c: Moved to... * config/glibc-d.cc: ...here. * config/h8300/h8300.c: Moved to... * config/h8300/h8300.cc: ...here. * config/host-darwin.c: Moved to... * config/host-darwin.cc: ...here. * config/host-hpux.c: Moved to... * config/host-hpux.cc: ...here. * config/host-linux.c: Moved to... * config/host-linux.cc: ...here. * config/host-netbsd.c: Moved to... * config/host-netbsd.cc: ...here. * config/host-openbsd.c: Moved to... * config/host-openbsd.cc: ...here. * config/host-solaris.c: Moved to... * config/host-solaris.cc: ...here. * config/i386/djgpp.c: Moved to... * config/i386/djgpp.cc: ...here. * config/i386/driver-i386.c: Moved to... * config/i386/driver-i386.cc: ...here. * config/i386/driver-mingw32.c: Moved to... * config/i386/driver-mingw32.cc: ...here. * config/i386/gnu-property.c: Moved to... * config/i386/gnu-property.cc: ...here. * config/i386/host-cygwin.c: Moved to... * config/i386/host-cygwin.cc: ...here. * config/i386/host-i386-darwin.c: Moved to... * config/i386/host-i386-darwin.cc: ...here. * config/i386/host-mingw32.c: Moved to... * config/i386/host-mingw32.cc: ...here. * config/i386/i386-builtins.c: Moved to... * config/i386/i386-builtins.cc: ...here. * config/i386/i386-c.c: Moved to... * config/i386/i386-c.cc: ...here. * config/i386/i386-d.c: Moved to... * config/i386/i386-d.cc: ...here. * config/i386/i386-expand.c: Moved to... * config/i386/i386-expand.cc: ...here. * config/i386/i386-features.c: Moved to... * config/i386/i386-features.cc: ...here. * config/i386/i386-options.c: Moved to... * config/i386/i386-options.cc: ...here. * config/i386/i386.c: Moved to... * config/i386/i386.cc: ...here. * config/i386/intelmic-mkoffload.c: Moved to... * config/i386/intelmic-mkoffload.cc: ...here. * config/i386/msformat-c.c: Moved to... * config/i386/msformat-c.cc: ...here. * config/i386/winnt-cxx.c: Moved to... * config/i386/winnt-cxx.cc: ...here. * config/i386/winnt-d.c: Moved to... * config/i386/winnt-d.cc: ...here. * config/i386/winnt-stubs.c: Moved to... * config/i386/winnt-stubs.cc: ...here. * config/i386/winnt.c: Moved to... * config/i386/winnt.cc: ...here. * config/i386/x86-tune-sched-atom.c: Moved to... * config/i386/x86-tune-sched-atom.cc: ...here. * config/i386/x86-tune-sched-bd.c: Moved to... * config/i386/x86-tune-sched-bd.cc: ...here. * config/i386/x86-tune-sched-core.c: Moved to... * config/i386/x86-tune-sched-core.cc: ...here. * config/i386/x86-tune-sched.c: Moved to... * config/i386/x86-tune-sched.cc: ...here. * config/ia64/ia64-c.c: Moved to... * config/ia64/ia64-c.cc: ...here. * config/ia64/ia64.c: Moved to... * config/ia64/ia64.cc: ...here. * config/iq2000/iq2000.c: Moved to... * config/iq2000/iq2000.cc: ...here. * config/linux.c: Moved to... * config/linux.cc: ...here. * config/lm32/lm32.c: Moved to... * config/lm32/lm32.cc: ...here. * config/m32c/m32c-pragma.c: Moved to... * config/m32c/m32c-pragma.cc: ...here. * config/m32c/m32c.c: Moved to... * config/m32c/m32c.cc: ...here. * config/m32r/m32r.c: Moved to... * config/m32r/m32r.cc: ...here. * config/m68k/m68k.c: Moved to... * config/m68k/m68k.cc: ...here. * config/mcore/mcore.c: Moved to... * config/mcore/mcore.cc: ...here. * config/microblaze/microblaze-c.c: Moved to... * config/microblaze/microblaze-c.cc: ...here. * config/microblaze/microblaze.c: Moved to... * config/microblaze/microblaze.cc: ...here. * config/mips/driver-native.c: Moved to... * config/mips/driver-native.cc: ...here. * config/mips/frame-header-opt.c: Moved to... * config/mips/frame-header-opt.cc: ...here. * config/mips/mips-d.c: Moved to... * config/mips/mips-d.cc: ...here. * config/mips/mips.c: Moved to... * config/mips/mips.cc: ...here. * config/mmix/mmix.c: Moved to... * config/mmix/mmix.cc: ...here. * config/mn10300/mn10300.c: Moved to... * config/mn10300/mn10300.cc: ...here. * config/moxie/moxie.c: Moved to... * config/moxie/moxie.cc: ...here. * config/msp430/driver-msp430.c: Moved to... * config/msp430/driver-msp430.cc: ...here. * config/msp430/msp430-c.c: Moved to... * config/msp430/msp430-c.cc: ...here. * config/msp430/msp430-devices.c: Moved to... * config/msp430/msp430-devices.cc: ...here. * config/msp430/msp430.c: Moved to... * config/msp430/msp430.cc: ...here. * config/nds32/nds32-cost.c: Moved to... * config/nds32/nds32-cost.cc: ...here. * config/nds32/nds32-fp-as-gp.c: Moved to... * config/nds32/nds32-fp-as-gp.cc: ...here. * config/nds32/nds32-intrinsic.c: Moved to... * config/nds32/nds32-intrinsic.cc: ...here. * config/nds32/nds32-isr.c: Moved to... * config/nds32/nds32-isr.cc: ...here. * config/nds32/nds32-md-auxiliary.c: Moved to... * config/nds32/nds32-md-auxiliary.cc: ...here. * config/nds32/nds32-memory-manipulation.c: Moved to... * config/nds32/nds32-memory-manipulation.cc: ...here. * config/nds32/nds32-pipelines-auxiliary.c: Moved to... * config/nds32/nds32-pipelines-auxiliary.cc: ...here. * config/nds32/nds32-predicates.c: Moved to... * config/nds32/nds32-predicates.cc: ...here. * config/nds32/nds32-relax-opt.c: Moved to... * config/nds32/nds32-relax-opt.cc: ...here. * config/nds32/nds32-utils.c: Moved to... * config/nds32/nds32-utils.cc: ...here. * config/nds32/nds32.c: Moved to... * config/nds32/nds32.cc: ...here. * config/netbsd-d.c: Moved to... * config/netbsd-d.cc: ...here. * config/netbsd.c: Moved to... * config/netbsd.cc: ...here. * config/nios2/nios2.c: Moved to... * config/nios2/nios2.cc: ...here. * config/nvptx/mkoffload.c: Moved to... * config/nvptx/mkoffload.cc: ...here. * config/nvptx/nvptx-c.c: Moved to... * config/nvptx/nvptx-c.cc: ...here. * config/nvptx/nvptx.c: Moved to... * config/nvptx/nvptx.cc: ...here. * config/openbsd-d.c: Moved to... * config/openbsd-d.cc: ...here. * config/or1k/or1k.c: Moved to... * config/or1k/or1k.cc: ...here. * config/pa/pa-d.c: Moved to... * config/pa/pa-d.cc: ...here. * config/pa/pa.c: Moved to... * config/pa/pa.cc: ...here. * config/pdp11/pdp11.c: Moved to... * config/pdp11/pdp11.cc: ...here. * config/pru/pru-passes.c: Moved to... * config/pru/pru-passes.cc: ...here. * config/pru/pru-pragma.c: Moved to... * config/pru/pru-pragma.cc: ...here. * config/pru/pru.c: Moved to... * config/pru/pru.cc: ...here. * config/riscv/riscv-builtins.c: Moved to... * config/riscv/riscv-builtins.cc: ...here. * config/riscv/riscv-c.c: Moved to... * config/riscv/riscv-c.cc: ...here. * config/riscv/riscv-d.c: Moved to... * config/riscv/riscv-d.cc: ...here. * config/riscv/riscv-shorten-memrefs.c: Moved to... * config/riscv/riscv-shorten-memrefs.cc: ...here. * config/riscv/riscv-sr.c: Moved to... * config/riscv/riscv-sr.cc: ...here. * config/riscv/riscv.c: Moved to... * config/riscv/riscv.cc: ...here. * config/rl78/rl78-c.c: Moved to... * config/rl78/rl78-c.cc: ...here. * config/rl78/rl78.c: Moved to... * config/rl78/rl78.cc: ...here. * config/rs6000/driver-rs6000.c: Moved to... * config/rs6000/driver-rs6000.cc: ...here. * config/rs6000/host-darwin.c: Moved to... * config/rs6000/host-darwin.cc: ...here. * config/rs6000/host-ppc64-darwin.c: Moved to... * config/rs6000/host-ppc64-darwin.cc: ...here. * config/rs6000/rbtree.c: Moved to... * config/rs6000/rbtree.cc: ...here. * config/rs6000/rs6000-c.c: Moved to... * config/rs6000/rs6000-c.cc: ...here. * config/rs6000/rs6000-call.c: Moved to... * config/rs6000/rs6000-call.cc: ...here. * config/rs6000/rs6000-d.c: Moved to... * config/rs6000/rs6000-d.cc: ...here. * config/rs6000/rs6000-gen-builtins.c: Moved to... * config/rs6000/rs6000-gen-builtins.cc: ...here. * config/rs6000/rs6000-linux.c: Moved to... * config/rs6000/rs6000-linux.cc: ...here. * config/rs6000/rs6000-logue.c: Moved to... * config/rs6000/rs6000-logue.cc: ...here. * config/rs6000/rs6000-p8swap.c: Moved to... * config/rs6000/rs6000-p8swap.cc: ...here. * config/rs6000/rs6000-pcrel-opt.c: Moved to... * config/rs6000/rs6000-pcrel-opt.cc: ...here. * config/rs6000/rs6000-string.c: Moved to... * config/rs6000/rs6000-string.cc: ...here. * config/rs6000/rs6000.c: Moved to... * config/rs6000/rs6000.cc: ...here. * config/rx/rx.c: Moved to... * config/rx/rx.cc: ...here. * config/s390/driver-native.c: Moved to... * config/s390/driver-native.cc: ...here. * config/s390/s390-c.c: Moved to... * config/s390/s390-c.cc: ...here. * config/s390/s390-d.c: Moved to... * config/s390/s390-d.cc: ...here. * config/s390/s390.c: Moved to... * config/s390/s390.cc: ...here. * config/sh/divtab-sh4-300.c: Moved to... * config/sh/divtab-sh4-300.cc: ...here. * config/sh/divtab-sh4.c: Moved to... * config/sh/divtab-sh4.cc: ...here. * config/sh/divtab.c: Moved to... * config/sh/divtab.cc: ...here. * config/sh/sh-c.c: Moved to... * config/sh/sh-c.cc: ...here. * config/sh/sh.c: Moved to... * config/sh/sh.cc: ...here. * config/sol2-c.c: Moved to... * config/sol2-c.cc: ...here. * config/sol2-cxx.c: Moved to... * config/sol2-cxx.cc: ...here. * config/sol2-d.c: Moved to... * config/sol2-d.cc: ...here. * config/sol2-stubs.c: Moved to... * config/sol2-stubs.cc: ...here. * config/sol2.c: Moved to... * config/sol2.cc: ...here. * config/sparc/driver-sparc.c: Moved to... * config/sparc/driver-sparc.cc: ...here. * config/sparc/sparc-c.c: Moved to... * config/sparc/sparc-c.cc: ...here. * config/sparc/sparc-d.c: Moved to... * config/sparc/sparc-d.cc: ...here. * config/sparc/sparc.c: Moved to... * config/sparc/sparc.cc: ...here. * config/stormy16/stormy16.c: Moved to... * config/stormy16/stormy16.cc: ...here. * config/tilegx/mul-tables.c: Moved to... * config/tilegx/mul-tables.cc: ...here. * config/tilegx/tilegx-c.c: Moved to... * config/tilegx/tilegx-c.cc: ...here. * config/tilegx/tilegx.c: Moved to... * config/tilegx/tilegx.cc: ...here. * config/tilepro/mul-tables.c: Moved to... * config/tilepro/mul-tables.cc: ...here. * config/tilepro/tilepro-c.c: Moved to... * config/tilepro/tilepro-c.cc: ...here. * config/tilepro/tilepro.c: Moved to... * config/tilepro/tilepro.cc: ...here. * config/v850/v850-c.c: Moved to... * config/v850/v850-c.cc: ...here. * config/v850/v850.c: Moved to... * config/v850/v850.cc: ...here. * config/vax/vax.c: Moved to... * config/vax/vax.cc: ...here. * config/visium/visium.c: Moved to... * config/visium/visium.cc: ...here. * config/vms/vms-c.c: Moved to... * config/vms/vms-c.cc: ...here. * config/vms/vms-f.c: Moved to... * config/vms/vms-f.cc: ...here. * config/vms/vms.c: Moved to... * config/vms/vms.cc: ...here. * config/vxworks-c.c: Moved to... * config/vxworks-c.cc: ...here. * config/vxworks.c: Moved to... * config/vxworks.cc: ...here. * config/winnt-c.c: Moved to... * config/winnt-c.cc: ...here. * config/xtensa/xtensa.c: Moved to... * config/xtensa/xtensa.cc: ...here. * context.c: Moved to... * context.cc: ...here. * convert.c: Moved to... * convert.cc: ...here. * coverage.c: Moved to... * coverage.cc: ...here. * cppbuiltin.c: Moved to... * cppbuiltin.cc: ...here. * cppdefault.c: Moved to... * cppdefault.cc: ...here. * cprop.c: Moved to... * cprop.cc: ...here. * cse.c: Moved to... * cse.cc: ...here. * cselib.c: Moved to... * cselib.cc: ...here. * ctfc.c: Moved to... * ctfc.cc: ...here. * ctfout.c: Moved to... * ctfout.cc: ...here. * data-streamer-in.c: Moved to... * data-streamer-in.cc: ...here. * data-streamer-out.c: Moved to... * data-streamer-out.cc: ...here. * data-streamer.c: Moved to... * data-streamer.cc: ...here. * dbgcnt.c: Moved to... * dbgcnt.cc: ...here. * dbxout.c: Moved to... * dbxout.cc: ...here. * dce.c: Moved to... * dce.cc: ...here. * ddg.c: Moved to... * ddg.cc: ...here. * debug.c: Moved to... * debug.cc: ...here. * df-core.c: Moved to... * df-core.cc: ...here. * df-problems.c: Moved to... * df-problems.cc: ...here. * df-scan.c: Moved to... * df-scan.cc: ...here. * dfp.c: Moved to... * dfp.cc: ...here. * diagnostic-color.c: Moved to... * diagnostic-color.cc: ...here. * diagnostic-show-locus.c: Moved to... * diagnostic-show-locus.cc: ...here. * diagnostic-spec.c: Moved to... * diagnostic-spec.cc: ...here. * diagnostic.c: Moved to... * diagnostic.cc: ...here. * dojump.c: Moved to... * dojump.cc: ...here. * dominance.c: Moved to... * dominance.cc: ...here. * domwalk.c: Moved to... * domwalk.cc: ...here. * double-int.c: Moved to... * double-int.cc: ...here. * dse.c: Moved to... * dse.cc: ...here. * dumpfile.c: Moved to... * dumpfile.cc: ...here. * dwarf2asm.c: Moved to... * dwarf2asm.cc: ...here. * dwarf2cfi.c: Moved to... * dwarf2cfi.cc: ...here. * dwarf2ctf.c: Moved to... * dwarf2ctf.cc: ...here. * dwarf2out.c: Moved to... * dwarf2out.cc: ...here. * early-remat.c: Moved to... * early-remat.cc: ...here. * edit-context.c: Moved to... * edit-context.cc: ...here. * emit-rtl.c: Moved to... * emit-rtl.cc: ...here. * errors.c: Moved to... * errors.cc: ...here. * et-forest.c: Moved to... * et-forest.cc: ...here. * except.c: Moved to... * except.cc: ...here. * explow.c: Moved to... * explow.cc: ...here. * expmed.c: Moved to... * expmed.cc: ...here. * expr.c: Moved to... * expr.cc: ...here. * fibonacci_heap.c: Moved to... * fibonacci_heap.cc: ...here. * file-find.c: Moved to... * file-find.cc: ...here. * file-prefix-map.c: Moved to... * file-prefix-map.cc: ...here. * final.c: Moved to... * final.cc: ...here. * fixed-value.c: Moved to... * fixed-value.cc: ...here. * fold-const-call.c: Moved to... * fold-const-call.cc: ...here. * fold-const.c: Moved to... * fold-const.cc: ...here. * fp-test.c: Moved to... * fp-test.cc: ...here. * function-tests.c: Moved to... * function-tests.cc: ...here. * function.c: Moved to... * function.cc: ...here. * fwprop.c: Moved to... * fwprop.cc: ...here. * gcc-ar.c: Moved to... * gcc-ar.cc: ...here. * gcc-main.c: Moved to... * gcc-main.cc: ...here. * gcc-rich-location.c: Moved to... * gcc-rich-location.cc: ...here. * gcc.c: Moved to... * gcc.cc: ...here. * gcov-dump.c: Moved to... * gcov-dump.cc: ...here. * gcov-io.c: Moved to... * gcov-io.cc: ...here. * gcov-tool.c: Moved to... * gcov-tool.cc: ...here. * gcov.c: Moved to... * gcov.cc: ...here. * gcse-common.c: Moved to... * gcse-common.cc: ...here. * gcse.c: Moved to... * gcse.cc: ...here. * genattr-common.c: Moved to... * genattr-common.cc: ...here. * genattr.c: Moved to... * genattr.cc: ...here. * genattrtab.c: Moved to... * genattrtab.cc: ...here. * genautomata.c: Moved to... * genautomata.cc: ...here. * gencfn-macros.c: Moved to... * gencfn-macros.cc: ...here. * gencheck.c: Moved to... * gencheck.cc: ...here. * genchecksum.c: Moved to... * genchecksum.cc: ...here. * gencodes.c: Moved to... * gencodes.cc: ...here. * genconditions.c: Moved to... * genconditions.cc: ...here. * genconfig.c: Moved to... * genconfig.cc: ...here. * genconstants.c: Moved to... * genconstants.cc: ...here. * genemit.c: Moved to... * genemit.cc: ...here. * genenums.c: Moved to... * genenums.cc: ...here. * generic-match-head.c: Moved to... * generic-match-head.cc: ...here. * genextract.c: Moved to... * genextract.cc: ...here. * genflags.c: Moved to... * genflags.cc: ...here. * gengenrtl.c: Moved to... * gengenrtl.cc: ...here. * gengtype-parse.c: Moved to... * gengtype-parse.cc: ...here. * gengtype-state.c: Moved to... * gengtype-state.cc: ...here. * gengtype.c: Moved to... * gengtype.cc: ...here. * genhooks.c: Moved to... * genhooks.cc: ...here. * genmatch.c: Moved to... * genmatch.cc: ...here. * genmddeps.c: Moved to... * genmddeps.cc: ...here. * genmddump.c: Moved to... * genmddump.cc: ...here. * genmodes.c: Moved to... * genmodes.cc: ...here. * genopinit.c: Moved to... * genopinit.cc: ...here. * genoutput.c: Moved to... * genoutput.cc: ...here. * genpeep.c: Moved to... * genpeep.cc: ...here. * genpreds.c: Moved to... * genpreds.cc: ...here. * genrecog.c: Moved to... * genrecog.cc: ...here. * gensupport.c: Moved to... * gensupport.cc: ...here. * gentarget-def.c: Moved to... * gentarget-def.cc: ...here. * genversion.c: Moved to... * genversion.cc: ...here. * ggc-common.c: Moved to... * ggc-common.cc: ...here. * ggc-none.c: Moved to... * ggc-none.cc: ...here. * ggc-page.c: Moved to... * ggc-page.cc: ...here. * ggc-tests.c: Moved to... * ggc-tests.cc: ...here. * gimple-builder.c: Moved to... * gimple-builder.cc: ...here. * gimple-expr.c: Moved to... * gimple-expr.cc: ...here. * gimple-fold.c: Moved to... * gimple-fold.cc: ...here. * gimple-iterator.c: Moved to... * gimple-iterator.cc: ...here. * gimple-laddress.c: Moved to... * gimple-laddress.cc: ...here. * gimple-loop-jam.c: Moved to... * gimple-loop-jam.cc: ...here. * gimple-low.c: Moved to... * gimple-low.cc: ...here. * gimple-match-head.c: Moved to... * gimple-match-head.cc: ...here. * gimple-pretty-print.c: Moved to... * gimple-pretty-print.cc: ...here. * gimple-ssa-backprop.c: Moved to... * gimple-ssa-backprop.cc: ...here. * gimple-ssa-evrp-analyze.c: Moved to... * gimple-ssa-evrp-analyze.cc: ...here. * gimple-ssa-evrp.c: Moved to... * gimple-ssa-evrp.cc: ...here. * gimple-ssa-isolate-paths.c: Moved to... * gimple-ssa-isolate-paths.cc: ...here. * gimple-ssa-nonnull-compare.c: Moved to... * gimple-ssa-nonnull-compare.cc: ...here. * gimple-ssa-split-paths.c: Moved to... * gimple-ssa-split-paths.cc: ...here. * gimple-ssa-sprintf.c: Moved to... * gimple-ssa-sprintf.cc: ...here. * gimple-ssa-store-merging.c: Moved to... * gimple-ssa-store-merging.cc: ...here. * gimple-ssa-strength-reduction.c: Moved to... * gimple-ssa-strength-reduction.cc: ...here. * gimple-ssa-warn-alloca.c: Moved to... * gimple-ssa-warn-alloca.cc: ...here. * gimple-ssa-warn-restrict.c: Moved to... * gimple-ssa-warn-restrict.cc: ...here. * gimple-streamer-in.c: Moved to... * gimple-streamer-in.cc: ...here. * gimple-streamer-out.c: Moved to... * gimple-streamer-out.cc: ...here. * gimple-walk.c: Moved to... * gimple-walk.cc: ...here. * gimple-warn-recursion.c: Moved to... * gimple-warn-recursion.cc: ...here. * gimple.c: Moved to... * gimple.cc: ...here. * gimplify-me.c: Moved to... * gimplify-me.cc: ...here. * gimplify.c: Moved to... * gimplify.cc: ...here. * godump.c: Moved to... * godump.cc: ...here. * graph.c: Moved to... * graph.cc: ...here. * graphds.c: Moved to... * graphds.cc: ...here. * graphite-dependences.c: Moved to... * graphite-dependences.cc: ...here. * graphite-isl-ast-to-gimple.c: Moved to... * graphite-isl-ast-to-gimple.cc: ...here. * graphite-optimize-isl.c: Moved to... * graphite-optimize-isl.cc: ...here. * graphite-poly.c: Moved to... * graphite-poly.cc: ...here. * graphite-scop-detection.c: Moved to... * graphite-scop-detection.cc: ...here. * graphite-sese-to-poly.c: Moved to... * graphite-sese-to-poly.cc: ...here. * graphite.c: Moved to... * graphite.cc: ...here. * haifa-sched.c: Moved to... * haifa-sched.cc: ...here. * hash-map-tests.c: Moved to... * hash-map-tests.cc: ...here. * hash-set-tests.c: Moved to... * hash-set-tests.cc: ...here. * hash-table.c: Moved to... * hash-table.cc: ...here. * hooks.c: Moved to... * hooks.cc: ...here. * host-default.c: Moved to... * host-default.cc: ...here. * hw-doloop.c: Moved to... * hw-doloop.cc: ...here. * hwint.c: Moved to... * hwint.cc: ...here. * ifcvt.c: Moved to... * ifcvt.cc: ...here. * inchash.c: Moved to... * inchash.cc: ...here. * incpath.c: Moved to... * incpath.cc: ...here. * init-regs.c: Moved to... * init-regs.cc: ...here. * input.c: Moved to... * input.cc: ...here. * internal-fn.c: Moved to... * internal-fn.cc: ...here. * intl.c: Moved to... * intl.cc: ...here. * ipa-comdats.c: Moved to... * ipa-comdats.cc: ...here. * ipa-cp.c: Moved to... * ipa-cp.cc: ...here. * ipa-devirt.c: Moved to... * ipa-devirt.cc: ...here. * ipa-fnsummary.c: Moved to... * ipa-fnsummary.cc: ...here. * ipa-icf-gimple.c: Moved to... * ipa-icf-gimple.cc: ...here. * ipa-icf.c: Moved to... * ipa-icf.cc: ...here. * ipa-inline-analysis.c: Moved to... * ipa-inline-analysis.cc: ...here. * ipa-inline-transform.c: Moved to... * ipa-inline-transform.cc: ...here. * ipa-inline.c: Moved to... * ipa-inline.cc: ...here. * ipa-modref-tree.c: Moved to... * ipa-modref-tree.cc: ...here. * ipa-modref.c: Moved to... * ipa-modref.cc: ...here. * ipa-param-manipulation.c: Moved to... * ipa-param-manipulation.cc: ...here. * ipa-polymorphic-call.c: Moved to... * ipa-polymorphic-call.cc: ...here. * ipa-predicate.c: Moved to... * ipa-predicate.cc: ...here. * ipa-profile.c: Moved to... * ipa-profile.cc: ...here. * ipa-prop.c: Moved to... * ipa-prop.cc: ...here. * ipa-pure-const.c: Moved to... * ipa-pure-const.cc: ...here. * ipa-ref.c: Moved to... * ipa-ref.cc: ...here. * ipa-reference.c: Moved to... * ipa-reference.cc: ...here. * ipa-split.c: Moved to... * ipa-split.cc: ...here. * ipa-sra.c: Moved to... * ipa-sra.cc: ...here. * ipa-utils.c: Moved to... * ipa-utils.cc: ...here. * ipa-visibility.c: Moved to... * ipa-visibility.cc: ...here. * ipa.c: Moved to... * ipa.cc: ...here. * ira-build.c: Moved to... * ira-build.cc: ...here. * ira-color.c: Moved to... * ira-color.cc: ...here. * ira-conflicts.c: Moved to... * ira-conflicts.cc: ...here. * ira-costs.c: Moved to... * ira-costs.cc: ...here. * ira-emit.c: Moved to... * ira-emit.cc: ...here. * ira-lives.c: Moved to... * ira-lives.cc: ...here. * ira.c: Moved to... * ira.cc: ...here. * jump.c: Moved to... * jump.cc: ...here. * langhooks.c: Moved to... * langhooks.cc: ...here. * lcm.c: Moved to... * lcm.cc: ...here. * lists.c: Moved to... * lists.cc: ...here. * loop-doloop.c: Moved to... * loop-doloop.cc: ...here. * loop-init.c: Moved to... * loop-init.cc: ...here. * loop-invariant.c: Moved to... * loop-invariant.cc: ...here. * loop-iv.c: Moved to... * loop-iv.cc: ...here. * loop-unroll.c: Moved to... * loop-unroll.cc: ...here. * lower-subreg.c: Moved to... * lower-subreg.cc: ...here. * lra-assigns.c: Moved to... * lra-assigns.cc: ...here. * lra-coalesce.c: Moved to... * lra-coalesce.cc: ...here. * lra-constraints.c: Moved to... * lra-constraints.cc: ...here. * lra-eliminations.c: Moved to... * lra-eliminations.cc: ...here. * lra-lives.c: Moved to... * lra-lives.cc: ...here. * lra-remat.c: Moved to... * lra-remat.cc: ...here. * lra-spills.c: Moved to... * lra-spills.cc: ...here. * lra.c: Moved to... * lra.cc: ...here. * lto-cgraph.c: Moved to... * lto-cgraph.cc: ...here. * lto-compress.c: Moved to... * lto-compress.cc: ...here. * lto-opts.c: Moved to... * lto-opts.cc: ...here. * lto-section-in.c: Moved to... * lto-section-in.cc: ...here. * lto-section-out.c: Moved to... * lto-section-out.cc: ...here. * lto-streamer-in.c: Moved to... * lto-streamer-in.cc: ...here. * lto-streamer-out.c: Moved to... * lto-streamer-out.cc: ...here. * lto-streamer.c: Moved to... * lto-streamer.cc: ...here. * lto-wrapper.c: Moved to... * lto-wrapper.cc: ...here. * main.c: Moved to... * main.cc: ...here. * mcf.c: Moved to... * mcf.cc: ...here. * mode-switching.c: Moved to... * mode-switching.cc: ...here. * modulo-sched.c: Moved to... * modulo-sched.cc: ...here. * multiple_target.c: Moved to... * multiple_target.cc: ...here. * omp-expand.c: Moved to... * omp-expand.cc: ...here. * omp-general.c: Moved to... * omp-general.cc: ...here. * omp-low.c: Moved to... * omp-low.cc: ...here. * omp-offload.c: Moved to... * omp-offload.cc: ...here. * omp-simd-clone.c: Moved to... * omp-simd-clone.cc: ...here. * opt-suggestions.c: Moved to... * opt-suggestions.cc: ...here. * optabs-libfuncs.c: Moved to... * optabs-libfuncs.cc: ...here. * optabs-query.c: Moved to... * optabs-query.cc: ...here. * optabs-tree.c: Moved to... * optabs-tree.cc: ...here. * optabs.c: Moved to... * optabs.cc: ...here. * opts-common.c: Moved to... * opts-common.cc: ...here. * opts-global.c: Moved to... * opts-global.cc: ...here. * opts.c: Moved to... * opts.cc: ...here. * passes.c: Moved to... * passes.cc: ...here. * plugin.c: Moved to... * plugin.cc: ...here. * postreload-gcse.c: Moved to... * postreload-gcse.cc: ...here. * postreload.c: Moved to... * postreload.cc: ...here. * predict.c: Moved to... * predict.cc: ...here. * prefix.c: Moved to... * prefix.cc: ...here. * pretty-print.c: Moved to... * pretty-print.cc: ...here. * print-rtl-function.c: Moved to... * print-rtl-function.cc: ...here. * print-rtl.c: Moved to... * print-rtl.cc: ...here. * print-tree.c: Moved to... * print-tree.cc: ...here. * profile-count.c: Moved to... * profile-count.cc: ...here. * profile.c: Moved to... * profile.cc: ...here. * read-md.c: Moved to... * read-md.cc: ...here. * read-rtl-function.c: Moved to... * read-rtl-function.cc: ...here. * read-rtl.c: Moved to... * read-rtl.cc: ...here. * real.c: Moved to... * real.cc: ...here. * realmpfr.c: Moved to... * realmpfr.cc: ...here. * recog.c: Moved to... * recog.cc: ...here. * ree.c: Moved to... * ree.cc: ...here. * reg-stack.c: Moved to... * reg-stack.cc: ...here. * regcprop.c: Moved to... * regcprop.cc: ...here. * reginfo.c: Moved to... * reginfo.cc: ...here. * regrename.c: Moved to... * regrename.cc: ...here. * regstat.c: Moved to... * regstat.cc: ...here. * reload.c: Moved to... * reload.cc: ...here. * reload1.c: Moved to... * reload1.cc: ...here. * reorg.c: Moved to... * reorg.cc: ...here. * resource.c: Moved to... * resource.cc: ...here. * rtl-error.c: Moved to... * rtl-error.cc: ...here. * rtl-tests.c: Moved to... * rtl-tests.cc: ...here. * rtl.c: Moved to... * rtl.cc: ...here. * rtlanal.c: Moved to... * rtlanal.cc: ...here. * rtlhash.c: Moved to... * rtlhash.cc: ...here. * rtlhooks.c: Moved to... * rtlhooks.cc: ...here. * rtx-vector-builder.c: Moved to... * rtx-vector-builder.cc: ...here. * run-rtl-passes.c: Moved to... * run-rtl-passes.cc: ...here. * sancov.c: Moved to... * sancov.cc: ...here. * sanopt.c: Moved to... * sanopt.cc: ...here. * sbitmap.c: Moved to... * sbitmap.cc: ...here. * sched-deps.c: Moved to... * sched-deps.cc: ...here. * sched-ebb.c: Moved to... * sched-ebb.cc: ...here. * sched-rgn.c: Moved to... * sched-rgn.cc: ...here. * sel-sched-dump.c: Moved to... * sel-sched-dump.cc: ...here. * sel-sched-ir.c: Moved to... * sel-sched-ir.cc: ...here. * sel-sched.c: Moved to... * sel-sched.cc: ...here. * selftest-diagnostic.c: Moved to... * selftest-diagnostic.cc: ...here. * selftest-rtl.c: Moved to... * selftest-rtl.cc: ...here. * selftest-run-tests.c: Moved to... * selftest-run-tests.cc: ...here. * selftest.c: Moved to... * selftest.cc: ...here. * sese.c: Moved to... * sese.cc: ...here. * shrink-wrap.c: Moved to... * shrink-wrap.cc: ...here. * simplify-rtx.c: Moved to... * simplify-rtx.cc: ...here. * sparseset.c: Moved to... * sparseset.cc: ...here. * spellcheck-tree.c: Moved to... * spellcheck-tree.cc: ...here. * spellcheck.c: Moved to... * spellcheck.cc: ...here. * sreal.c: Moved to... * sreal.cc: ...here. * stack-ptr-mod.c: Moved to... * stack-ptr-mod.cc: ...here. * statistics.c: Moved to... * statistics.cc: ...here. * stmt.c: Moved to... * stmt.cc: ...here. * stor-layout.c: Moved to... * stor-layout.cc: ...here. * store-motion.c: Moved to... * store-motion.cc: ...here. * streamer-hooks.c: Moved to... * streamer-hooks.cc: ...here. * stringpool.c: Moved to... * stringpool.cc: ...here. * substring-locations.c: Moved to... * substring-locations.cc: ...here. * symtab.c: Moved to... * symtab.cc: ...here. * target-globals.c: Moved to... * target-globals.cc: ...here. * targhooks.c: Moved to... * targhooks.cc: ...here. * timevar.c: Moved to... * timevar.cc: ...here. * toplev.c: Moved to... * toplev.cc: ...here. * tracer.c: Moved to... * tracer.cc: ...here. * trans-mem.c: Moved to... * trans-mem.cc: ...here. * tree-affine.c: Moved to... * tree-affine.cc: ...here. * tree-call-cdce.c: Moved to... * tree-call-cdce.cc: ...here. * tree-cfg.c: Moved to... * tree-cfg.cc: ...here. * tree-cfgcleanup.c: Moved to... * tree-cfgcleanup.cc: ...here. * tree-chrec.c: Moved to... * tree-chrec.cc: ...here. * tree-complex.c: Moved to... * tree-complex.cc: ...here. * tree-data-ref.c: Moved to... * tree-data-ref.cc: ...here. * tree-dfa.c: Moved to... * tree-dfa.cc: ...here. * tree-diagnostic.c: Moved to... * tree-diagnostic.cc: ...here. * tree-dump.c: Moved to... * tree-dump.cc: ...here. * tree-eh.c: Moved to... * tree-eh.cc: ...here. * tree-emutls.c: Moved to... * tree-emutls.cc: ...here. * tree-if-conv.c: Moved to... * tree-if-conv.cc: ...here. * tree-inline.c: Moved to... * tree-inline.cc: ...here. * tree-into-ssa.c: Moved to... * tree-into-ssa.cc: ...here. * tree-iterator.c: Moved to... * tree-iterator.cc: ...here. * tree-loop-distribution.c: Moved to... * tree-loop-distribution.cc: ...here. * tree-nested.c: Moved to... * tree-nested.cc: ...here. * tree-nrv.c: Moved to... * tree-nrv.cc: ...here. * tree-object-size.c: Moved to... * tree-object-size.cc: ...here. * tree-outof-ssa.c: Moved to... * tree-outof-ssa.cc: ...here. * tree-parloops.c: Moved to... * tree-parloops.cc: ...here. * tree-phinodes.c: Moved to... * tree-phinodes.cc: ...here. * tree-predcom.c: Moved to... * tree-predcom.cc: ...here. * tree-pretty-print.c: Moved to... * tree-pretty-print.cc: ...here. * tree-profile.c: Moved to... * tree-profile.cc: ...here. * tree-scalar-evolution.c: Moved to... * tree-scalar-evolution.cc: ...here. * tree-sra.c: Moved to... * tree-sra.cc: ...here. * tree-ssa-address.c: Moved to... * tree-ssa-address.cc: ...here. * tree-ssa-alias.c: Moved to... * tree-ssa-alias.cc: ...here. * tree-ssa-ccp.c: Moved to... * tree-ssa-ccp.cc: ...here. * tree-ssa-coalesce.c: Moved to... * tree-ssa-coalesce.cc: ...here. * tree-ssa-copy.c: Moved to... * tree-ssa-copy.cc: ...here. * tree-ssa-dce.c: Moved to... * tree-ssa-dce.cc: ...here. * tree-ssa-dom.c: Moved to... * tree-ssa-dom.cc: ...here. * tree-ssa-dse.c: Moved to... * tree-ssa-dse.cc: ...here. * tree-ssa-forwprop.c: Moved to... * tree-ssa-forwprop.cc: ...here. * tree-ssa-ifcombine.c: Moved to... * tree-ssa-ifcombine.cc: ...here. * tree-ssa-live.c: Moved to... * tree-ssa-live.cc: ...here. * tree-ssa-loop-ch.c: Moved to... * tree-ssa-loop-ch.cc: ...here. * tree-ssa-loop-im.c: Moved to... * tree-ssa-loop-im.cc: ...here. * tree-ssa-loop-ivcanon.c: Moved to... * tree-ssa-loop-ivcanon.cc: ...here. * tree-ssa-loop-ivopts.c: Moved to... * tree-ssa-loop-ivopts.cc: ...here. * tree-ssa-loop-manip.c: Moved to... * tree-ssa-loop-manip.cc: ...here. * tree-ssa-loop-niter.c: Moved to... * tree-ssa-loop-niter.cc: ...here. * tree-ssa-loop-prefetch.c: Moved to... * tree-ssa-loop-prefetch.cc: ...here. * tree-ssa-loop-split.c: Moved to... * tree-ssa-loop-split.cc: ...here. * tree-ssa-loop-unswitch.c: Moved to... * tree-ssa-loop-unswitch.cc: ...here. * tree-ssa-loop.c: Moved to... * tree-ssa-loop.cc: ...here. * tree-ssa-math-opts.c: Moved to... * tree-ssa-math-opts.cc: ...here. * tree-ssa-operands.c: Moved to... * tree-ssa-operands.cc: ...here. * tree-ssa-phiopt.c: Moved to... * tree-ssa-phiopt.cc: ...here. * tree-ssa-phiprop.c: Moved to... * tree-ssa-phiprop.cc: ...here. * tree-ssa-pre.c: Moved to... * tree-ssa-pre.cc: ...here. * tree-ssa-propagate.c: Moved to... * tree-ssa-propagate.cc: ...here. * tree-ssa-reassoc.c: Moved to... * tree-ssa-reassoc.cc: ...here. * tree-ssa-sccvn.c: Moved to... * tree-ssa-sccvn.cc: ...here. * tree-ssa-scopedtables.c: Moved to... * tree-ssa-scopedtables.cc: ...here. * tree-ssa-sink.c: Moved to... * tree-ssa-sink.cc: ...here. * tree-ssa-strlen.c: Moved to... * tree-ssa-strlen.cc: ...here. * tree-ssa-structalias.c: Moved to... * tree-ssa-structalias.cc: ...here. * tree-ssa-tail-merge.c: Moved to... * tree-ssa-tail-merge.cc: ...here. * tree-ssa-ter.c: Moved to... * tree-ssa-ter.cc: ...here. * tree-ssa-threadbackward.c: Moved to... * tree-ssa-threadbackward.cc: ...here. * tree-ssa-threadedge.c: Moved to... * tree-ssa-threadedge.cc: ...here. * tree-ssa-threadupdate.c: Moved to... * tree-ssa-threadupdate.cc: ...here. * tree-ssa-uncprop.c: Moved to... * tree-ssa-uncprop.cc: ...here. * tree-ssa-uninit.c: Moved to... * tree-ssa-uninit.cc: ...here. * tree-ssa.c: Moved to... * tree-ssa.cc: ...here. * tree-ssanames.c: Moved to... * tree-ssanames.cc: ...here. * tree-stdarg.c: Moved to... * tree-stdarg.cc: ...here. * tree-streamer-in.c: Moved to... * tree-streamer-in.cc: ...here. * tree-streamer-out.c: Moved to... * tree-streamer-out.cc: ...here. * tree-streamer.c: Moved to... * tree-streamer.cc: ...here. * tree-switch-conversion.c: Moved to... * tree-switch-conversion.cc: ...here. * tree-tailcall.c: Moved to... * tree-tailcall.cc: ...here. * tree-vect-data-refs.c: Moved to... * tree-vect-data-refs.cc: ...here. * tree-vect-generic.c: Moved to... * tree-vect-generic.cc: ...here. * tree-vect-loop-manip.c: Moved to... * tree-vect-loop-manip.cc: ...here. * tree-vect-loop.c: Moved to... * tree-vect-loop.cc: ...here. * tree-vect-patterns.c: Moved to... * tree-vect-patterns.cc: ...here. * tree-vect-slp-patterns.c: Moved to... * tree-vect-slp-patterns.cc: ...here. * tree-vect-slp.c: Moved to... * tree-vect-slp.cc: ...here. * tree-vect-stmts.c: Moved to... * tree-vect-stmts.cc: ...here. * tree-vector-builder.c: Moved to... * tree-vector-builder.cc: ...here. * tree-vectorizer.c: Moved to... * tree-vectorizer.cc: ...here. * tree-vrp.c: Moved to... * tree-vrp.cc: ...here. * tree.c: Moved to... * tree.cc: ...here. * tsan.c: Moved to... * tsan.cc: ...here. * typed-splay-tree.c: Moved to... * typed-splay-tree.cc: ...here. * ubsan.c: Moved to... * ubsan.cc: ...here. * valtrack.c: Moved to... * valtrack.cc: ...here. * value-prof.c: Moved to... * value-prof.cc: ...here. * var-tracking.c: Moved to... * var-tracking.cc: ...here. * varasm.c: Moved to... * varasm.cc: ...here. * varpool.c: Moved to... * varpool.cc: ...here. * vec-perm-indices.c: Moved to... * vec-perm-indices.cc: ...here. * vec.c: Moved to... * vec.cc: ...here. * vmsdbgout.c: Moved to... * vmsdbgout.cc: ...here. * vr-values.c: Moved to... * vr-values.cc: ...here. * vtable-verify.c: Moved to... * vtable-verify.cc: ...here. * web.c: Moved to... * web.cc: ...here. * xcoffout.c: Moved to... * xcoffout.cc: ...here. gcc/c-family/ChangeLog: * c-ada-spec.c: Moved to... * c-ada-spec.cc: ...here. * c-attribs.c: Moved to... * c-attribs.cc: ...here. * c-common.c: Moved to... * c-common.cc: ...here. * c-cppbuiltin.c: Moved to... * c-cppbuiltin.cc: ...here. * c-dump.c: Moved to... * c-dump.cc: ...here. * c-format.c: Moved to... * c-format.cc: ...here. * c-gimplify.c: Moved to... * c-gimplify.cc: ...here. * c-indentation.c: Moved to... * c-indentation.cc: ...here. * c-lex.c: Moved to... * c-lex.cc: ...here. * c-omp.c: Moved to... * c-omp.cc: ...here. * c-opts.c: Moved to... * c-opts.cc: ...here. * c-pch.c: Moved to... * c-pch.cc: ...here. * c-ppoutput.c: Moved to... * c-ppoutput.cc: ...here. * c-pragma.c: Moved to... * c-pragma.cc: ...here. * c-pretty-print.c: Moved to... * c-pretty-print.cc: ...here. * c-semantics.c: Moved to... * c-semantics.cc: ...here. * c-ubsan.c: Moved to... * c-ubsan.cc: ...here. * c-warn.c: Moved to... * c-warn.cc: ...here. * cppspec.c: Moved to... * cppspec.cc: ...here. * stub-objc.c: Moved to... * stub-objc.cc: ...here. gcc/c/ChangeLog: * c-aux-info.c: Moved to... * c-aux-info.cc: ...here. * c-convert.c: Moved to... * c-convert.cc: ...here. * c-decl.c: Moved to... * c-decl.cc: ...here. * c-errors.c: Moved to... * c-errors.cc: ...here. * c-fold.c: Moved to... * c-fold.cc: ...here. * c-lang.c: Moved to... * c-lang.cc: ...here. * c-objc-common.c: Moved to... * c-objc-common.cc: ...here. * c-parser.c: Moved to... * c-parser.cc: ...here. * c-typeck.c: Moved to... * c-typeck.cc: ...here. * gccspec.c: Moved to... * gccspec.cc: ...here. * gimple-parser.c: Moved to... * gimple-parser.cc: ...here. gcc/cp/ChangeLog: * call.c: Moved to... * call.cc: ...here. * class.c: Moved to... * class.cc: ...here. * constexpr.c: Moved to... * constexpr.cc: ...here. * cp-gimplify.c: Moved to... * cp-gimplify.cc: ...here. * cp-lang.c: Moved to... * cp-lang.cc: ...here. * cp-objcp-common.c: Moved to... * cp-objcp-common.cc: ...here. * cp-ubsan.c: Moved to... * cp-ubsan.cc: ...here. * cvt.c: Moved to... * cvt.cc: ...here. * cxx-pretty-print.c: Moved to... * cxx-pretty-print.cc: ...here. * decl.c: Moved to... * decl.cc: ...here. * decl2.c: Moved to... * decl2.cc: ...here. * dump.c: Moved to... * dump.cc: ...here. * error.c: Moved to... * error.cc: ...here. * except.c: Moved to... * except.cc: ...here. * expr.c: Moved to... * expr.cc: ...here. * friend.c: Moved to... * friend.cc: ...here. * g++spec.c: Moved to... * g++spec.cc: ...here. * init.c: Moved to... * init.cc: ...here. * lambda.c: Moved to... * lambda.cc: ...here. * lex.c: Moved to... * lex.cc: ...here. * mangle.c: Moved to... * mangle.cc: ...here. * method.c: Moved to... * method.cc: ...here. * name-lookup.c: Moved to... * name-lookup.cc: ...here. * optimize.c: Moved to... * optimize.cc: ...here. * parser.c: Moved to... * parser.cc: ...here. * pt.c: Moved to... * pt.cc: ...here. * ptree.c: Moved to... * ptree.cc: ...here. * rtti.c: Moved to... * rtti.cc: ...here. * search.c: Moved to... * search.cc: ...here. * semantics.c: Moved to... * semantics.cc: ...here. * tree.c: Moved to... * tree.cc: ...here. * typeck.c: Moved to... * typeck.cc: ...here. * typeck2.c: Moved to... * typeck2.cc: ...here. * vtable-class-hierarchy.c: Moved to... * vtable-class-hierarchy.cc: ...here. gcc/fortran/ChangeLog: * arith.c: Moved to... * arith.cc: ...here. * array.c: Moved to... * array.cc: ...here. * bbt.c: Moved to... * bbt.cc: ...here. * check.c: Moved to... * check.cc: ...here. * class.c: Moved to... * class.cc: ...here. * constructor.c: Moved to... * constructor.cc: ...here. * convert.c: Moved to... * convert.cc: ...here. * cpp.c: Moved to... * cpp.cc: ...here. * data.c: Moved to... * data.cc: ...here. * decl.c: Moved to... * decl.cc: ...here. * dependency.c: Moved to... * dependency.cc: ...here. * dump-parse-tree.c: Moved to... * dump-parse-tree.cc: ...here. * error.c: Moved to... * error.cc: ...here. * expr.c: Moved to... * expr.cc: ...here. * f95-lang.c: Moved to... * f95-lang.cc: ...here. * frontend-passes.c: Moved to... * frontend-passes.cc: ...here. * gfortranspec.c: Moved to... * gfortranspec.cc: ...here. * interface.c: Moved to... * interface.cc: ...here. * intrinsic.c: Moved to... * intrinsic.cc: ...here. * io.c: Moved to... * io.cc: ...here. * iresolve.c: Moved to... * iresolve.cc: ...here. * match.c: Moved to... * match.cc: ...here. * matchexp.c: Moved to... * matchexp.cc: ...here. * misc.c: Moved to... * misc.cc: ...here. * module.c: Moved to... * module.cc: ...here. * openmp.c: Moved to... * openmp.cc: ...here. * options.c: Moved to... * options.cc: ...here. * parse.c: Moved to... * parse.cc: ...here. * primary.c: Moved to... * primary.cc: ...here. * resolve.c: Moved to... * resolve.cc: ...here. * scanner.c: Moved to... * scanner.cc: ...here. * simplify.c: Moved to... * simplify.cc: ...here. * st.c: Moved to... * st.cc: ...here. * symbol.c: Moved to... * symbol.cc: ...here. * target-memory.c: Moved to... * target-memory.cc: ...here. * trans-array.c: Moved to... * trans-array.cc: ...here. * trans-common.c: Moved to... * trans-common.cc: ...here. * trans-const.c: Moved to... * trans-const.cc: ...here. * trans-decl.c: Moved to... * trans-decl.cc: ...here. * trans-expr.c: Moved to... * trans-expr.cc: ...here. * trans-intrinsic.c: Moved to... * trans-intrinsic.cc: ...here. * trans-io.c: Moved to... * trans-io.cc: ...here. * trans-openmp.c: Moved to... * trans-openmp.cc: ...here. * trans-stmt.c: Moved to... * trans-stmt.cc: ...here. * trans-types.c: Moved to... * trans-types.cc: ...here. * trans.c: Moved to... * trans.cc: ...here. gcc/go/ChangeLog: * go-backend.c: Moved to... * go-backend.cc: ...here. * go-lang.c: Moved to... * go-lang.cc: ...here. * gospec.c: Moved to... * gospec.cc: ...here. gcc/jit/ChangeLog: * dummy-frontend.c: Moved to... * dummy-frontend.cc: ...here. * jit-builtins.c: Moved to... * jit-builtins.cc: ...here. * jit-logging.c: Moved to... * jit-logging.cc: ...here. * jit-playback.c: Moved to... * jit-playback.cc: ...here. * jit-recording.c: Moved to... * jit-recording.cc: ...here. * jit-result.c: Moved to... * jit-result.cc: ...here. * jit-spec.c: Moved to... * jit-spec.cc: ...here. * jit-tempdir.c: Moved to... * jit-tempdir.cc: ...here. * jit-w32.c: Moved to... * jit-w32.cc: ...here. * libgccjit.c: Moved to... * libgccjit.cc: ...here. gcc/lto/ChangeLog: * common.c: Moved to... * common.cc: ...here. * lto-common.c: Moved to... * lto-common.cc: ...here. * lto-dump.c: Moved to... * lto-dump.cc: ...here. * lto-lang.c: Moved to... * lto-lang.cc: ...here. * lto-object.c: Moved to... * lto-object.cc: ...here. * lto-partition.c: Moved to... * lto-partition.cc: ...here. * lto-symtab.c: Moved to... * lto-symtab.cc: ...here. * lto.c: Moved to... * lto.cc: ...here. gcc/objc/ChangeLog: * objc-act.c: Moved to... * objc-act.cc: ...here. * objc-encoding.c: Moved to... * objc-encoding.cc: ...here. * objc-gnu-runtime-abi-01.c: Moved to... * objc-gnu-runtime-abi-01.cc: ...here. * objc-lang.c: Moved to... * objc-lang.cc: ...here. * objc-map.c: Moved to... * objc-map.cc: ...here. * objc-next-runtime-abi-01.c: Moved to... * objc-next-runtime-abi-01.cc: ...here. * objc-next-runtime-abi-02.c: Moved to... * objc-next-runtime-abi-02.cc: ...here. * objc-runtime-shared-support.c: Moved to... * objc-runtime-shared-support.cc: ...here. gcc/objcp/ChangeLog: * objcp-decl.c: Moved to... * objcp-decl.cc: ...here. * objcp-lang.c: Moved to... * objcp-lang.cc: ...here. libcpp/ChangeLog: * charset.c: Moved to... * charset.cc: ...here. * directives.c: Moved to... * directives.cc: ...here. * errors.c: Moved to... * errors.cc: ...here. * expr.c: Moved to... * expr.cc: ...here. * files.c: Moved to... * files.cc: ...here. * identifiers.c: Moved to... * identifiers.cc: ...here. * init.c: Moved to... * init.cc: ...here. * lex.c: Moved to... * lex.cc: ...here. * line-map.c: Moved to... * line-map.cc: ...here. * macro.c: Moved to... * macro.cc: ...here. * makeucnid.c: Moved to... * makeucnid.cc: ...here. * mkdeps.c: Moved to... * mkdeps.cc: ...here. * pch.c: Moved to... * pch.cc: ...here. * symtab.c: Moved to... * symtab.cc: ...here. * traditional.c: Moved to... * traditional.cc: ...here.
Diffstat (limited to 'gcc/tree-ssa-pre.c')
-rw-r--r--gcc/tree-ssa-pre.c4481
1 files changed, 0 insertions, 4481 deletions
diff --git a/gcc/tree-ssa-pre.c b/gcc/tree-ssa-pre.c
deleted file mode 100644
index 5113256..0000000
--- a/gcc/tree-ssa-pre.c
+++ /dev/null
@@ -1,4481 +0,0 @@
-/* Full and partial redundancy elimination and code hoisting on SSA GIMPLE.
- Copyright (C) 2001-2022 Free Software Foundation, Inc.
- Contributed by Daniel Berlin <dan@dberlin.org> and Steven Bosscher
- <stevenb@suse.de>
-
-This file is part of GCC.
-
-GCC is free software; you can redistribute it and/or modify
-it under the terms of the GNU General Public License as published by
-the Free Software Foundation; either version 3, or (at your option)
-any later version.
-
-GCC is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-GNU General Public License for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-#include "config.h"
-#include "system.h"
-#include "coretypes.h"
-#include "backend.h"
-#include "rtl.h"
-#include "tree.h"
-#include "gimple.h"
-#include "predict.h"
-#include "alloc-pool.h"
-#include "tree-pass.h"
-#include "ssa.h"
-#include "cgraph.h"
-#include "gimple-pretty-print.h"
-#include "fold-const.h"
-#include "cfganal.h"
-#include "gimple-fold.h"
-#include "tree-eh.h"
-#include "gimplify.h"
-#include "gimple-iterator.h"
-#include "tree-cfg.h"
-#include "tree-into-ssa.h"
-#include "tree-dfa.h"
-#include "tree-ssa.h"
-#include "cfgloop.h"
-#include "tree-ssa-sccvn.h"
-#include "tree-scalar-evolution.h"
-#include "dbgcnt.h"
-#include "domwalk.h"
-#include "tree-ssa-propagate.h"
-#include "tree-ssa-dce.h"
-#include "tree-cfgcleanup.h"
-#include "alias.h"
-#include "gimple-range.h"
-
-/* Even though this file is called tree-ssa-pre.c, we actually
- implement a bit more than just PRE here. All of them piggy-back
- on GVN which is implemented in tree-ssa-sccvn.c.
-
- 1. Full Redundancy Elimination (FRE)
- This is the elimination phase of GVN.
-
- 2. Partial Redundancy Elimination (PRE)
- This is adds computation of AVAIL_OUT and ANTIC_IN and
- doing expression insertion to form GVN-PRE.
-
- 3. Code hoisting
- This optimization uses the ANTIC_IN sets computed for PRE
- to move expressions further up than PRE would do, to make
- multiple computations of the same value fully redundant.
- This pass is explained below (after the explanation of the
- basic algorithm for PRE).
-*/
-
-/* TODO:
-
- 1. Avail sets can be shared by making an avail_find_leader that
- walks up the dominator tree and looks in those avail sets.
- This might affect code optimality, it's unclear right now.
- Currently the AVAIL_OUT sets are the remaining quadraticness in
- memory of GVN-PRE.
- 2. Strength reduction can be performed by anticipating expressions
- we can repair later on.
- 3. We can do back-substitution or smarter value numbering to catch
- commutative expressions split up over multiple statements.
-*/
-
-/* For ease of terminology, "expression node" in the below refers to
- every expression node but GIMPLE_ASSIGN, because GIMPLE_ASSIGNs
- represent the actual statement containing the expressions we care about,
- and we cache the value number by putting it in the expression. */
-
-/* Basic algorithm for Partial Redundancy Elimination:
-
- First we walk the statements to generate the AVAIL sets, the
- EXP_GEN sets, and the tmp_gen sets. EXP_GEN sets represent the
- generation of values/expressions by a given block. We use them
- when computing the ANTIC sets. The AVAIL sets consist of
- SSA_NAME's that represent values, so we know what values are
- available in what blocks. AVAIL is a forward dataflow problem. In
- SSA, values are never killed, so we don't need a kill set, or a
- fixpoint iteration, in order to calculate the AVAIL sets. In
- traditional parlance, AVAIL sets tell us the downsafety of the
- expressions/values.
-
- Next, we generate the ANTIC sets. These sets represent the
- anticipatable expressions. ANTIC is a backwards dataflow
- problem. An expression is anticipatable in a given block if it could
- be generated in that block. This means that if we had to perform
- an insertion in that block, of the value of that expression, we
- could. Calculating the ANTIC sets requires phi translation of
- expressions, because the flow goes backwards through phis. We must
- iterate to a fixpoint of the ANTIC sets, because we have a kill
- set. Even in SSA form, values are not live over the entire
- function, only from their definition point onwards. So we have to
- remove values from the ANTIC set once we go past the definition
- point of the leaders that make them up.
- compute_antic/compute_antic_aux performs this computation.
-
- Third, we perform insertions to make partially redundant
- expressions fully redundant.
-
- An expression is partially redundant (excluding partial
- anticipation) if:
-
- 1. It is AVAIL in some, but not all, of the predecessors of a
- given block.
- 2. It is ANTIC in all the predecessors.
-
- In order to make it fully redundant, we insert the expression into
- the predecessors where it is not available, but is ANTIC.
-
- When optimizing for size, we only eliminate the partial redundancy
- if we need to insert in only one predecessor. This avoids almost
- completely the code size increase that PRE usually causes.
-
- For the partial anticipation case, we only perform insertion if it
- is partially anticipated in some block, and fully available in all
- of the predecessors.
-
- do_pre_regular_insertion/do_pre_partial_partial_insertion
- performs these steps, driven by insert/insert_aux.
-
- Fourth, we eliminate fully redundant expressions.
- This is a simple statement walk that replaces redundant
- calculations with the now available values. */
-
-/* Basic algorithm for Code Hoisting:
-
- Code hoisting is: Moving value computations up in the control flow
- graph to make multiple copies redundant. Typically this is a size
- optimization, but there are cases where it also is helpful for speed.
-
- A simple code hoisting algorithm is implemented that piggy-backs on
- the PRE infrastructure. For code hoisting, we have to know ANTIC_OUT
- which is effectively ANTIC_IN - AVAIL_OUT. The latter two have to be
- computed for PRE, and we can use them to perform a limited version of
- code hoisting, too.
-
- For the purpose of this implementation, a value is hoistable to a basic
- block B if the following properties are met:
-
- 1. The value is in ANTIC_IN(B) -- the value will be computed on all
- paths from B to function exit and it can be computed in B);
-
- 2. The value is not in AVAIL_OUT(B) -- there would be no need to
- compute the value again and make it available twice;
-
- 3. All successors of B are dominated by B -- makes sure that inserting
- a computation of the value in B will make the remaining
- computations fully redundant;
-
- 4. At least one successor has the value in AVAIL_OUT -- to avoid
- hoisting values up too far;
-
- 5. There are at least two successors of B -- hoisting in straight
- line code is pointless.
-
- The third condition is not strictly necessary, but it would complicate
- the hoisting pass a lot. In fact, I don't know of any code hoisting
- algorithm that does not have this requirement. Fortunately, experiments
- have show that most candidate hoistable values are in regions that meet
- this condition (e.g. diamond-shape regions).
-
- The forth condition is necessary to avoid hoisting things up too far
- away from the uses of the value. Nothing else limits the algorithm
- from hoisting everything up as far as ANTIC_IN allows. Experiments
- with SPEC and CSiBE have shown that hoisting up too far results in more
- spilling, less benefits for code size, and worse benchmark scores.
- Fortunately, in practice most of the interesting hoisting opportunities
- are caught despite this limitation.
-
- For hoistable values that meet all conditions, expressions are inserted
- to make the calculation of the hoistable value fully redundant. We
- perform code hoisting insertions after each round of PRE insertions,
- because code hoisting never exposes new PRE opportunities, but PRE can
- create new code hoisting opportunities.
-
- The code hoisting algorithm is implemented in do_hoist_insert, driven
- by insert/insert_aux. */
-
-/* Representations of value numbers:
-
- Value numbers are represented by a representative SSA_NAME. We
- will create fake SSA_NAME's in situations where we need a
- representative but do not have one (because it is a complex
- expression). In order to facilitate storing the value numbers in
- bitmaps, and keep the number of wasted SSA_NAME's down, we also
- associate a value_id with each value number, and create full blown
- ssa_name's only where we actually need them (IE in operands of
- existing expressions).
-
- Theoretically you could replace all the value_id's with
- SSA_NAME_VERSION, but this would allocate a large number of
- SSA_NAME's (which are each > 30 bytes) just to get a 4 byte number.
- It would also require an additional indirection at each point we
- use the value id. */
-
-/* Representation of expressions on value numbers:
-
- Expressions consisting of value numbers are represented the same
- way as our VN internally represents them, with an additional
- "pre_expr" wrapping around them in order to facilitate storing all
- of the expressions in the same sets. */
-
-/* Representation of sets:
-
- The dataflow sets do not need to be sorted in any particular order
- for the majority of their lifetime, are simply represented as two
- bitmaps, one that keeps track of values present in the set, and one
- that keeps track of expressions present in the set.
-
- When we need them in topological order, we produce it on demand by
- transforming the bitmap into an array and sorting it into topo
- order. */
-
-/* Type of expression, used to know which member of the PRE_EXPR union
- is valid. */
-
-enum pre_expr_kind
-{
- NAME,
- NARY,
- REFERENCE,
- CONSTANT
-};
-
-union pre_expr_union
-{
- tree name;
- tree constant;
- vn_nary_op_t nary;
- vn_reference_t reference;
-};
-
-typedef struct pre_expr_d : nofree_ptr_hash <pre_expr_d>
-{
- enum pre_expr_kind kind;
- unsigned int id;
- unsigned value_id;
- location_t loc;
- pre_expr_union u;
-
- /* hash_table support. */
- static inline hashval_t hash (const pre_expr_d *);
- static inline int equal (const pre_expr_d *, const pre_expr_d *);
-} *pre_expr;
-
-#define PRE_EXPR_NAME(e) (e)->u.name
-#define PRE_EXPR_NARY(e) (e)->u.nary
-#define PRE_EXPR_REFERENCE(e) (e)->u.reference
-#define PRE_EXPR_CONSTANT(e) (e)->u.constant
-
-/* Compare E1 and E1 for equality. */
-
-inline int
-pre_expr_d::equal (const pre_expr_d *e1, const pre_expr_d *e2)
-{
- if (e1->kind != e2->kind)
- return false;
-
- switch (e1->kind)
- {
- case CONSTANT:
- return vn_constant_eq_with_type (PRE_EXPR_CONSTANT (e1),
- PRE_EXPR_CONSTANT (e2));
- case NAME:
- return PRE_EXPR_NAME (e1) == PRE_EXPR_NAME (e2);
- case NARY:
- return vn_nary_op_eq (PRE_EXPR_NARY (e1), PRE_EXPR_NARY (e2));
- case REFERENCE:
- return vn_reference_eq (PRE_EXPR_REFERENCE (e1),
- PRE_EXPR_REFERENCE (e2));
- default:
- gcc_unreachable ();
- }
-}
-
-/* Hash E. */
-
-inline hashval_t
-pre_expr_d::hash (const pre_expr_d *e)
-{
- switch (e->kind)
- {
- case CONSTANT:
- return vn_hash_constant_with_type (PRE_EXPR_CONSTANT (e));
- case NAME:
- return SSA_NAME_VERSION (PRE_EXPR_NAME (e));
- case NARY:
- return PRE_EXPR_NARY (e)->hashcode;
- case REFERENCE:
- return PRE_EXPR_REFERENCE (e)->hashcode;
- default:
- gcc_unreachable ();
- }
-}
-
-/* Next global expression id number. */
-static unsigned int next_expression_id;
-
-/* Mapping from expression to id number we can use in bitmap sets. */
-static vec<pre_expr> expressions;
-static hash_table<pre_expr_d> *expression_to_id;
-static vec<unsigned> name_to_id;
-
-/* Allocate an expression id for EXPR. */
-
-static inline unsigned int
-alloc_expression_id (pre_expr expr)
-{
- struct pre_expr_d **slot;
- /* Make sure we won't overflow. */
- gcc_assert (next_expression_id + 1 > next_expression_id);
- expr->id = next_expression_id++;
- expressions.safe_push (expr);
- if (expr->kind == NAME)
- {
- unsigned version = SSA_NAME_VERSION (PRE_EXPR_NAME (expr));
- /* vec::safe_grow_cleared allocates no headroom. Avoid frequent
- re-allocations by using vec::reserve upfront. */
- unsigned old_len = name_to_id.length ();
- name_to_id.reserve (num_ssa_names - old_len);
- name_to_id.quick_grow_cleared (num_ssa_names);
- gcc_assert (name_to_id[version] == 0);
- name_to_id[version] = expr->id;
- }
- else
- {
- slot = expression_to_id->find_slot (expr, INSERT);
- gcc_assert (!*slot);
- *slot = expr;
- }
- return next_expression_id - 1;
-}
-
-/* Return the expression id for tree EXPR. */
-
-static inline unsigned int
-get_expression_id (const pre_expr expr)
-{
- return expr->id;
-}
-
-static inline unsigned int
-lookup_expression_id (const pre_expr expr)
-{
- struct pre_expr_d **slot;
-
- if (expr->kind == NAME)
- {
- unsigned version = SSA_NAME_VERSION (PRE_EXPR_NAME (expr));
- if (name_to_id.length () <= version)
- return 0;
- return name_to_id[version];
- }
- else
- {
- slot = expression_to_id->find_slot (expr, NO_INSERT);
- if (!slot)
- return 0;
- return ((pre_expr)*slot)->id;
- }
-}
-
-/* Return the existing expression id for EXPR, or create one if one
- does not exist yet. */
-
-static inline unsigned int
-get_or_alloc_expression_id (pre_expr expr)
-{
- unsigned int id = lookup_expression_id (expr);
- if (id == 0)
- return alloc_expression_id (expr);
- return expr->id = id;
-}
-
-/* Return the expression that has expression id ID */
-
-static inline pre_expr
-expression_for_id (unsigned int id)
-{
- return expressions[id];
-}
-
-static object_allocator<pre_expr_d> pre_expr_pool ("pre_expr nodes");
-
-/* Given an SSA_NAME NAME, get or create a pre_expr to represent it. */
-
-static pre_expr
-get_or_alloc_expr_for_name (tree name)
-{
- struct pre_expr_d expr;
- pre_expr result;
- unsigned int result_id;
-
- expr.kind = NAME;
- expr.id = 0;
- PRE_EXPR_NAME (&expr) = name;
- result_id = lookup_expression_id (&expr);
- if (result_id != 0)
- return expression_for_id (result_id);
-
- result = pre_expr_pool.allocate ();
- result->kind = NAME;
- result->loc = UNKNOWN_LOCATION;
- result->value_id = VN_INFO (name)->value_id;
- PRE_EXPR_NAME (result) = name;
- alloc_expression_id (result);
- return result;
-}
-
-/* Given an NARY, get or create a pre_expr to represent it. */
-
-static pre_expr
-get_or_alloc_expr_for_nary (vn_nary_op_t nary,
- location_t loc = UNKNOWN_LOCATION)
-{
- struct pre_expr_d expr;
- pre_expr result;
- unsigned int result_id;
-
- expr.kind = NARY;
- expr.id = 0;
- PRE_EXPR_NARY (&expr) = nary;
- result_id = lookup_expression_id (&expr);
- if (result_id != 0)
- return expression_for_id (result_id);
-
- result = pre_expr_pool.allocate ();
- result->kind = NARY;
- result->loc = loc;
- result->value_id = nary->value_id;
- PRE_EXPR_NARY (result) = nary;
- alloc_expression_id (result);
- return result;
-}
-
-/* Given an REFERENCE, get or create a pre_expr to represent it. */
-
-static pre_expr
-get_or_alloc_expr_for_reference (vn_reference_t reference,
- location_t loc = UNKNOWN_LOCATION)
-{
- struct pre_expr_d expr;
- pre_expr result;
- unsigned int result_id;
-
- expr.kind = REFERENCE;
- expr.id = 0;
- PRE_EXPR_REFERENCE (&expr) = reference;
- result_id = lookup_expression_id (&expr);
- if (result_id != 0)
- return expression_for_id (result_id);
-
- result = pre_expr_pool.allocate ();
- result->kind = REFERENCE;
- result->loc = loc;
- result->value_id = reference->value_id;
- PRE_EXPR_REFERENCE (result) = reference;
- alloc_expression_id (result);
- return result;
-}
-
-
-/* An unordered bitmap set. One bitmap tracks values, the other,
- expressions. */
-typedef class bitmap_set
-{
-public:
- bitmap_head expressions;
- bitmap_head values;
-} *bitmap_set_t;
-
-#define FOR_EACH_EXPR_ID_IN_SET(set, id, bi) \
- EXECUTE_IF_SET_IN_BITMAP (&(set)->expressions, 0, (id), (bi))
-
-#define FOR_EACH_VALUE_ID_IN_SET(set, id, bi) \
- EXECUTE_IF_SET_IN_BITMAP (&(set)->values, 0, (id), (bi))
-
-/* Mapping from value id to expressions with that value_id. */
-static vec<bitmap> value_expressions;
-/* We just record a single expression for each constant value,
- one of kind CONSTANT. */
-static vec<pre_expr> constant_value_expressions;
-
-
-/* This structure is used to keep track of statistics on what
- optimization PRE was able to perform. */
-static struct
-{
- /* The number of new expressions/temporaries generated by PRE. */
- int insertions;
-
- /* The number of inserts found due to partial anticipation */
- int pa_insert;
-
- /* The number of inserts made for code hoisting. */
- int hoist_insert;
-
- /* The number of new PHI nodes added by PRE. */
- int phis;
-} pre_stats;
-
-static bool do_partial_partial;
-static pre_expr bitmap_find_leader (bitmap_set_t, unsigned int);
-static void bitmap_value_insert_into_set (bitmap_set_t, pre_expr);
-static bool bitmap_value_replace_in_set (bitmap_set_t, pre_expr);
-static void bitmap_set_copy (bitmap_set_t, bitmap_set_t);
-static bool bitmap_set_contains_value (bitmap_set_t, unsigned int);
-static void bitmap_insert_into_set (bitmap_set_t, pre_expr);
-static bitmap_set_t bitmap_set_new (void);
-static tree create_expression_by_pieces (basic_block, pre_expr, gimple_seq *,
- tree);
-static tree find_or_generate_expression (basic_block, tree, gimple_seq *);
-static unsigned int get_expr_value_id (pre_expr);
-
-/* We can add and remove elements and entries to and from sets
- and hash tables, so we use alloc pools for them. */
-
-static object_allocator<bitmap_set> bitmap_set_pool ("Bitmap sets");
-static bitmap_obstack grand_bitmap_obstack;
-
-/* A three tuple {e, pred, v} used to cache phi translations in the
- phi_translate_table. */
-
-typedef struct expr_pred_trans_d : public typed_noop_remove <expr_pred_trans_d>
-{
- typedef expr_pred_trans_d value_type;
- typedef expr_pred_trans_d compare_type;
-
- /* The expression ID. */
- unsigned e;
-
- /* The value expression ID that resulted from the translation. */
- unsigned v;
-
- /* hash_table support. */
- static inline void mark_empty (expr_pred_trans_d &);
- static inline bool is_empty (const expr_pred_trans_d &);
- static inline void mark_deleted (expr_pred_trans_d &);
- static inline bool is_deleted (const expr_pred_trans_d &);
- static const bool empty_zero_p = true;
- static inline hashval_t hash (const expr_pred_trans_d &);
- static inline int equal (const expr_pred_trans_d &, const expr_pred_trans_d &);
-} *expr_pred_trans_t;
-typedef const struct expr_pred_trans_d *const_expr_pred_trans_t;
-
-inline bool
-expr_pred_trans_d::is_empty (const expr_pred_trans_d &e)
-{
- return e.e == 0;
-}
-
-inline bool
-expr_pred_trans_d::is_deleted (const expr_pred_trans_d &e)
-{
- return e.e == -1u;
-}
-
-inline void
-expr_pred_trans_d::mark_empty (expr_pred_trans_d &e)
-{
- e.e = 0;
-}
-
-inline void
-expr_pred_trans_d::mark_deleted (expr_pred_trans_d &e)
-{
- e.e = -1u;
-}
-
-inline hashval_t
-expr_pred_trans_d::hash (const expr_pred_trans_d &e)
-{
- return e.e;
-}
-
-inline int
-expr_pred_trans_d::equal (const expr_pred_trans_d &ve1,
- const expr_pred_trans_d &ve2)
-{
- return ve1.e == ve2.e;
-}
-
-/* Sets that we need to keep track of. */
-typedef struct bb_bitmap_sets
-{
- /* The EXP_GEN set, which represents expressions/values generated in
- a basic block. */
- bitmap_set_t exp_gen;
-
- /* The PHI_GEN set, which represents PHI results generated in a
- basic block. */
- bitmap_set_t phi_gen;
-
- /* The TMP_GEN set, which represents results/temporaries generated
- in a basic block. IE the LHS of an expression. */
- bitmap_set_t tmp_gen;
-
- /* The AVAIL_OUT set, which represents which values are available in
- a given basic block. */
- bitmap_set_t avail_out;
-
- /* The ANTIC_IN set, which represents which values are anticipatable
- in a given basic block. */
- bitmap_set_t antic_in;
-
- /* The PA_IN set, which represents which values are
- partially anticipatable in a given basic block. */
- bitmap_set_t pa_in;
-
- /* The NEW_SETS set, which is used during insertion to augment the
- AVAIL_OUT set of blocks with the new insertions performed during
- the current iteration. */
- bitmap_set_t new_sets;
-
- /* A cache for value_dies_in_block_x. */
- bitmap expr_dies;
-
- /* The live virtual operand on successor edges. */
- tree vop_on_exit;
-
- /* PHI translate cache for the single successor edge. */
- hash_table<expr_pred_trans_d> *phi_translate_table;
-
- /* True if we have visited this block during ANTIC calculation. */
- unsigned int visited : 1;
-
- /* True when the block contains a call that might not return. */
- unsigned int contains_may_not_return_call : 1;
-} *bb_value_sets_t;
-
-#define EXP_GEN(BB) ((bb_value_sets_t) ((BB)->aux))->exp_gen
-#define PHI_GEN(BB) ((bb_value_sets_t) ((BB)->aux))->phi_gen
-#define TMP_GEN(BB) ((bb_value_sets_t) ((BB)->aux))->tmp_gen
-#define AVAIL_OUT(BB) ((bb_value_sets_t) ((BB)->aux))->avail_out
-#define ANTIC_IN(BB) ((bb_value_sets_t) ((BB)->aux))->antic_in
-#define PA_IN(BB) ((bb_value_sets_t) ((BB)->aux))->pa_in
-#define NEW_SETS(BB) ((bb_value_sets_t) ((BB)->aux))->new_sets
-#define EXPR_DIES(BB) ((bb_value_sets_t) ((BB)->aux))->expr_dies
-#define PHI_TRANS_TABLE(BB) ((bb_value_sets_t) ((BB)->aux))->phi_translate_table
-#define BB_VISITED(BB) ((bb_value_sets_t) ((BB)->aux))->visited
-#define BB_MAY_NOTRETURN(BB) ((bb_value_sets_t) ((BB)->aux))->contains_may_not_return_call
-#define BB_LIVE_VOP_ON_EXIT(BB) ((bb_value_sets_t) ((BB)->aux))->vop_on_exit
-
-
-/* Add the tuple mapping from {expression E, basic block PRED} to
- the phi translation table and return whether it pre-existed. */
-
-static inline bool
-phi_trans_add (expr_pred_trans_t *entry, pre_expr e, basic_block pred)
-{
- if (!PHI_TRANS_TABLE (pred))
- PHI_TRANS_TABLE (pred) = new hash_table<expr_pred_trans_d> (11);
-
- expr_pred_trans_t slot;
- expr_pred_trans_d tem;
- unsigned id = get_expression_id (e);
- tem.e = id;
- slot = PHI_TRANS_TABLE (pred)->find_slot_with_hash (tem, id, INSERT);
- if (slot->e)
- {
- *entry = slot;
- return true;
- }
-
- *entry = slot;
- slot->e = id;
- return false;
-}
-
-
-/* Add expression E to the expression set of value id V. */
-
-static void
-add_to_value (unsigned int v, pre_expr e)
-{
- gcc_checking_assert (get_expr_value_id (e) == v);
-
- if (value_id_constant_p (v))
- {
- if (e->kind != CONSTANT)
- return;
-
- if (-v >= constant_value_expressions.length ())
- constant_value_expressions.safe_grow_cleared (-v + 1);
-
- pre_expr leader = constant_value_expressions[-v];
- if (!leader)
- constant_value_expressions[-v] = e;
- }
- else
- {
- if (v >= value_expressions.length ())
- value_expressions.safe_grow_cleared (v + 1);
-
- bitmap set = value_expressions[v];
- if (!set)
- {
- set = BITMAP_ALLOC (&grand_bitmap_obstack);
- value_expressions[v] = set;
- }
- bitmap_set_bit (set, get_or_alloc_expression_id (e));
- }
-}
-
-/* Create a new bitmap set and return it. */
-
-static bitmap_set_t
-bitmap_set_new (void)
-{
- bitmap_set_t ret = bitmap_set_pool.allocate ();
- bitmap_initialize (&ret->expressions, &grand_bitmap_obstack);
- bitmap_initialize (&ret->values, &grand_bitmap_obstack);
- return ret;
-}
-
-/* Return the value id for a PRE expression EXPR. */
-
-static unsigned int
-get_expr_value_id (pre_expr expr)
-{
- /* ??? We cannot assert that expr has a value-id (it can be 0), because
- we assign value-ids only to expressions that have a result
- in set_hashtable_value_ids. */
- return expr->value_id;
-}
-
-/* Return a VN valnum (SSA name or constant) for the PRE value-id VAL. */
-
-static tree
-vn_valnum_from_value_id (unsigned int val)
-{
- if (value_id_constant_p (val))
- {
- pre_expr vexpr = constant_value_expressions[-val];
- if (vexpr)
- return PRE_EXPR_CONSTANT (vexpr);
- return NULL_TREE;
- }
-
- bitmap exprset = value_expressions[val];
- bitmap_iterator bi;
- unsigned int i;
- EXECUTE_IF_SET_IN_BITMAP (exprset, 0, i, bi)
- {
- pre_expr vexpr = expression_for_id (i);
- if (vexpr->kind == NAME)
- return VN_INFO (PRE_EXPR_NAME (vexpr))->valnum;
- }
- return NULL_TREE;
-}
-
-/* Insert an expression EXPR into a bitmapped set. */
-
-static void
-bitmap_insert_into_set (bitmap_set_t set, pre_expr expr)
-{
- unsigned int val = get_expr_value_id (expr);
- if (! value_id_constant_p (val))
- {
- /* Note this is the only function causing multiple expressions
- for the same value to appear in a set. This is needed for
- TMP_GEN, PHI_GEN and NEW_SETs. */
- bitmap_set_bit (&set->values, val);
- bitmap_set_bit (&set->expressions, get_or_alloc_expression_id (expr));
- }
-}
-
-/* Copy a bitmapped set ORIG, into bitmapped set DEST. */
-
-static void
-bitmap_set_copy (bitmap_set_t dest, bitmap_set_t orig)
-{
- bitmap_copy (&dest->expressions, &orig->expressions);
- bitmap_copy (&dest->values, &orig->values);
-}
-
-
-/* Free memory used up by SET. */
-static void
-bitmap_set_free (bitmap_set_t set)
-{
- bitmap_clear (&set->expressions);
- bitmap_clear (&set->values);
-}
-
-static void
-pre_expr_DFS (pre_expr expr, bitmap_set_t set, bitmap val_visited,
- vec<pre_expr> &post);
-
-/* DFS walk leaders of VAL to their operands with leaders in SET, collecting
- expressions in SET in postorder into POST. */
-
-static void
-pre_expr_DFS (unsigned val, bitmap_set_t set, bitmap val_visited,
- vec<pre_expr> &post)
-{
- unsigned int i;
- bitmap_iterator bi;
-
- /* Iterate over all leaders and DFS recurse. Borrowed from
- bitmap_find_leader. */
- bitmap exprset = value_expressions[val];
- if (!exprset->first->next)
- {
- EXECUTE_IF_SET_IN_BITMAP (exprset, 0, i, bi)
- if (bitmap_bit_p (&set->expressions, i))
- pre_expr_DFS (expression_for_id (i), set, val_visited, post);
- return;
- }
-
- EXECUTE_IF_AND_IN_BITMAP (exprset, &set->expressions, 0, i, bi)
- pre_expr_DFS (expression_for_id (i), set, val_visited, post);
-}
-
-/* DFS walk EXPR to its operands with leaders in SET, collecting
- expressions in SET in postorder into POST. */
-
-static void
-pre_expr_DFS (pre_expr expr, bitmap_set_t set, bitmap val_visited,
- vec<pre_expr> &post)
-{
- switch (expr->kind)
- {
- case NARY:
- {
- vn_nary_op_t nary = PRE_EXPR_NARY (expr);
- for (unsigned i = 0; i < nary->length; i++)
- {
- if (TREE_CODE (nary->op[i]) != SSA_NAME)
- continue;
- unsigned int op_val_id = VN_INFO (nary->op[i])->value_id;
- /* If we already found a leader for the value we've
- recursed already. Avoid the costly bitmap_find_leader. */
- if (bitmap_bit_p (&set->values, op_val_id)
- && bitmap_set_bit (val_visited, op_val_id))
- pre_expr_DFS (op_val_id, set, val_visited, post);
- }
- break;
- }
- case REFERENCE:
- {
- vn_reference_t ref = PRE_EXPR_REFERENCE (expr);
- vec<vn_reference_op_s> operands = ref->operands;
- vn_reference_op_t operand;
- for (unsigned i = 0; operands.iterate (i, &operand); i++)
- {
- tree op[3];
- op[0] = operand->op0;
- op[1] = operand->op1;
- op[2] = operand->op2;
- for (unsigned n = 0; n < 3; ++n)
- {
- if (!op[n] || TREE_CODE (op[n]) != SSA_NAME)
- continue;
- unsigned op_val_id = VN_INFO (op[n])->value_id;
- if (bitmap_bit_p (&set->values, op_val_id)
- && bitmap_set_bit (val_visited, op_val_id))
- pre_expr_DFS (op_val_id, set, val_visited, post);
- }
- }
- break;
- }
- default:;
- }
- post.quick_push (expr);
-}
-
-/* Generate an topological-ordered array of bitmap set SET. */
-
-static vec<pre_expr>
-sorted_array_from_bitmap_set (bitmap_set_t set)
-{
- unsigned int i;
- bitmap_iterator bi;
- vec<pre_expr> result;
-
- /* Pre-allocate enough space for the array. */
- result.create (bitmap_count_bits (&set->expressions));
-
- auto_bitmap val_visited (&grand_bitmap_obstack);
- bitmap_tree_view (val_visited);
- FOR_EACH_VALUE_ID_IN_SET (set, i, bi)
- if (bitmap_set_bit (val_visited, i))
- pre_expr_DFS (i, set, val_visited, result);
-
- return result;
-}
-
-/* Subtract all expressions contained in ORIG from DEST. */
-
-static bitmap_set_t
-bitmap_set_subtract_expressions (bitmap_set_t dest, bitmap_set_t orig)
-{
- bitmap_set_t result = bitmap_set_new ();
- bitmap_iterator bi;
- unsigned int i;
-
- bitmap_and_compl (&result->expressions, &dest->expressions,
- &orig->expressions);
-
- FOR_EACH_EXPR_ID_IN_SET (result, i, bi)
- {
- pre_expr expr = expression_for_id (i);
- unsigned int value_id = get_expr_value_id (expr);
- bitmap_set_bit (&result->values, value_id);
- }
-
- return result;
-}
-
-/* Subtract all values in bitmap set B from bitmap set A. */
-
-static void
-bitmap_set_subtract_values (bitmap_set_t a, bitmap_set_t b)
-{
- unsigned int i;
- bitmap_iterator bi;
- unsigned to_remove = -1U;
- bitmap_and_compl_into (&a->values, &b->values);
- FOR_EACH_EXPR_ID_IN_SET (a, i, bi)
- {
- if (to_remove != -1U)
- {
- bitmap_clear_bit (&a->expressions, to_remove);
- to_remove = -1U;
- }
- pre_expr expr = expression_for_id (i);
- if (! bitmap_bit_p (&a->values, get_expr_value_id (expr)))
- to_remove = i;
- }
- if (to_remove != -1U)
- bitmap_clear_bit (&a->expressions, to_remove);
-}
-
-
-/* Return true if bitmapped set SET contains the value VALUE_ID. */
-
-static bool
-bitmap_set_contains_value (bitmap_set_t set, unsigned int value_id)
-{
- if (value_id_constant_p (value_id))
- return true;
-
- return bitmap_bit_p (&set->values, value_id);
-}
-
-/* Return true if two bitmap sets are equal. */
-
-static bool
-bitmap_set_equal (bitmap_set_t a, bitmap_set_t b)
-{
- return bitmap_equal_p (&a->values, &b->values);
-}
-
-/* Replace an instance of EXPR's VALUE with EXPR in SET if it exists,
- and add it otherwise. Return true if any changes were made. */
-
-static bool
-bitmap_value_replace_in_set (bitmap_set_t set, pre_expr expr)
-{
- unsigned int val = get_expr_value_id (expr);
- if (value_id_constant_p (val))
- return false;
-
- if (bitmap_set_contains_value (set, val))
- {
- /* The number of expressions having a given value is usually
- significantly less than the total number of expressions in SET.
- Thus, rather than check, for each expression in SET, whether it
- has the value LOOKFOR, we walk the reverse mapping that tells us
- what expressions have a given value, and see if any of those
- expressions are in our set. For large testcases, this is about
- 5-10x faster than walking the bitmap. If this is somehow a
- significant lose for some cases, we can choose which set to walk
- based on the set size. */
- unsigned int i;
- bitmap_iterator bi;
- bitmap exprset = value_expressions[val];
- EXECUTE_IF_SET_IN_BITMAP (exprset, 0, i, bi)
- {
- if (bitmap_clear_bit (&set->expressions, i))
- {
- bitmap_set_bit (&set->expressions, get_expression_id (expr));
- return i != get_expression_id (expr);
- }
- }
- gcc_unreachable ();
- }
-
- bitmap_insert_into_set (set, expr);
- return true;
-}
-
-/* Insert EXPR into SET if EXPR's value is not already present in
- SET. */
-
-static void
-bitmap_value_insert_into_set (bitmap_set_t set, pre_expr expr)
-{
- unsigned int val = get_expr_value_id (expr);
-
- gcc_checking_assert (expr->id == get_or_alloc_expression_id (expr));
-
- /* Constant values are always considered to be part of the set. */
- if (value_id_constant_p (val))
- return;
-
- /* If the value membership changed, add the expression. */
- if (bitmap_set_bit (&set->values, val))
- bitmap_set_bit (&set->expressions, expr->id);
-}
-
-/* Print out EXPR to outfile. */
-
-static void
-print_pre_expr (FILE *outfile, const pre_expr expr)
-{
- if (! expr)
- {
- fprintf (outfile, "NULL");
- return;
- }
- switch (expr->kind)
- {
- case CONSTANT:
- print_generic_expr (outfile, PRE_EXPR_CONSTANT (expr));
- break;
- case NAME:
- print_generic_expr (outfile, PRE_EXPR_NAME (expr));
- break;
- case NARY:
- {
- unsigned int i;
- vn_nary_op_t nary = PRE_EXPR_NARY (expr);
- fprintf (outfile, "{%s,", get_tree_code_name (nary->opcode));
- for (i = 0; i < nary->length; i++)
- {
- print_generic_expr (outfile, nary->op[i]);
- if (i != (unsigned) nary->length - 1)
- fprintf (outfile, ",");
- }
- fprintf (outfile, "}");
- }
- break;
-
- case REFERENCE:
- {
- vn_reference_t ref = PRE_EXPR_REFERENCE (expr);
- print_vn_reference_ops (outfile, ref->operands);
- if (ref->vuse)
- {
- fprintf (outfile, "@");
- print_generic_expr (outfile, ref->vuse);
- }
- }
- break;
- }
-}
-void debug_pre_expr (pre_expr);
-
-/* Like print_pre_expr but always prints to stderr. */
-DEBUG_FUNCTION void
-debug_pre_expr (pre_expr e)
-{
- print_pre_expr (stderr, e);
- fprintf (stderr, "\n");
-}
-
-/* Print out SET to OUTFILE. */
-
-static void
-print_bitmap_set (FILE *outfile, bitmap_set_t set,
- const char *setname, int blockindex)
-{
- fprintf (outfile, "%s[%d] := { ", setname, blockindex);
- if (set)
- {
- bool first = true;
- unsigned i;
- bitmap_iterator bi;
-
- FOR_EACH_EXPR_ID_IN_SET (set, i, bi)
- {
- const pre_expr expr = expression_for_id (i);
-
- if (!first)
- fprintf (outfile, ", ");
- first = false;
- print_pre_expr (outfile, expr);
-
- fprintf (outfile, " (%04d)", get_expr_value_id (expr));
- }
- }
- fprintf (outfile, " }\n");
-}
-
-void debug_bitmap_set (bitmap_set_t);
-
-DEBUG_FUNCTION void
-debug_bitmap_set (bitmap_set_t set)
-{
- print_bitmap_set (stderr, set, "debug", 0);
-}
-
-void debug_bitmap_sets_for (basic_block);
-
-DEBUG_FUNCTION void
-debug_bitmap_sets_for (basic_block bb)
-{
- print_bitmap_set (stderr, AVAIL_OUT (bb), "avail_out", bb->index);
- print_bitmap_set (stderr, EXP_GEN (bb), "exp_gen", bb->index);
- print_bitmap_set (stderr, PHI_GEN (bb), "phi_gen", bb->index);
- print_bitmap_set (stderr, TMP_GEN (bb), "tmp_gen", bb->index);
- print_bitmap_set (stderr, ANTIC_IN (bb), "antic_in", bb->index);
- if (do_partial_partial)
- print_bitmap_set (stderr, PA_IN (bb), "pa_in", bb->index);
- print_bitmap_set (stderr, NEW_SETS (bb), "new_sets", bb->index);
-}
-
-/* Print out the expressions that have VAL to OUTFILE. */
-
-static void
-print_value_expressions (FILE *outfile, unsigned int val)
-{
- bitmap set = value_expressions[val];
- if (set)
- {
- bitmap_set x;
- char s[10];
- sprintf (s, "%04d", val);
- x.expressions = *set;
- print_bitmap_set (outfile, &x, s, 0);
- }
-}
-
-
-DEBUG_FUNCTION void
-debug_value_expressions (unsigned int val)
-{
- print_value_expressions (stderr, val);
-}
-
-/* Given a CONSTANT, allocate a new CONSTANT type PRE_EXPR to
- represent it. */
-
-static pre_expr
-get_or_alloc_expr_for_constant (tree constant)
-{
- unsigned int result_id;
- struct pre_expr_d expr;
- pre_expr newexpr;
-
- expr.kind = CONSTANT;
- PRE_EXPR_CONSTANT (&expr) = constant;
- result_id = lookup_expression_id (&expr);
- if (result_id != 0)
- return expression_for_id (result_id);
-
- newexpr = pre_expr_pool.allocate ();
- newexpr->kind = CONSTANT;
- newexpr->loc = UNKNOWN_LOCATION;
- PRE_EXPR_CONSTANT (newexpr) = constant;
- alloc_expression_id (newexpr);
- newexpr->value_id = get_or_alloc_constant_value_id (constant);
- add_to_value (newexpr->value_id, newexpr);
- return newexpr;
-}
-
-/* Get or allocate a pre_expr for a piece of GIMPLE, and return it.
- Currently only supports constants and SSA_NAMES. */
-static pre_expr
-get_or_alloc_expr_for (tree t)
-{
- if (TREE_CODE (t) == SSA_NAME)
- return get_or_alloc_expr_for_name (t);
- else if (is_gimple_min_invariant (t))
- return get_or_alloc_expr_for_constant (t);
- gcc_unreachable ();
-}
-
-/* Return the folded version of T if T, when folded, is a gimple
- min_invariant or an SSA name. Otherwise, return T. */
-
-static pre_expr
-fully_constant_expression (pre_expr e)
-{
- switch (e->kind)
- {
- case CONSTANT:
- return e;
- case NARY:
- {
- vn_nary_op_t nary = PRE_EXPR_NARY (e);
- tree res = vn_nary_simplify (nary);
- if (!res)
- return e;
- if (is_gimple_min_invariant (res))
- return get_or_alloc_expr_for_constant (res);
- if (TREE_CODE (res) == SSA_NAME)
- return get_or_alloc_expr_for_name (res);
- return e;
- }
- case REFERENCE:
- {
- vn_reference_t ref = PRE_EXPR_REFERENCE (e);
- tree folded;
- if ((folded = fully_constant_vn_reference_p (ref)))
- return get_or_alloc_expr_for_constant (folded);
- return e;
- }
- default:
- return e;
- }
-}
-
-/* Translate the VUSE backwards through phi nodes in E->dest, so that
- it has the value it would have in E->src. Set *SAME_VALID to true
- in case the new vuse doesn't change the value id of the OPERANDS. */
-
-static tree
-translate_vuse_through_block (vec<vn_reference_op_s> operands,
- alias_set_type set, alias_set_type base_set,
- tree type, tree vuse, edge e, bool *same_valid)
-{
- basic_block phiblock = e->dest;
- gimple *phi = SSA_NAME_DEF_STMT (vuse);
- ao_ref ref;
-
- if (same_valid)
- *same_valid = true;
-
- if (gimple_bb (phi) != phiblock)
- return vuse;
-
- /* We have pruned expressions that are killed in PHIBLOCK via
- prune_clobbered_mems but we have not rewritten the VUSE to the one
- live at the start of the block. If there is no virtual PHI to translate
- through return the VUSE live at entry. Otherwise the VUSE to translate
- is the def of the virtual PHI node. */
- phi = get_virtual_phi (phiblock);
- if (!phi)
- return BB_LIVE_VOP_ON_EXIT
- (get_immediate_dominator (CDI_DOMINATORS, phiblock));
-
- if (same_valid
- && ao_ref_init_from_vn_reference (&ref, set, base_set, type, operands))
- {
- bitmap visited = NULL;
- /* Try to find a vuse that dominates this phi node by skipping
- non-clobbering statements. */
- unsigned int cnt = param_sccvn_max_alias_queries_per_access;
- vuse = get_continuation_for_phi (phi, &ref, true,
- cnt, &visited, false, NULL, NULL);
- if (visited)
- BITMAP_FREE (visited);
- }
- else
- vuse = NULL_TREE;
- /* If we didn't find any, the value ID can't stay the same. */
- if (!vuse && same_valid)
- *same_valid = false;
-
- /* ??? We would like to return vuse here as this is the canonical
- upmost vdef that this reference is associated with. But during
- insertion of the references into the hash tables we only ever
- directly insert with their direct gimple_vuse, hence returning
- something else would make us not find the other expression. */
- return PHI_ARG_DEF (phi, e->dest_idx);
-}
-
-/* Like bitmap_find_leader, but checks for the value existing in SET1 *or*
- SET2 *or* SET3. This is used to avoid making a set consisting of the union
- of PA_IN and ANTIC_IN during insert and phi-translation. */
-
-static inline pre_expr
-find_leader_in_sets (unsigned int val, bitmap_set_t set1, bitmap_set_t set2,
- bitmap_set_t set3 = NULL)
-{
- pre_expr result = NULL;
-
- if (set1)
- result = bitmap_find_leader (set1, val);
- if (!result && set2)
- result = bitmap_find_leader (set2, val);
- if (!result && set3)
- result = bitmap_find_leader (set3, val);
- return result;
-}
-
-/* Get the tree type for our PRE expression e. */
-
-static tree
-get_expr_type (const pre_expr e)
-{
- switch (e->kind)
- {
- case NAME:
- return TREE_TYPE (PRE_EXPR_NAME (e));
- case CONSTANT:
- return TREE_TYPE (PRE_EXPR_CONSTANT (e));
- case REFERENCE:
- return PRE_EXPR_REFERENCE (e)->type;
- case NARY:
- return PRE_EXPR_NARY (e)->type;
- }
- gcc_unreachable ();
-}
-
-/* Get a representative SSA_NAME for a given expression that is available in B.
- Since all of our sub-expressions are treated as values, we require
- them to be SSA_NAME's for simplicity.
- Prior versions of GVNPRE used to use "value handles" here, so that
- an expression would be VH.11 + VH.10 instead of d_3 + e_6. In
- either case, the operands are really values (IE we do not expect
- them to be usable without finding leaders). */
-
-static tree
-get_representative_for (const pre_expr e, basic_block b = NULL)
-{
- tree name, valnum = NULL_TREE;
- unsigned int value_id = get_expr_value_id (e);
-
- switch (e->kind)
- {
- case NAME:
- return PRE_EXPR_NAME (e);
- case CONSTANT:
- return PRE_EXPR_CONSTANT (e);
- case NARY:
- case REFERENCE:
- {
- /* Go through all of the expressions representing this value
- and pick out an SSA_NAME. */
- unsigned int i;
- bitmap_iterator bi;
- bitmap exprs = value_expressions[value_id];
- EXECUTE_IF_SET_IN_BITMAP (exprs, 0, i, bi)
- {
- pre_expr rep = expression_for_id (i);
- if (rep->kind == NAME)
- {
- tree name = PRE_EXPR_NAME (rep);
- valnum = VN_INFO (name)->valnum;
- gimple *def = SSA_NAME_DEF_STMT (name);
- /* We have to return either a new representative or one
- that can be used for expression simplification and thus
- is available in B. */
- if (! b
- || gimple_nop_p (def)
- || dominated_by_p (CDI_DOMINATORS, b, gimple_bb (def)))
- return name;
- }
- else if (rep->kind == CONSTANT)
- return PRE_EXPR_CONSTANT (rep);
- }
- }
- break;
- }
-
- /* If we reached here we couldn't find an SSA_NAME. This can
- happen when we've discovered a value that has never appeared in
- the program as set to an SSA_NAME, as the result of phi translation.
- Create one here.
- ??? We should be able to re-use this when we insert the statement
- to compute it. */
- name = make_temp_ssa_name (get_expr_type (e), gimple_build_nop (), "pretmp");
- vn_ssa_aux_t vn_info = VN_INFO (name);
- vn_info->value_id = value_id;
- vn_info->valnum = valnum ? valnum : name;
- vn_info->visited = true;
- /* ??? For now mark this SSA name for release by VN. */
- vn_info->needs_insertion = true;
- add_to_value (value_id, get_or_alloc_expr_for_name (name));
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Created SSA_NAME representative ");
- print_generic_expr (dump_file, name);
- fprintf (dump_file, " for expression:");
- print_pre_expr (dump_file, e);
- fprintf (dump_file, " (%04d)\n", value_id);
- }
-
- return name;
-}
-
-
-static pre_expr
-phi_translate (bitmap_set_t, pre_expr, bitmap_set_t, bitmap_set_t, edge);
-
-/* Translate EXPR using phis in PHIBLOCK, so that it has the values of
- the phis in PRED. Return NULL if we can't find a leader for each part
- of the translated expression. */
-
-static pre_expr
-phi_translate_1 (bitmap_set_t dest,
- pre_expr expr, bitmap_set_t set1, bitmap_set_t set2, edge e)
-{
- basic_block pred = e->src;
- basic_block phiblock = e->dest;
- location_t expr_loc = expr->loc;
- switch (expr->kind)
- {
- case NARY:
- {
- unsigned int i;
- bool changed = false;
- vn_nary_op_t nary = PRE_EXPR_NARY (expr);
- vn_nary_op_t newnary = XALLOCAVAR (struct vn_nary_op_s,
- sizeof_vn_nary_op (nary->length));
- memcpy (newnary, nary, sizeof_vn_nary_op (nary->length));
-
- for (i = 0; i < newnary->length; i++)
- {
- if (TREE_CODE (newnary->op[i]) != SSA_NAME)
- continue;
- else
- {
- pre_expr leader, result;
- unsigned int op_val_id = VN_INFO (newnary->op[i])->value_id;
- leader = find_leader_in_sets (op_val_id, set1, set2);
- result = phi_translate (dest, leader, set1, set2, e);
- if (result && result != leader)
- /* If op has a leader in the sets we translate make
- sure to use the value of the translated expression.
- We might need a new representative for that. */
- newnary->op[i] = get_representative_for (result, pred);
- else if (!result)
- return NULL;
-
- changed |= newnary->op[i] != nary->op[i];
- }
- }
- if (changed)
- {
- pre_expr constant;
- unsigned int new_val_id;
-
- PRE_EXPR_NARY (expr) = newnary;
- constant = fully_constant_expression (expr);
- PRE_EXPR_NARY (expr) = nary;
- if (constant != expr)
- {
- /* For non-CONSTANTs we have to make sure we can eventually
- insert the expression. Which means we need to have a
- leader for it. */
- if (constant->kind != CONSTANT)
- {
- /* Do not allow simplifications to non-constants over
- backedges as this will likely result in a loop PHI node
- to be inserted and increased register pressure.
- See PR77498 - this avoids doing predcoms work in
- a less efficient way. */
- if (e->flags & EDGE_DFS_BACK)
- ;
- else
- {
- unsigned value_id = get_expr_value_id (constant);
- /* We want a leader in ANTIC_OUT or AVAIL_OUT here.
- dest has what we computed into ANTIC_OUT sofar
- so pick from that - since topological sorting
- by sorted_array_from_bitmap_set isn't perfect
- we may lose some cases here. */
- constant = find_leader_in_sets (value_id, dest,
- AVAIL_OUT (pred));
- if (constant)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "simplifying ");
- print_pre_expr (dump_file, expr);
- fprintf (dump_file, " translated %d -> %d to ",
- phiblock->index, pred->index);
- PRE_EXPR_NARY (expr) = newnary;
- print_pre_expr (dump_file, expr);
- PRE_EXPR_NARY (expr) = nary;
- fprintf (dump_file, " to ");
- print_pre_expr (dump_file, constant);
- fprintf (dump_file, "\n");
- }
- return constant;
- }
- }
- }
- else
- return constant;
- }
-
- tree result = vn_nary_op_lookup_pieces (newnary->length,
- newnary->opcode,
- newnary->type,
- &newnary->op[0],
- &nary);
- if (result && is_gimple_min_invariant (result))
- return get_or_alloc_expr_for_constant (result);
-
- if (!nary || nary->predicated_values)
- {
- new_val_id = get_next_value_id ();
- nary = vn_nary_op_insert_pieces (newnary->length,
- newnary->opcode,
- newnary->type,
- &newnary->op[0],
- result, new_val_id);
- }
- expr = get_or_alloc_expr_for_nary (nary, expr_loc);
- add_to_value (get_expr_value_id (expr), expr);
- }
- return expr;
- }
- break;
-
- case REFERENCE:
- {
- vn_reference_t ref = PRE_EXPR_REFERENCE (expr);
- vec<vn_reference_op_s> operands = ref->operands;
- tree vuse = ref->vuse;
- tree newvuse = vuse;
- vec<vn_reference_op_s> newoperands = vNULL;
- bool changed = false, same_valid = true;
- unsigned int i, n;
- vn_reference_op_t operand;
- vn_reference_t newref;
-
- for (i = 0; operands.iterate (i, &operand); i++)
- {
- pre_expr opresult;
- pre_expr leader;
- tree op[3];
- tree type = operand->type;
- vn_reference_op_s newop = *operand;
- op[0] = operand->op0;
- op[1] = operand->op1;
- op[2] = operand->op2;
- for (n = 0; n < 3; ++n)
- {
- unsigned int op_val_id;
- if (!op[n])
- continue;
- if (TREE_CODE (op[n]) != SSA_NAME)
- {
- /* We can't possibly insert these. */
- if (n != 0
- && !is_gimple_min_invariant (op[n]))
- break;
- continue;
- }
- op_val_id = VN_INFO (op[n])->value_id;
- leader = find_leader_in_sets (op_val_id, set1, set2);
- opresult = phi_translate (dest, leader, set1, set2, e);
- if (opresult && opresult != leader)
- {
- tree name = get_representative_for (opresult);
- changed |= name != op[n];
- op[n] = name;
- }
- else if (!opresult)
- break;
- }
- if (n != 3)
- {
- newoperands.release ();
- return NULL;
- }
- /* When we translate a MEM_REF across a backedge and we have
- restrict info that's not from our functions parameters
- we have to remap it since we now may deal with a different
- instance where the dependence info is no longer valid.
- See PR102970. Note instead of keeping a remapping table
- per backedge we simply throw away restrict info. */
- if ((newop.opcode == MEM_REF
- || newop.opcode == TARGET_MEM_REF)
- && newop.clique > 1
- && (e->flags & EDGE_DFS_BACK))
- {
- newop.clique = 0;
- newop.base = 0;
- changed = true;
- }
- if (!changed)
- continue;
- if (!newoperands.exists ())
- newoperands = operands.copy ();
- /* We may have changed from an SSA_NAME to a constant */
- if (newop.opcode == SSA_NAME && TREE_CODE (op[0]) != SSA_NAME)
- newop.opcode = TREE_CODE (op[0]);
- newop.type = type;
- newop.op0 = op[0];
- newop.op1 = op[1];
- newop.op2 = op[2];
- newoperands[i] = newop;
- }
- gcc_checking_assert (i == operands.length ());
-
- if (vuse)
- {
- newvuse = translate_vuse_through_block (newoperands.exists ()
- ? newoperands : operands,
- ref->set, ref->base_set,
- ref->type, vuse, e,
- changed
- ? NULL : &same_valid);
- if (newvuse == NULL_TREE)
- {
- newoperands.release ();
- return NULL;
- }
- }
-
- if (changed || newvuse != vuse)
- {
- unsigned int new_val_id;
-
- tree result = vn_reference_lookup_pieces (newvuse, ref->set,
- ref->base_set,
- ref->type,
- newoperands.exists ()
- ? newoperands : operands,
- &newref, VN_WALK);
- if (result)
- newoperands.release ();
-
- /* We can always insert constants, so if we have a partial
- redundant constant load of another type try to translate it
- to a constant of appropriate type. */
- if (result && is_gimple_min_invariant (result))
- {
- tree tem = result;
- if (!useless_type_conversion_p (ref->type, TREE_TYPE (result)))
- {
- tem = fold_unary (VIEW_CONVERT_EXPR, ref->type, result);
- if (tem && !is_gimple_min_invariant (tem))
- tem = NULL_TREE;
- }
- if (tem)
- return get_or_alloc_expr_for_constant (tem);
- }
-
- /* If we'd have to convert things we would need to validate
- if we can insert the translated expression. So fail
- here for now - we cannot insert an alias with a different
- type in the VN tables either, as that would assert. */
- if (result
- && !useless_type_conversion_p (ref->type, TREE_TYPE (result)))
- return NULL;
- else if (!result && newref
- && !useless_type_conversion_p (ref->type, newref->type))
- {
- newoperands.release ();
- return NULL;
- }
-
- if (newref)
- new_val_id = newref->value_id;
- else
- {
- if (changed || !same_valid)
- new_val_id = get_next_value_id ();
- else
- new_val_id = ref->value_id;
- if (!newoperands.exists ())
- newoperands = operands.copy ();
- newref = vn_reference_insert_pieces (newvuse, ref->set,
- ref->base_set, ref->type,
- newoperands,
- result, new_val_id);
- newoperands = vNULL;
- }
- expr = get_or_alloc_expr_for_reference (newref, expr_loc);
- add_to_value (new_val_id, expr);
- }
- newoperands.release ();
- return expr;
- }
- break;
-
- case NAME:
- {
- tree name = PRE_EXPR_NAME (expr);
- gimple *def_stmt = SSA_NAME_DEF_STMT (name);
- /* If the SSA name is defined by a PHI node in this block,
- translate it. */
- if (gimple_code (def_stmt) == GIMPLE_PHI
- && gimple_bb (def_stmt) == phiblock)
- {
- tree def = PHI_ARG_DEF (def_stmt, e->dest_idx);
-
- /* Handle constant. */
- if (is_gimple_min_invariant (def))
- return get_or_alloc_expr_for_constant (def);
-
- return get_or_alloc_expr_for_name (def);
- }
- /* Otherwise return it unchanged - it will get removed if its
- value is not available in PREDs AVAIL_OUT set of expressions
- by the subtraction of TMP_GEN. */
- return expr;
- }
-
- default:
- gcc_unreachable ();
- }
-}
-
-/* Wrapper around phi_translate_1 providing caching functionality. */
-
-static pre_expr
-phi_translate (bitmap_set_t dest, pre_expr expr,
- bitmap_set_t set1, bitmap_set_t set2, edge e)
-{
- expr_pred_trans_t slot = NULL;
- pre_expr phitrans;
-
- if (!expr)
- return NULL;
-
- /* Constants contain no values that need translation. */
- if (expr->kind == CONSTANT)
- return expr;
-
- if (value_id_constant_p (get_expr_value_id (expr)))
- return expr;
-
- /* Don't add translations of NAMEs as those are cheap to translate. */
- if (expr->kind != NAME)
- {
- if (phi_trans_add (&slot, expr, e->src))
- return slot->v == 0 ? NULL : expression_for_id (slot->v);
- /* Store NULL for the value we want to return in the case of
- recursing. */
- slot->v = 0;
- }
-
- /* Translate. */
- basic_block saved_valueize_bb = vn_context_bb;
- vn_context_bb = e->src;
- phitrans = phi_translate_1 (dest, expr, set1, set2, e);
- vn_context_bb = saved_valueize_bb;
-
- if (slot)
- {
- /* We may have reallocated. */
- phi_trans_add (&slot, expr, e->src);
- if (phitrans)
- slot->v = get_expression_id (phitrans);
- else
- /* Remove failed translations again, they cause insert
- iteration to not pick up new opportunities reliably. */
- PHI_TRANS_TABLE (e->src)->clear_slot (slot);
- }
-
- return phitrans;
-}
-
-
-/* For each expression in SET, translate the values through phi nodes
- in PHIBLOCK using edge PHIBLOCK->PRED, and store the resulting
- expressions in DEST. */
-
-static void
-phi_translate_set (bitmap_set_t dest, bitmap_set_t set, edge e)
-{
- bitmap_iterator bi;
- unsigned int i;
-
- if (gimple_seq_empty_p (phi_nodes (e->dest)))
- {
- bitmap_set_copy (dest, set);
- return;
- }
-
- /* Allocate the phi-translation cache where we have an idea about
- its size. hash-table implementation internals tell us that
- allocating the table to fit twice the number of elements will
- make sure we do not usually re-allocate. */
- if (!PHI_TRANS_TABLE (e->src))
- PHI_TRANS_TABLE (e->src) = new hash_table<expr_pred_trans_d>
- (2 * bitmap_count_bits (&set->expressions));
- FOR_EACH_EXPR_ID_IN_SET (set, i, bi)
- {
- pre_expr expr = expression_for_id (i);
- pre_expr translated = phi_translate (dest, expr, set, NULL, e);
- if (!translated)
- continue;
-
- bitmap_insert_into_set (dest, translated);
- }
-}
-
-/* Find the leader for a value (i.e., the name representing that
- value) in a given set, and return it. Return NULL if no leader
- is found. */
-
-static pre_expr
-bitmap_find_leader (bitmap_set_t set, unsigned int val)
-{
- if (value_id_constant_p (val))
- return constant_value_expressions[-val];
-
- if (bitmap_set_contains_value (set, val))
- {
- /* Rather than walk the entire bitmap of expressions, and see
- whether any of them has the value we are looking for, we look
- at the reverse mapping, which tells us the set of expressions
- that have a given value (IE value->expressions with that
- value) and see if any of those expressions are in our set.
- The number of expressions per value is usually significantly
- less than the number of expressions in the set. In fact, for
- large testcases, doing it this way is roughly 5-10x faster
- than walking the bitmap.
- If this is somehow a significant lose for some cases, we can
- choose which set to walk based on which set is smaller. */
- unsigned int i;
- bitmap_iterator bi;
- bitmap exprset = value_expressions[val];
-
- if (!exprset->first->next)
- EXECUTE_IF_SET_IN_BITMAP (exprset, 0, i, bi)
- if (bitmap_bit_p (&set->expressions, i))
- return expression_for_id (i);
-
- EXECUTE_IF_AND_IN_BITMAP (exprset, &set->expressions, 0, i, bi)
- return expression_for_id (i);
- }
- return NULL;
-}
-
-/* Determine if EXPR, a memory expression, is ANTIC_IN at the top of
- BLOCK by seeing if it is not killed in the block. Note that we are
- only determining whether there is a store that kills it. Because
- of the order in which clean iterates over values, we are guaranteed
- that altered operands will have caused us to be eliminated from the
- ANTIC_IN set already. */
-
-static bool
-value_dies_in_block_x (pre_expr expr, basic_block block)
-{
- tree vuse = PRE_EXPR_REFERENCE (expr)->vuse;
- vn_reference_t refx = PRE_EXPR_REFERENCE (expr);
- gimple *def;
- gimple_stmt_iterator gsi;
- unsigned id = get_expression_id (expr);
- bool res = false;
- ao_ref ref;
-
- if (!vuse)
- return false;
-
- /* Lookup a previously calculated result. */
- if (EXPR_DIES (block)
- && bitmap_bit_p (EXPR_DIES (block), id * 2))
- return bitmap_bit_p (EXPR_DIES (block), id * 2 + 1);
-
- /* A memory expression {e, VUSE} dies in the block if there is a
- statement that may clobber e. If, starting statement walk from the
- top of the basic block, a statement uses VUSE there can be no kill
- inbetween that use and the original statement that loaded {e, VUSE},
- so we can stop walking. */
- ref.base = NULL_TREE;
- for (gsi = gsi_start_bb (block); !gsi_end_p (gsi); gsi_next (&gsi))
- {
- tree def_vuse, def_vdef;
- def = gsi_stmt (gsi);
- def_vuse = gimple_vuse (def);
- def_vdef = gimple_vdef (def);
-
- /* Not a memory statement. */
- if (!def_vuse)
- continue;
-
- /* Not a may-def. */
- if (!def_vdef)
- {
- /* A load with the same VUSE, we're done. */
- if (def_vuse == vuse)
- break;
-
- continue;
- }
-
- /* Init ref only if we really need it. */
- if (ref.base == NULL_TREE
- && !ao_ref_init_from_vn_reference (&ref, refx->set, refx->base_set,
- refx->type, refx->operands))
- {
- res = true;
- break;
- }
- /* If the statement may clobber expr, it dies. */
- if (stmt_may_clobber_ref_p_1 (def, &ref))
- {
- res = true;
- break;
- }
- }
-
- /* Remember the result. */
- if (!EXPR_DIES (block))
- EXPR_DIES (block) = BITMAP_ALLOC (&grand_bitmap_obstack);
- bitmap_set_bit (EXPR_DIES (block), id * 2);
- if (res)
- bitmap_set_bit (EXPR_DIES (block), id * 2 + 1);
-
- return res;
-}
-
-
-/* Determine if OP is valid in SET1 U SET2, which it is when the union
- contains its value-id. */
-
-static bool
-op_valid_in_sets (bitmap_set_t set1, bitmap_set_t set2, tree op)
-{
- if (op && TREE_CODE (op) == SSA_NAME)
- {
- unsigned int value_id = VN_INFO (op)->value_id;
- if (!(bitmap_set_contains_value (set1, value_id)
- || (set2 && bitmap_set_contains_value (set2, value_id))))
- return false;
- }
- return true;
-}
-
-/* Determine if the expression EXPR is valid in SET1 U SET2.
- ONLY SET2 CAN BE NULL.
- This means that we have a leader for each part of the expression
- (if it consists of values), or the expression is an SSA_NAME.
- For loads/calls, we also see if the vuse is killed in this block. */
-
-static bool
-valid_in_sets (bitmap_set_t set1, bitmap_set_t set2, pre_expr expr)
-{
- switch (expr->kind)
- {
- case NAME:
- /* By construction all NAMEs are available. Non-available
- NAMEs are removed by subtracting TMP_GEN from the sets. */
- return true;
- case NARY:
- {
- unsigned int i;
- vn_nary_op_t nary = PRE_EXPR_NARY (expr);
- for (i = 0; i < nary->length; i++)
- if (!op_valid_in_sets (set1, set2, nary->op[i]))
- return false;
- return true;
- }
- break;
- case REFERENCE:
- {
- vn_reference_t ref = PRE_EXPR_REFERENCE (expr);
- vn_reference_op_t vro;
- unsigned int i;
-
- FOR_EACH_VEC_ELT (ref->operands, i, vro)
- {
- if (!op_valid_in_sets (set1, set2, vro->op0)
- || !op_valid_in_sets (set1, set2, vro->op1)
- || !op_valid_in_sets (set1, set2, vro->op2))
- return false;
- }
- return true;
- }
- default:
- gcc_unreachable ();
- }
-}
-
-/* Clean the set of expressions SET1 that are no longer valid in SET1 or SET2.
- This means expressions that are made up of values we have no leaders for
- in SET1 or SET2. */
-
-static void
-clean (bitmap_set_t set1, bitmap_set_t set2 = NULL)
-{
- vec<pre_expr> exprs = sorted_array_from_bitmap_set (set1);
- pre_expr expr;
- int i;
-
- FOR_EACH_VEC_ELT (exprs, i, expr)
- {
- if (!valid_in_sets (set1, set2, expr))
- {
- unsigned int val = get_expr_value_id (expr);
- bitmap_clear_bit (&set1->expressions, get_expression_id (expr));
- /* We are entered with possibly multiple expressions for a value
- so before removing a value from the set see if there's an
- expression for it left. */
- if (! bitmap_find_leader (set1, val))
- bitmap_clear_bit (&set1->values, val);
- }
- }
- exprs.release ();
-
- if (flag_checking)
- {
- unsigned j;
- bitmap_iterator bi;
- FOR_EACH_EXPR_ID_IN_SET (set1, j, bi)
- gcc_assert (valid_in_sets (set1, set2, expression_for_id (j)));
- }
-}
-
-/* Clean the set of expressions that are no longer valid in SET because
- they are clobbered in BLOCK or because they trap and may not be executed. */
-
-static void
-prune_clobbered_mems (bitmap_set_t set, basic_block block)
-{
- bitmap_iterator bi;
- unsigned i;
- unsigned to_remove = -1U;
- bool any_removed = false;
-
- FOR_EACH_EXPR_ID_IN_SET (set, i, bi)
- {
- /* Remove queued expr. */
- if (to_remove != -1U)
- {
- bitmap_clear_bit (&set->expressions, to_remove);
- any_removed = true;
- to_remove = -1U;
- }
-
- pre_expr expr = expression_for_id (i);
- if (expr->kind == REFERENCE)
- {
- vn_reference_t ref = PRE_EXPR_REFERENCE (expr);
- if (ref->vuse)
- {
- gimple *def_stmt = SSA_NAME_DEF_STMT (ref->vuse);
- if (!gimple_nop_p (def_stmt)
- && ((gimple_bb (def_stmt) != block
- && !dominated_by_p (CDI_DOMINATORS,
- block, gimple_bb (def_stmt)))
- || (gimple_bb (def_stmt) == block
- && value_dies_in_block_x (expr, block))))
- to_remove = i;
- }
- /* If the REFERENCE may trap make sure the block does not contain
- a possible exit point.
- ??? This is overly conservative if we translate AVAIL_OUT
- as the available expression might be after the exit point. */
- if (BB_MAY_NOTRETURN (block)
- && vn_reference_may_trap (ref))
- to_remove = i;
- }
- else if (expr->kind == NARY)
- {
- vn_nary_op_t nary = PRE_EXPR_NARY (expr);
- /* If the NARY may trap make sure the block does not contain
- a possible exit point.
- ??? This is overly conservative if we translate AVAIL_OUT
- as the available expression might be after the exit point. */
- if (BB_MAY_NOTRETURN (block)
- && vn_nary_may_trap (nary))
- to_remove = i;
- }
- }
-
- /* Remove queued expr. */
- if (to_remove != -1U)
- {
- bitmap_clear_bit (&set->expressions, to_remove);
- any_removed = true;
- }
-
- /* Above we only removed expressions, now clean the set of values
- which no longer have any corresponding expression. We cannot
- clear the value at the time we remove an expression since there
- may be multiple expressions per value.
- If we'd queue possibly to be removed values we could use
- the bitmap_find_leader way to see if there's still an expression
- for it. For some ratio of to be removed values and number of
- values/expressions in the set this might be faster than rebuilding
- the value-set. */
- if (any_removed)
- {
- bitmap_clear (&set->values);
- FOR_EACH_EXPR_ID_IN_SET (set, i, bi)
- {
- pre_expr expr = expression_for_id (i);
- unsigned int value_id = get_expr_value_id (expr);
- bitmap_set_bit (&set->values, value_id);
- }
- }
-}
-
-/* Compute the ANTIC set for BLOCK.
-
- If succs(BLOCK) > 1 then
- ANTIC_OUT[BLOCK] = intersection of ANTIC_IN[b] for all succ(BLOCK)
- else if succs(BLOCK) == 1 then
- ANTIC_OUT[BLOCK] = phi_translate (ANTIC_IN[succ(BLOCK)])
-
- ANTIC_IN[BLOCK] = clean(ANTIC_OUT[BLOCK] U EXP_GEN[BLOCK] - TMP_GEN[BLOCK])
-
- Note that clean() is deferred until after the iteration. */
-
-static bool
-compute_antic_aux (basic_block block, bool block_has_abnormal_pred_edge)
-{
- bitmap_set_t S, old, ANTIC_OUT;
- edge e;
- edge_iterator ei;
-
- bool was_visited = BB_VISITED (block);
- bool changed = ! BB_VISITED (block);
- BB_VISITED (block) = 1;
- old = ANTIC_OUT = S = NULL;
-
- /* If any edges from predecessors are abnormal, antic_in is empty,
- so do nothing. */
- if (block_has_abnormal_pred_edge)
- goto maybe_dump_sets;
-
- old = ANTIC_IN (block);
- ANTIC_OUT = bitmap_set_new ();
-
- /* If the block has no successors, ANTIC_OUT is empty. */
- if (EDGE_COUNT (block->succs) == 0)
- ;
- /* If we have one successor, we could have some phi nodes to
- translate through. */
- else if (single_succ_p (block))
- {
- e = single_succ_edge (block);
- gcc_assert (BB_VISITED (e->dest));
- phi_translate_set (ANTIC_OUT, ANTIC_IN (e->dest), e);
- }
- /* If we have multiple successors, we take the intersection of all of
- them. Note that in the case of loop exit phi nodes, we may have
- phis to translate through. */
- else
- {
- size_t i;
- edge first = NULL;
-
- auto_vec<edge> worklist (EDGE_COUNT (block->succs));
- FOR_EACH_EDGE (e, ei, block->succs)
- {
- if (!first
- && BB_VISITED (e->dest))
- first = e;
- else if (BB_VISITED (e->dest))
- worklist.quick_push (e);
- else
- {
- /* Unvisited successors get their ANTIC_IN replaced by the
- maximal set to arrive at a maximum ANTIC_IN solution.
- We can ignore them in the intersection operation and thus
- need not explicitely represent that maximum solution. */
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "ANTIC_IN is MAX on %d->%d\n",
- e->src->index, e->dest->index);
- }
- }
-
- /* Of multiple successors we have to have visited one already
- which is guaranteed by iteration order. */
- gcc_assert (first != NULL);
-
- phi_translate_set (ANTIC_OUT, ANTIC_IN (first->dest), first);
-
- /* If we have multiple successors we need to intersect the ANTIC_OUT
- sets. For values that's a simple intersection but for
- expressions it is a union. Given we want to have a single
- expression per value in our sets we have to canonicalize.
- Avoid randomness and running into cycles like for PR82129 and
- canonicalize the expression we choose to the one with the
- lowest id. This requires we actually compute the union first. */
- FOR_EACH_VEC_ELT (worklist, i, e)
- {
- if (!gimple_seq_empty_p (phi_nodes (e->dest)))
- {
- bitmap_set_t tmp = bitmap_set_new ();
- phi_translate_set (tmp, ANTIC_IN (e->dest), e);
- bitmap_and_into (&ANTIC_OUT->values, &tmp->values);
- bitmap_ior_into (&ANTIC_OUT->expressions, &tmp->expressions);
- bitmap_set_free (tmp);
- }
- else
- {
- bitmap_and_into (&ANTIC_OUT->values, &ANTIC_IN (e->dest)->values);
- bitmap_ior_into (&ANTIC_OUT->expressions,
- &ANTIC_IN (e->dest)->expressions);
- }
- }
- if (! worklist.is_empty ())
- {
- /* Prune expressions not in the value set. */
- bitmap_iterator bi;
- unsigned int i;
- unsigned int to_clear = -1U;
- FOR_EACH_EXPR_ID_IN_SET (ANTIC_OUT, i, bi)
- {
- if (to_clear != -1U)
- {
- bitmap_clear_bit (&ANTIC_OUT->expressions, to_clear);
- to_clear = -1U;
- }
- pre_expr expr = expression_for_id (i);
- unsigned int value_id = get_expr_value_id (expr);
- if (!bitmap_bit_p (&ANTIC_OUT->values, value_id))
- to_clear = i;
- }
- if (to_clear != -1U)
- bitmap_clear_bit (&ANTIC_OUT->expressions, to_clear);
- }
- }
-
- /* Prune expressions that are clobbered in block and thus become
- invalid if translated from ANTIC_OUT to ANTIC_IN. */
- prune_clobbered_mems (ANTIC_OUT, block);
-
- /* Generate ANTIC_OUT - TMP_GEN. */
- S = bitmap_set_subtract_expressions (ANTIC_OUT, TMP_GEN (block));
-
- /* Start ANTIC_IN with EXP_GEN - TMP_GEN. */
- ANTIC_IN (block) = bitmap_set_subtract_expressions (EXP_GEN (block),
- TMP_GEN (block));
-
- /* Then union in the ANTIC_OUT - TMP_GEN values,
- to get ANTIC_OUT U EXP_GEN - TMP_GEN */
- bitmap_ior_into (&ANTIC_IN (block)->values, &S->values);
- bitmap_ior_into (&ANTIC_IN (block)->expressions, &S->expressions);
-
- /* clean (ANTIC_IN (block)) is defered to after the iteration converged
- because it can cause non-convergence, see for example PR81181. */
-
- /* Intersect ANTIC_IN with the old ANTIC_IN. This is required until
- we properly represent the maximum expression set, thus not prune
- values without expressions during the iteration. */
- if (was_visited
- && bitmap_and_into (&ANTIC_IN (block)->values, &old->values))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "warning: intersecting with old ANTIC_IN "
- "shrinks the set\n");
- /* Prune expressions not in the value set. */
- bitmap_iterator bi;
- unsigned int i;
- unsigned int to_clear = -1U;
- FOR_EACH_EXPR_ID_IN_SET (ANTIC_IN (block), i, bi)
- {
- if (to_clear != -1U)
- {
- bitmap_clear_bit (&ANTIC_IN (block)->expressions, to_clear);
- to_clear = -1U;
- }
- pre_expr expr = expression_for_id (i);
- unsigned int value_id = get_expr_value_id (expr);
- if (!bitmap_bit_p (&ANTIC_IN (block)->values, value_id))
- to_clear = i;
- }
- if (to_clear != -1U)
- bitmap_clear_bit (&ANTIC_IN (block)->expressions, to_clear);
- }
-
- if (!bitmap_set_equal (old, ANTIC_IN (block)))
- changed = true;
-
- maybe_dump_sets:
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- if (ANTIC_OUT)
- print_bitmap_set (dump_file, ANTIC_OUT, "ANTIC_OUT", block->index);
-
- if (changed)
- fprintf (dump_file, "[changed] ");
- print_bitmap_set (dump_file, ANTIC_IN (block), "ANTIC_IN",
- block->index);
-
- if (S)
- print_bitmap_set (dump_file, S, "S", block->index);
- }
- if (old)
- bitmap_set_free (old);
- if (S)
- bitmap_set_free (S);
- if (ANTIC_OUT)
- bitmap_set_free (ANTIC_OUT);
- return changed;
-}
-
-/* Compute PARTIAL_ANTIC for BLOCK.
-
- If succs(BLOCK) > 1 then
- PA_OUT[BLOCK] = value wise union of PA_IN[b] + all ANTIC_IN not
- in ANTIC_OUT for all succ(BLOCK)
- else if succs(BLOCK) == 1 then
- PA_OUT[BLOCK] = phi_translate (PA_IN[succ(BLOCK)])
-
- PA_IN[BLOCK] = clean(PA_OUT[BLOCK] - TMP_GEN[BLOCK] - ANTIC_IN[BLOCK])
-
-*/
-static void
-compute_partial_antic_aux (basic_block block,
- bool block_has_abnormal_pred_edge)
-{
- bitmap_set_t old_PA_IN;
- bitmap_set_t PA_OUT;
- edge e;
- edge_iterator ei;
- unsigned long max_pa = param_max_partial_antic_length;
-
- old_PA_IN = PA_OUT = NULL;
-
- /* If any edges from predecessors are abnormal, antic_in is empty,
- so do nothing. */
- if (block_has_abnormal_pred_edge)
- goto maybe_dump_sets;
-
- /* If there are too many partially anticipatable values in the
- block, phi_translate_set can take an exponential time: stop
- before the translation starts. */
- if (max_pa
- && single_succ_p (block)
- && bitmap_count_bits (&PA_IN (single_succ (block))->values) > max_pa)
- goto maybe_dump_sets;
-
- old_PA_IN = PA_IN (block);
- PA_OUT = bitmap_set_new ();
-
- /* If the block has no successors, ANTIC_OUT is empty. */
- if (EDGE_COUNT (block->succs) == 0)
- ;
- /* If we have one successor, we could have some phi nodes to
- translate through. Note that we can't phi translate across DFS
- back edges in partial antic, because it uses a union operation on
- the successors. For recurrences like IV's, we will end up
- generating a new value in the set on each go around (i + 3 (VH.1)
- VH.1 + 1 (VH.2), VH.2 + 1 (VH.3), etc), forever. */
- else if (single_succ_p (block))
- {
- e = single_succ_edge (block);
- if (!(e->flags & EDGE_DFS_BACK))
- phi_translate_set (PA_OUT, PA_IN (e->dest), e);
- }
- /* If we have multiple successors, we take the union of all of
- them. */
- else
- {
- size_t i;
-
- auto_vec<edge> worklist (EDGE_COUNT (block->succs));
- FOR_EACH_EDGE (e, ei, block->succs)
- {
- if (e->flags & EDGE_DFS_BACK)
- continue;
- worklist.quick_push (e);
- }
- if (worklist.length () > 0)
- {
- FOR_EACH_VEC_ELT (worklist, i, e)
- {
- unsigned int i;
- bitmap_iterator bi;
-
- FOR_EACH_EXPR_ID_IN_SET (ANTIC_IN (e->dest), i, bi)
- bitmap_value_insert_into_set (PA_OUT,
- expression_for_id (i));
- if (!gimple_seq_empty_p (phi_nodes (e->dest)))
- {
- bitmap_set_t pa_in = bitmap_set_new ();
- phi_translate_set (pa_in, PA_IN (e->dest), e);
- FOR_EACH_EXPR_ID_IN_SET (pa_in, i, bi)
- bitmap_value_insert_into_set (PA_OUT,
- expression_for_id (i));
- bitmap_set_free (pa_in);
- }
- else
- FOR_EACH_EXPR_ID_IN_SET (PA_IN (e->dest), i, bi)
- bitmap_value_insert_into_set (PA_OUT,
- expression_for_id (i));
- }
- }
- }
-
- /* Prune expressions that are clobbered in block and thus become
- invalid if translated from PA_OUT to PA_IN. */
- prune_clobbered_mems (PA_OUT, block);
-
- /* PA_IN starts with PA_OUT - TMP_GEN.
- Then we subtract things from ANTIC_IN. */
- PA_IN (block) = bitmap_set_subtract_expressions (PA_OUT, TMP_GEN (block));
-
- /* For partial antic, we want to put back in the phi results, since
- we will properly avoid making them partially antic over backedges. */
- bitmap_ior_into (&PA_IN (block)->values, &PHI_GEN (block)->values);
- bitmap_ior_into (&PA_IN (block)->expressions, &PHI_GEN (block)->expressions);
-
- /* PA_IN[block] = PA_IN[block] - ANTIC_IN[block] */
- bitmap_set_subtract_values (PA_IN (block), ANTIC_IN (block));
-
- clean (PA_IN (block), ANTIC_IN (block));
-
- maybe_dump_sets:
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- if (PA_OUT)
- print_bitmap_set (dump_file, PA_OUT, "PA_OUT", block->index);
-
- print_bitmap_set (dump_file, PA_IN (block), "PA_IN", block->index);
- }
- if (old_PA_IN)
- bitmap_set_free (old_PA_IN);
- if (PA_OUT)
- bitmap_set_free (PA_OUT);
-}
-
-/* Compute ANTIC and partial ANTIC sets. */
-
-static void
-compute_antic (void)
-{
- bool changed = true;
- int num_iterations = 0;
- basic_block block;
- int i;
- edge_iterator ei;
- edge e;
-
- /* If any predecessor edges are abnormal, we punt, so antic_in is empty.
- We pre-build the map of blocks with incoming abnormal edges here. */
- auto_sbitmap has_abnormal_preds (last_basic_block_for_fn (cfun));
- bitmap_clear (has_abnormal_preds);
-
- FOR_ALL_BB_FN (block, cfun)
- {
- BB_VISITED (block) = 0;
-
- FOR_EACH_EDGE (e, ei, block->preds)
- if (e->flags & EDGE_ABNORMAL)
- {
- bitmap_set_bit (has_abnormal_preds, block->index);
- break;
- }
-
- /* While we are here, give empty ANTIC_IN sets to each block. */
- ANTIC_IN (block) = bitmap_set_new ();
- if (do_partial_partial)
- PA_IN (block) = bitmap_set_new ();
- }
-
- /* At the exit block we anticipate nothing. */
- BB_VISITED (EXIT_BLOCK_PTR_FOR_FN (cfun)) = 1;
-
- /* For ANTIC computation we need a postorder that also guarantees that
- a block with a single successor is visited after its successor.
- RPO on the inverted CFG has this property. */
- auto_vec<int, 20> postorder;
- inverted_post_order_compute (&postorder);
-
- auto_sbitmap worklist (last_basic_block_for_fn (cfun) + 1);
- bitmap_clear (worklist);
- FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
- bitmap_set_bit (worklist, e->src->index);
- while (changed)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Starting iteration %d\n", num_iterations);
- /* ??? We need to clear our PHI translation cache here as the
- ANTIC sets shrink and we restrict valid translations to
- those having operands with leaders in ANTIC. Same below
- for PA ANTIC computation. */
- num_iterations++;
- changed = false;
- for (i = postorder.length () - 1; i >= 0; i--)
- {
- if (bitmap_bit_p (worklist, postorder[i]))
- {
- basic_block block = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
- bitmap_clear_bit (worklist, block->index);
- if (compute_antic_aux (block,
- bitmap_bit_p (has_abnormal_preds,
- block->index)))
- {
- FOR_EACH_EDGE (e, ei, block->preds)
- bitmap_set_bit (worklist, e->src->index);
- changed = true;
- }
- }
- }
- /* Theoretically possible, but *highly* unlikely. */
- gcc_checking_assert (num_iterations < 500);
- }
-
- /* We have to clean after the dataflow problem converged as cleaning
- can cause non-convergence because it is based on expressions
- rather than values. */
- FOR_EACH_BB_FN (block, cfun)
- clean (ANTIC_IN (block));
-
- statistics_histogram_event (cfun, "compute_antic iterations",
- num_iterations);
-
- if (do_partial_partial)
- {
- /* For partial antic we ignore backedges and thus we do not need
- to perform any iteration when we process blocks in postorder. */
- for (i = postorder.length () - 1; i >= 0; i--)
- {
- basic_block block = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
- compute_partial_antic_aux (block,
- bitmap_bit_p (has_abnormal_preds,
- block->index));
- }
- }
-}
-
-
-/* Inserted expressions are placed onto this worklist, which is used
- for performing quick dead code elimination of insertions we made
- that didn't turn out to be necessary. */
-static bitmap inserted_exprs;
-
-/* The actual worker for create_component_ref_by_pieces. */
-
-static tree
-create_component_ref_by_pieces_1 (basic_block block, vn_reference_t ref,
- unsigned int *operand, gimple_seq *stmts)
-{
- vn_reference_op_t currop = &ref->operands[*operand];
- tree genop;
- ++*operand;
- switch (currop->opcode)
- {
- case CALL_EXPR:
- gcc_unreachable ();
-
- case MEM_REF:
- {
- tree baseop = create_component_ref_by_pieces_1 (block, ref, operand,
- stmts);
- if (!baseop)
- return NULL_TREE;
- tree offset = currop->op0;
- if (TREE_CODE (baseop) == ADDR_EXPR
- && handled_component_p (TREE_OPERAND (baseop, 0)))
- {
- poly_int64 off;
- tree base;
- base = get_addr_base_and_unit_offset (TREE_OPERAND (baseop, 0),
- &off);
- gcc_assert (base);
- offset = int_const_binop (PLUS_EXPR, offset,
- build_int_cst (TREE_TYPE (offset),
- off));
- baseop = build_fold_addr_expr (base);
- }
- genop = build2 (MEM_REF, currop->type, baseop, offset);
- MR_DEPENDENCE_CLIQUE (genop) = currop->clique;
- MR_DEPENDENCE_BASE (genop) = currop->base;
- REF_REVERSE_STORAGE_ORDER (genop) = currop->reverse;
- return genop;
- }
-
- case TARGET_MEM_REF:
- {
- tree genop0 = NULL_TREE, genop1 = NULL_TREE;
- vn_reference_op_t nextop = &ref->operands[(*operand)++];
- tree baseop = create_component_ref_by_pieces_1 (block, ref, operand,
- stmts);
- if (!baseop)
- return NULL_TREE;
- if (currop->op0)
- {
- genop0 = find_or_generate_expression (block, currop->op0, stmts);
- if (!genop0)
- return NULL_TREE;
- }
- if (nextop->op0)
- {
- genop1 = find_or_generate_expression (block, nextop->op0, stmts);
- if (!genop1)
- return NULL_TREE;
- }
- genop = build5 (TARGET_MEM_REF, currop->type,
- baseop, currop->op2, genop0, currop->op1, genop1);
-
- MR_DEPENDENCE_CLIQUE (genop) = currop->clique;
- MR_DEPENDENCE_BASE (genop) = currop->base;
- return genop;
- }
-
- case ADDR_EXPR:
- if (currop->op0)
- {
- gcc_assert (is_gimple_min_invariant (currop->op0));
- return currop->op0;
- }
- /* Fallthrough. */
- case REALPART_EXPR:
- case IMAGPART_EXPR:
- case VIEW_CONVERT_EXPR:
- {
- tree genop0 = create_component_ref_by_pieces_1 (block, ref, operand,
- stmts);
- if (!genop0)
- return NULL_TREE;
- return fold_build1 (currop->opcode, currop->type, genop0);
- }
-
- case WITH_SIZE_EXPR:
- {
- tree genop0 = create_component_ref_by_pieces_1 (block, ref, operand,
- stmts);
- if (!genop0)
- return NULL_TREE;
- tree genop1 = find_or_generate_expression (block, currop->op0, stmts);
- if (!genop1)
- return NULL_TREE;
- return fold_build2 (currop->opcode, currop->type, genop0, genop1);
- }
-
- case BIT_FIELD_REF:
- {
- tree genop0 = create_component_ref_by_pieces_1 (block, ref, operand,
- stmts);
- if (!genop0)
- return NULL_TREE;
- tree op1 = currop->op0;
- tree op2 = currop->op1;
- tree t = build3 (BIT_FIELD_REF, currop->type, genop0, op1, op2);
- REF_REVERSE_STORAGE_ORDER (t) = currop->reverse;
- return fold (t);
- }
-
- /* For array ref vn_reference_op's, operand 1 of the array ref
- is op0 of the reference op and operand 3 of the array ref is
- op1. */
- case ARRAY_RANGE_REF:
- case ARRAY_REF:
- {
- tree genop0;
- tree genop1 = currop->op0;
- tree genop2 = currop->op1;
- tree genop3 = currop->op2;
- genop0 = create_component_ref_by_pieces_1 (block, ref, operand,
- stmts);
- if (!genop0)
- return NULL_TREE;
- genop1 = find_or_generate_expression (block, genop1, stmts);
- if (!genop1)
- return NULL_TREE;
- if (genop2)
- {
- tree domain_type = TYPE_DOMAIN (TREE_TYPE (genop0));
- /* Drop zero minimum index if redundant. */
- if (integer_zerop (genop2)
- && (!domain_type
- || integer_zerop (TYPE_MIN_VALUE (domain_type))))
- genop2 = NULL_TREE;
- else
- {
- genop2 = find_or_generate_expression (block, genop2, stmts);
- if (!genop2)
- return NULL_TREE;
- }
- }
- if (genop3)
- {
- tree elmt_type = TREE_TYPE (TREE_TYPE (genop0));
- /* We can't always put a size in units of the element alignment
- here as the element alignment may be not visible. See
- PR43783. Simply drop the element size for constant
- sizes. */
- if (TREE_CODE (genop3) == INTEGER_CST
- && TREE_CODE (TYPE_SIZE_UNIT (elmt_type)) == INTEGER_CST
- && wi::eq_p (wi::to_offset (TYPE_SIZE_UNIT (elmt_type)),
- (wi::to_offset (genop3)
- * vn_ref_op_align_unit (currop))))
- genop3 = NULL_TREE;
- else
- {
- genop3 = find_or_generate_expression (block, genop3, stmts);
- if (!genop3)
- return NULL_TREE;
- }
- }
- return build4 (currop->opcode, currop->type, genop0, genop1,
- genop2, genop3);
- }
- case COMPONENT_REF:
- {
- tree op0;
- tree op1;
- tree genop2 = currop->op1;
- op0 = create_component_ref_by_pieces_1 (block, ref, operand, stmts);
- if (!op0)
- return NULL_TREE;
- /* op1 should be a FIELD_DECL, which are represented by themselves. */
- op1 = currop->op0;
- if (genop2)
- {
- genop2 = find_or_generate_expression (block, genop2, stmts);
- if (!genop2)
- return NULL_TREE;
- }
- return fold_build3 (COMPONENT_REF, TREE_TYPE (op1), op0, op1, genop2);
- }
-
- case SSA_NAME:
- {
- genop = find_or_generate_expression (block, currop->op0, stmts);
- return genop;
- }
- case STRING_CST:
- case INTEGER_CST:
- case POLY_INT_CST:
- case COMPLEX_CST:
- case VECTOR_CST:
- case REAL_CST:
- case CONSTRUCTOR:
- case VAR_DECL:
- case PARM_DECL:
- case CONST_DECL:
- case RESULT_DECL:
- case FUNCTION_DECL:
- return currop->op0;
-
- default:
- gcc_unreachable ();
- }
-}
-
-/* For COMPONENT_REF's and ARRAY_REF's, we can't have any intermediates for the
- COMPONENT_REF or MEM_REF or ARRAY_REF portion, because we'd end up with
- trying to rename aggregates into ssa form directly, which is a no no.
-
- Thus, this routine doesn't create temporaries, it just builds a
- single access expression for the array, calling
- find_or_generate_expression to build the innermost pieces.
-
- This function is a subroutine of create_expression_by_pieces, and
- should not be called on it's own unless you really know what you
- are doing. */
-
-static tree
-create_component_ref_by_pieces (basic_block block, vn_reference_t ref,
- gimple_seq *stmts)
-{
- unsigned int op = 0;
- return create_component_ref_by_pieces_1 (block, ref, &op, stmts);
-}
-
-/* Find a simple leader for an expression, or generate one using
- create_expression_by_pieces from a NARY expression for the value.
- BLOCK is the basic_block we are looking for leaders in.
- OP is the tree expression to find a leader for or generate.
- Returns the leader or NULL_TREE on failure. */
-
-static tree
-find_or_generate_expression (basic_block block, tree op, gimple_seq *stmts)
-{
- pre_expr expr = get_or_alloc_expr_for (op);
- unsigned int lookfor = get_expr_value_id (expr);
- pre_expr leader = bitmap_find_leader (AVAIL_OUT (block), lookfor);
- if (leader)
- {
- if (leader->kind == NAME)
- return PRE_EXPR_NAME (leader);
- else if (leader->kind == CONSTANT)
- return PRE_EXPR_CONSTANT (leader);
-
- /* Defer. */
- return NULL_TREE;
- }
-
- /* It must be a complex expression, so generate it recursively. Note
- that this is only necessary to handle gcc.dg/tree-ssa/ssa-pre28.c
- where the insert algorithm fails to insert a required expression. */
- bitmap exprset = value_expressions[lookfor];
- bitmap_iterator bi;
- unsigned int i;
- EXECUTE_IF_SET_IN_BITMAP (exprset, 0, i, bi)
- {
- pre_expr temp = expression_for_id (i);
- /* We cannot insert random REFERENCE expressions at arbitrary
- places. We can insert NARYs which eventually re-materializes
- its operand values. */
- if (temp->kind == NARY)
- return create_expression_by_pieces (block, temp, stmts,
- get_expr_type (expr));
- }
-
- /* Defer. */
- return NULL_TREE;
-}
-
-/* Create an expression in pieces, so that we can handle very complex
- expressions that may be ANTIC, but not necessary GIMPLE.
- BLOCK is the basic block the expression will be inserted into,
- EXPR is the expression to insert (in value form)
- STMTS is a statement list to append the necessary insertions into.
-
- This function will die if we hit some value that shouldn't be
- ANTIC but is (IE there is no leader for it, or its components).
- The function returns NULL_TREE in case a different antic expression
- has to be inserted first.
- This function may also generate expressions that are themselves
- partially or fully redundant. Those that are will be either made
- fully redundant during the next iteration of insert (for partially
- redundant ones), or eliminated by eliminate (for fully redundant
- ones). */
-
-static tree
-create_expression_by_pieces (basic_block block, pre_expr expr,
- gimple_seq *stmts, tree type)
-{
- tree name;
- tree folded;
- gimple_seq forced_stmts = NULL;
- unsigned int value_id;
- gimple_stmt_iterator gsi;
- tree exprtype = type ? type : get_expr_type (expr);
- pre_expr nameexpr;
- gassign *newstmt;
-
- switch (expr->kind)
- {
- /* We may hit the NAME/CONSTANT case if we have to convert types
- that value numbering saw through. */
- case NAME:
- folded = PRE_EXPR_NAME (expr);
- if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (folded))
- return NULL_TREE;
- if (useless_type_conversion_p (exprtype, TREE_TYPE (folded)))
- return folded;
- break;
- case CONSTANT:
- {
- folded = PRE_EXPR_CONSTANT (expr);
- tree tem = fold_convert (exprtype, folded);
- if (is_gimple_min_invariant (tem))
- return tem;
- break;
- }
- case REFERENCE:
- if (PRE_EXPR_REFERENCE (expr)->operands[0].opcode == CALL_EXPR)
- {
- vn_reference_t ref = PRE_EXPR_REFERENCE (expr);
- unsigned int operand = 1;
- vn_reference_op_t currop = &ref->operands[0];
- tree sc = NULL_TREE;
- tree fn = NULL_TREE;
- if (currop->op0)
- {
- fn = find_or_generate_expression (block, currop->op0, stmts);
- if (!fn)
- return NULL_TREE;
- }
- if (currop->op1)
- {
- sc = find_or_generate_expression (block, currop->op1, stmts);
- if (!sc)
- return NULL_TREE;
- }
- auto_vec<tree> args (ref->operands.length () - 1);
- while (operand < ref->operands.length ())
- {
- tree arg = create_component_ref_by_pieces_1 (block, ref,
- &operand, stmts);
- if (!arg)
- return NULL_TREE;
- args.quick_push (arg);
- }
- gcall *call;
- if (currop->op0)
- {
- call = gimple_build_call_vec (fn, args);
- gimple_call_set_fntype (call, currop->type);
- }
- else
- call = gimple_build_call_internal_vec ((internal_fn)currop->clique,
- args);
- gimple_set_location (call, expr->loc);
- if (sc)
- gimple_call_set_chain (call, sc);
- tree forcedname = make_ssa_name (ref->type);
- gimple_call_set_lhs (call, forcedname);
- /* There's no CCP pass after PRE which would re-compute alignment
- information so make sure we re-materialize this here. */
- if (gimple_call_builtin_p (call, BUILT_IN_ASSUME_ALIGNED)
- && args.length () - 2 <= 1
- && tree_fits_uhwi_p (args[1])
- && (args.length () != 3 || tree_fits_uhwi_p (args[2])))
- {
- unsigned HOST_WIDE_INT halign = tree_to_uhwi (args[1]);
- unsigned HOST_WIDE_INT hmisalign
- = args.length () == 3 ? tree_to_uhwi (args[2]) : 0;
- if ((halign & (halign - 1)) == 0
- && (hmisalign & ~(halign - 1)) == 0
- && (unsigned int)halign != 0)
- set_ptr_info_alignment (get_ptr_info (forcedname),
- halign, hmisalign);
- }
- gimple_set_vuse (call, BB_LIVE_VOP_ON_EXIT (block));
- gimple_seq_add_stmt_without_update (&forced_stmts, call);
- folded = forcedname;
- }
- else
- {
- folded = create_component_ref_by_pieces (block,
- PRE_EXPR_REFERENCE (expr),
- stmts);
- if (!folded)
- return NULL_TREE;
- name = make_temp_ssa_name (exprtype, NULL, "pretmp");
- newstmt = gimple_build_assign (name, folded);
- gimple_set_location (newstmt, expr->loc);
- gimple_seq_add_stmt_without_update (&forced_stmts, newstmt);
- gimple_set_vuse (newstmt, BB_LIVE_VOP_ON_EXIT (block));
- folded = name;
- }
- break;
- case NARY:
- {
- vn_nary_op_t nary = PRE_EXPR_NARY (expr);
- tree *genop = XALLOCAVEC (tree, nary->length);
- unsigned i;
- for (i = 0; i < nary->length; ++i)
- {
- genop[i] = find_or_generate_expression (block, nary->op[i], stmts);
- if (!genop[i])
- return NULL_TREE;
- /* Ensure genop[] is properly typed for POINTER_PLUS_EXPR. It
- may have conversions stripped. */
- if (nary->opcode == POINTER_PLUS_EXPR)
- {
- if (i == 0)
- genop[i] = gimple_convert (&forced_stmts,
- nary->type, genop[i]);
- else if (i == 1)
- genop[i] = gimple_convert (&forced_stmts,
- sizetype, genop[i]);
- }
- else
- genop[i] = gimple_convert (&forced_stmts,
- TREE_TYPE (nary->op[i]), genop[i]);
- }
- if (nary->opcode == CONSTRUCTOR)
- {
- vec<constructor_elt, va_gc> *elts = NULL;
- for (i = 0; i < nary->length; ++i)
- CONSTRUCTOR_APPEND_ELT (elts, NULL_TREE, genop[i]);
- folded = build_constructor (nary->type, elts);
- name = make_temp_ssa_name (exprtype, NULL, "pretmp");
- newstmt = gimple_build_assign (name, folded);
- gimple_set_location (newstmt, expr->loc);
- gimple_seq_add_stmt_without_update (&forced_stmts, newstmt);
- folded = name;
- }
- else
- {
- switch (nary->length)
- {
- case 1:
- folded = gimple_build (&forced_stmts, expr->loc,
- nary->opcode, nary->type, genop[0]);
- break;
- case 2:
- folded = gimple_build (&forced_stmts, expr->loc, nary->opcode,
- nary->type, genop[0], genop[1]);
- break;
- case 3:
- folded = gimple_build (&forced_stmts, expr->loc, nary->opcode,
- nary->type, genop[0], genop[1],
- genop[2]);
- break;
- default:
- gcc_unreachable ();
- }
- }
- }
- break;
- default:
- gcc_unreachable ();
- }
-
- folded = gimple_convert (&forced_stmts, exprtype, folded);
-
- /* If there is nothing to insert, return the simplified result. */
- if (gimple_seq_empty_p (forced_stmts))
- return folded;
- /* If we simplified to a constant return it and discard eventually
- built stmts. */
- if (is_gimple_min_invariant (folded))
- {
- gimple_seq_discard (forced_stmts);
- return folded;
- }
- /* Likewise if we simplified to sth not queued for insertion. */
- bool found = false;
- gsi = gsi_last (forced_stmts);
- for (; !gsi_end_p (gsi); gsi_prev (&gsi))
- {
- gimple *stmt = gsi_stmt (gsi);
- tree forcedname = gimple_get_lhs (stmt);
- if (forcedname == folded)
- {
- found = true;
- break;
- }
- }
- if (! found)
- {
- gimple_seq_discard (forced_stmts);
- return folded;
- }
- gcc_assert (TREE_CODE (folded) == SSA_NAME);
-
- /* If we have any intermediate expressions to the value sets, add them
- to the value sets and chain them in the instruction stream. */
- if (forced_stmts)
- {
- gsi = gsi_start (forced_stmts);
- for (; !gsi_end_p (gsi); gsi_next (&gsi))
- {
- gimple *stmt = gsi_stmt (gsi);
- tree forcedname = gimple_get_lhs (stmt);
- pre_expr nameexpr;
-
- if (forcedname != folded)
- {
- vn_ssa_aux_t vn_info = VN_INFO (forcedname);
- vn_info->valnum = forcedname;
- vn_info->value_id = get_next_value_id ();
- nameexpr = get_or_alloc_expr_for_name (forcedname);
- add_to_value (vn_info->value_id, nameexpr);
- if (NEW_SETS (block))
- bitmap_value_replace_in_set (NEW_SETS (block), nameexpr);
- bitmap_value_replace_in_set (AVAIL_OUT (block), nameexpr);
- }
-
- bitmap_set_bit (inserted_exprs, SSA_NAME_VERSION (forcedname));
- }
- gimple_seq_add_seq (stmts, forced_stmts);
- }
-
- name = folded;
-
- /* Fold the last statement. */
- gsi = gsi_last (*stmts);
- if (fold_stmt_inplace (&gsi))
- update_stmt (gsi_stmt (gsi));
-
- /* Add a value number to the temporary.
- The value may already exist in either NEW_SETS, or AVAIL_OUT, because
- we are creating the expression by pieces, and this particular piece of
- the expression may have been represented. There is no harm in replacing
- here. */
- value_id = get_expr_value_id (expr);
- vn_ssa_aux_t vn_info = VN_INFO (name);
- vn_info->value_id = value_id;
- vn_info->valnum = vn_valnum_from_value_id (value_id);
- if (vn_info->valnum == NULL_TREE)
- vn_info->valnum = name;
- gcc_assert (vn_info->valnum != NULL_TREE);
- nameexpr = get_or_alloc_expr_for_name (name);
- add_to_value (value_id, nameexpr);
- if (NEW_SETS (block))
- bitmap_value_replace_in_set (NEW_SETS (block), nameexpr);
- bitmap_value_replace_in_set (AVAIL_OUT (block), nameexpr);
-
- pre_stats.insertions++;
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Inserted ");
- print_gimple_stmt (dump_file, gsi_stmt (gsi_last (*stmts)), 0);
- fprintf (dump_file, " in predecessor %d (%04d)\n",
- block->index, value_id);
- }
-
- return name;
-}
-
-
-/* Insert the to-be-made-available values of expression EXPRNUM for each
- predecessor, stored in AVAIL, into the predecessors of BLOCK, and
- merge the result with a phi node, given the same value number as
- NODE. Return true if we have inserted new stuff. */
-
-static bool
-insert_into_preds_of_block (basic_block block, unsigned int exprnum,
- vec<pre_expr> &avail)
-{
- pre_expr expr = expression_for_id (exprnum);
- pre_expr newphi;
- unsigned int val = get_expr_value_id (expr);
- edge pred;
- bool insertions = false;
- bool nophi = false;
- basic_block bprime;
- pre_expr eprime;
- edge_iterator ei;
- tree type = get_expr_type (expr);
- tree temp;
- gphi *phi;
-
- /* Make sure we aren't creating an induction variable. */
- if (bb_loop_depth (block) > 0 && EDGE_COUNT (block->preds) == 2)
- {
- bool firstinsideloop = false;
- bool secondinsideloop = false;
- firstinsideloop = flow_bb_inside_loop_p (block->loop_father,
- EDGE_PRED (block, 0)->src);
- secondinsideloop = flow_bb_inside_loop_p (block->loop_father,
- EDGE_PRED (block, 1)->src);
- /* Induction variables only have one edge inside the loop. */
- if ((firstinsideloop ^ secondinsideloop)
- && expr->kind != REFERENCE)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Skipping insertion of phi for partial "
- "redundancy: Looks like an induction variable\n");
- nophi = true;
- }
- }
-
- /* Make the necessary insertions. */
- FOR_EACH_EDGE (pred, ei, block->preds)
- {
- /* When we are not inserting a PHI node do not bother inserting
- into places that do not dominate the anticipated computations. */
- if (nophi && !dominated_by_p (CDI_DOMINATORS, block, pred->src))
- continue;
- gimple_seq stmts = NULL;
- tree builtexpr;
- bprime = pred->src;
- eprime = avail[pred->dest_idx];
- builtexpr = create_expression_by_pieces (bprime, eprime,
- &stmts, type);
- gcc_assert (!(pred->flags & EDGE_ABNORMAL));
- if (!gimple_seq_empty_p (stmts))
- {
- basic_block new_bb = gsi_insert_seq_on_edge_immediate (pred, stmts);
- gcc_assert (! new_bb);
- insertions = true;
- }
- if (!builtexpr)
- {
- /* We cannot insert a PHI node if we failed to insert
- on one edge. */
- nophi = true;
- continue;
- }
- if (is_gimple_min_invariant (builtexpr))
- avail[pred->dest_idx] = get_or_alloc_expr_for_constant (builtexpr);
- else
- avail[pred->dest_idx] = get_or_alloc_expr_for_name (builtexpr);
- }
- /* If we didn't want a phi node, and we made insertions, we still have
- inserted new stuff, and thus return true. If we didn't want a phi node,
- and didn't make insertions, we haven't added anything new, so return
- false. */
- if (nophi && insertions)
- return true;
- else if (nophi && !insertions)
- return false;
-
- /* Now build a phi for the new variable. */
- temp = make_temp_ssa_name (type, NULL, "prephitmp");
- phi = create_phi_node (temp, block);
-
- vn_ssa_aux_t vn_info = VN_INFO (temp);
- vn_info->value_id = val;
- vn_info->valnum = vn_valnum_from_value_id (val);
- if (vn_info->valnum == NULL_TREE)
- vn_info->valnum = temp;
- bitmap_set_bit (inserted_exprs, SSA_NAME_VERSION (temp));
- FOR_EACH_EDGE (pred, ei, block->preds)
- {
- pre_expr ae = avail[pred->dest_idx];
- gcc_assert (get_expr_type (ae) == type
- || useless_type_conversion_p (type, get_expr_type (ae)));
- if (ae->kind == CONSTANT)
- add_phi_arg (phi, unshare_expr (PRE_EXPR_CONSTANT (ae)),
- pred, UNKNOWN_LOCATION);
- else
- add_phi_arg (phi, PRE_EXPR_NAME (ae), pred, UNKNOWN_LOCATION);
- }
-
- newphi = get_or_alloc_expr_for_name (temp);
- add_to_value (val, newphi);
-
- /* The value should *not* exist in PHI_GEN, or else we wouldn't be doing
- this insertion, since we test for the existence of this value in PHI_GEN
- before proceeding with the partial redundancy checks in insert_aux.
-
- The value may exist in AVAIL_OUT, in particular, it could be represented
- by the expression we are trying to eliminate, in which case we want the
- replacement to occur. If it's not existing in AVAIL_OUT, we want it
- inserted there.
-
- Similarly, to the PHI_GEN case, the value should not exist in NEW_SETS of
- this block, because if it did, it would have existed in our dominator's
- AVAIL_OUT, and would have been skipped due to the full redundancy check.
- */
-
- bitmap_insert_into_set (PHI_GEN (block), newphi);
- bitmap_value_replace_in_set (AVAIL_OUT (block),
- newphi);
- if (NEW_SETS (block))
- bitmap_insert_into_set (NEW_SETS (block), newphi);
-
- /* If we insert a PHI node for a conversion of another PHI node
- in the same basic-block try to preserve range information.
- This is important so that followup loop passes receive optimal
- number of iteration analysis results. See PR61743. */
- if (expr->kind == NARY
- && CONVERT_EXPR_CODE_P (expr->u.nary->opcode)
- && TREE_CODE (expr->u.nary->op[0]) == SSA_NAME
- && gimple_bb (SSA_NAME_DEF_STMT (expr->u.nary->op[0])) == block
- && INTEGRAL_TYPE_P (type)
- && INTEGRAL_TYPE_P (TREE_TYPE (expr->u.nary->op[0]))
- && (TYPE_PRECISION (type)
- >= TYPE_PRECISION (TREE_TYPE (expr->u.nary->op[0])))
- && SSA_NAME_RANGE_INFO (expr->u.nary->op[0]))
- {
- value_range r;
- if (get_range_query (cfun)->range_of_expr (r, expr->u.nary->op[0])
- && r.kind () == VR_RANGE
- && !wi::neg_p (r.lower_bound (), SIGNED)
- && !wi::neg_p (r.upper_bound (), SIGNED))
- /* Just handle extension and sign-changes of all-positive ranges. */
- set_range_info (temp, VR_RANGE,
- wide_int_storage::from (r.lower_bound (),
- TYPE_PRECISION (type),
- TYPE_SIGN (type)),
- wide_int_storage::from (r.upper_bound (),
- TYPE_PRECISION (type),
- TYPE_SIGN (type)));
- }
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Created phi ");
- print_gimple_stmt (dump_file, phi, 0);
- fprintf (dump_file, " in block %d (%04d)\n", block->index, val);
- }
- pre_stats.phis++;
- return true;
-}
-
-
-
-/* Perform insertion of partially redundant or hoistable values.
- For BLOCK, do the following:
- 1. Propagate the NEW_SETS of the dominator into the current block.
- If the block has multiple predecessors,
- 2a. Iterate over the ANTIC expressions for the block to see if
- any of them are partially redundant.
- 2b. If so, insert them into the necessary predecessors to make
- the expression fully redundant.
- 2c. Insert a new PHI merging the values of the predecessors.
- 2d. Insert the new PHI, and the new expressions, into the
- NEW_SETS set.
- If the block has multiple successors,
- 3a. Iterate over the ANTIC values for the block to see if
- any of them are good candidates for hoisting.
- 3b. If so, insert expressions computing the values in BLOCK,
- and add the new expressions into the NEW_SETS set.
- 4. Recursively call ourselves on the dominator children of BLOCK.
-
- Steps 1, 2a, and 4 are done by insert_aux. 2b, 2c and 2d are done by
- do_pre_regular_insertion and do_partial_insertion. 3a and 3b are
- done in do_hoist_insertion.
-*/
-
-static bool
-do_pre_regular_insertion (basic_block block, basic_block dom,
- vec<pre_expr> exprs)
-{
- bool new_stuff = false;
- pre_expr expr;
- auto_vec<pre_expr, 2> avail;
- int i;
-
- avail.safe_grow (EDGE_COUNT (block->preds), true);
-
- FOR_EACH_VEC_ELT (exprs, i, expr)
- {
- if (expr->kind == NARY
- || expr->kind == REFERENCE)
- {
- unsigned int val;
- bool by_some = false;
- bool cant_insert = false;
- bool all_same = true;
- pre_expr first_s = NULL;
- edge pred;
- basic_block bprime;
- pre_expr eprime = NULL;
- edge_iterator ei;
- pre_expr edoubleprime = NULL;
- bool do_insertion = false;
-
- val = get_expr_value_id (expr);
- if (bitmap_set_contains_value (PHI_GEN (block), val))
- continue;
- if (bitmap_set_contains_value (AVAIL_OUT (dom), val))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Found fully redundant value: ");
- print_pre_expr (dump_file, expr);
- fprintf (dump_file, "\n");
- }
- continue;
- }
-
- FOR_EACH_EDGE (pred, ei, block->preds)
- {
- unsigned int vprime;
-
- /* We should never run insertion for the exit block
- and so not come across fake pred edges. */
- gcc_assert (!(pred->flags & EDGE_FAKE));
- bprime = pred->src;
- /* We are looking at ANTIC_OUT of bprime. */
- eprime = phi_translate (NULL, expr, ANTIC_IN (block), NULL, pred);
-
- /* eprime will generally only be NULL if the
- value of the expression, translated
- through the PHI for this predecessor, is
- undefined. If that is the case, we can't
- make the expression fully redundant,
- because its value is undefined along a
- predecessor path. We can thus break out
- early because it doesn't matter what the
- rest of the results are. */
- if (eprime == NULL)
- {
- avail[pred->dest_idx] = NULL;
- cant_insert = true;
- break;
- }
-
- vprime = get_expr_value_id (eprime);
- edoubleprime = bitmap_find_leader (AVAIL_OUT (bprime),
- vprime);
- if (edoubleprime == NULL)
- {
- avail[pred->dest_idx] = eprime;
- all_same = false;
- }
- else
- {
- avail[pred->dest_idx] = edoubleprime;
- by_some = true;
- /* We want to perform insertions to remove a redundancy on
- a path in the CFG we want to optimize for speed. */
- if (optimize_edge_for_speed_p (pred))
- do_insertion = true;
- if (first_s == NULL)
- first_s = edoubleprime;
- else if (!pre_expr_d::equal (first_s, edoubleprime))
- all_same = false;
- }
- }
- /* If we can insert it, it's not the same value
- already existing along every predecessor, and
- it's defined by some predecessor, it is
- partially redundant. */
- if (!cant_insert && !all_same && by_some)
- {
- if (!do_insertion)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Skipping partial redundancy for "
- "expression ");
- print_pre_expr (dump_file, expr);
- fprintf (dump_file, " (%04d), no redundancy on to be "
- "optimized for speed edge\n", val);
- }
- }
- else if (dbg_cnt (treepre_insert))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Found partial redundancy for "
- "expression ");
- print_pre_expr (dump_file, expr);
- fprintf (dump_file, " (%04d)\n",
- get_expr_value_id (expr));
- }
- if (insert_into_preds_of_block (block,
- get_expression_id (expr),
- avail))
- new_stuff = true;
- }
- }
- /* If all edges produce the same value and that value is
- an invariant, then the PHI has the same value on all
- edges. Note this. */
- else if (!cant_insert
- && all_same
- && (edoubleprime->kind != NAME
- || !SSA_NAME_OCCURS_IN_ABNORMAL_PHI
- (PRE_EXPR_NAME (edoubleprime))))
- {
- gcc_assert (edoubleprime->kind == CONSTANT
- || edoubleprime->kind == NAME);
-
- tree temp = make_temp_ssa_name (get_expr_type (expr),
- NULL, "pretmp");
- gassign *assign
- = gimple_build_assign (temp,
- edoubleprime->kind == CONSTANT ?
- PRE_EXPR_CONSTANT (edoubleprime) :
- PRE_EXPR_NAME (edoubleprime));
- gimple_stmt_iterator gsi = gsi_after_labels (block);
- gsi_insert_before (&gsi, assign, GSI_NEW_STMT);
-
- vn_ssa_aux_t vn_info = VN_INFO (temp);
- vn_info->value_id = val;
- vn_info->valnum = vn_valnum_from_value_id (val);
- if (vn_info->valnum == NULL_TREE)
- vn_info->valnum = temp;
- bitmap_set_bit (inserted_exprs, SSA_NAME_VERSION (temp));
- pre_expr newe = get_or_alloc_expr_for_name (temp);
- add_to_value (val, newe);
- bitmap_value_replace_in_set (AVAIL_OUT (block), newe);
- bitmap_insert_into_set (NEW_SETS (block), newe);
- bitmap_insert_into_set (PHI_GEN (block), newe);
- }
- }
- }
-
- return new_stuff;
-}
-
-
-/* Perform insertion for partially anticipatable expressions. There
- is only one case we will perform insertion for these. This case is
- if the expression is partially anticipatable, and fully available.
- In this case, we know that putting it earlier will enable us to
- remove the later computation. */
-
-static bool
-do_pre_partial_partial_insertion (basic_block block, basic_block dom,
- vec<pre_expr> exprs)
-{
- bool new_stuff = false;
- pre_expr expr;
- auto_vec<pre_expr, 2> avail;
- int i;
-
- avail.safe_grow (EDGE_COUNT (block->preds), true);
-
- FOR_EACH_VEC_ELT (exprs, i, expr)
- {
- if (expr->kind == NARY
- || expr->kind == REFERENCE)
- {
- unsigned int val;
- bool by_all = true;
- bool cant_insert = false;
- edge pred;
- basic_block bprime;
- pre_expr eprime = NULL;
- edge_iterator ei;
-
- val = get_expr_value_id (expr);
- if (bitmap_set_contains_value (PHI_GEN (block), val))
- continue;
- if (bitmap_set_contains_value (AVAIL_OUT (dom), val))
- continue;
-
- FOR_EACH_EDGE (pred, ei, block->preds)
- {
- unsigned int vprime;
- pre_expr edoubleprime;
-
- /* We should never run insertion for the exit block
- and so not come across fake pred edges. */
- gcc_assert (!(pred->flags & EDGE_FAKE));
- bprime = pred->src;
- eprime = phi_translate (NULL, expr, ANTIC_IN (block),
- PA_IN (block), pred);
-
- /* eprime will generally only be NULL if the
- value of the expression, translated
- through the PHI for this predecessor, is
- undefined. If that is the case, we can't
- make the expression fully redundant,
- because its value is undefined along a
- predecessor path. We can thus break out
- early because it doesn't matter what the
- rest of the results are. */
- if (eprime == NULL)
- {
- avail[pred->dest_idx] = NULL;
- cant_insert = true;
- break;
- }
-
- vprime = get_expr_value_id (eprime);
- edoubleprime = bitmap_find_leader (AVAIL_OUT (bprime), vprime);
- avail[pred->dest_idx] = edoubleprime;
- if (edoubleprime == NULL)
- {
- by_all = false;
- break;
- }
- }
-
- /* If we can insert it, it's not the same value
- already existing along every predecessor, and
- it's defined by some predecessor, it is
- partially redundant. */
- if (!cant_insert && by_all)
- {
- edge succ;
- bool do_insertion = false;
-
- /* Insert only if we can remove a later expression on a path
- that we want to optimize for speed.
- The phi node that we will be inserting in BLOCK is not free,
- and inserting it for the sake of !optimize_for_speed successor
- may cause regressions on the speed path. */
- FOR_EACH_EDGE (succ, ei, block->succs)
- {
- if (bitmap_set_contains_value (PA_IN (succ->dest), val)
- || bitmap_set_contains_value (ANTIC_IN (succ->dest), val))
- {
- if (optimize_edge_for_speed_p (succ))
- do_insertion = true;
- }
- }
-
- if (!do_insertion)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Skipping partial partial redundancy "
- "for expression ");
- print_pre_expr (dump_file, expr);
- fprintf (dump_file, " (%04d), not (partially) anticipated "
- "on any to be optimized for speed edges\n", val);
- }
- }
- else if (dbg_cnt (treepre_insert))
- {
- pre_stats.pa_insert++;
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Found partial partial redundancy "
- "for expression ");
- print_pre_expr (dump_file, expr);
- fprintf (dump_file, " (%04d)\n",
- get_expr_value_id (expr));
- }
- if (insert_into_preds_of_block (block,
- get_expression_id (expr),
- avail))
- new_stuff = true;
- }
- }
- }
- }
-
- return new_stuff;
-}
-
-/* Insert expressions in BLOCK to compute hoistable values up.
- Return TRUE if something was inserted, otherwise return FALSE.
- The caller has to make sure that BLOCK has at least two successors. */
-
-static bool
-do_hoist_insertion (basic_block block)
-{
- edge e;
- edge_iterator ei;
- bool new_stuff = false;
- unsigned i;
- gimple_stmt_iterator last;
-
- /* At least two successors, or else... */
- gcc_assert (EDGE_COUNT (block->succs) >= 2);
-
- /* Check that all successors of BLOCK are dominated by block.
- We could use dominated_by_p() for this, but actually there is a much
- quicker check: any successor that is dominated by BLOCK can't have
- more than one predecessor edge. */
- FOR_EACH_EDGE (e, ei, block->succs)
- if (! single_pred_p (e->dest))
- return false;
-
- /* Determine the insertion point. If we cannot safely insert before
- the last stmt if we'd have to, bail out. */
- last = gsi_last_bb (block);
- if (!gsi_end_p (last)
- && !is_ctrl_stmt (gsi_stmt (last))
- && stmt_ends_bb_p (gsi_stmt (last)))
- return false;
-
- /* Compute the set of hoistable expressions from ANTIC_IN. First compute
- hoistable values. */
- bitmap_set hoistable_set;
-
- /* A hoistable value must be in ANTIC_IN(block)
- but not in AVAIL_OUT(BLOCK). */
- bitmap_initialize (&hoistable_set.values, &grand_bitmap_obstack);
- bitmap_and_compl (&hoistable_set.values,
- &ANTIC_IN (block)->values, &AVAIL_OUT (block)->values);
-
- /* Short-cut for a common case: hoistable_set is empty. */
- if (bitmap_empty_p (&hoistable_set.values))
- return false;
-
- /* Compute which of the hoistable values is in AVAIL_OUT of
- at least one of the successors of BLOCK. */
- bitmap_head availout_in_some;
- bitmap_initialize (&availout_in_some, &grand_bitmap_obstack);
- FOR_EACH_EDGE (e, ei, block->succs)
- /* Do not consider expressions solely because their availability
- on loop exits. They'd be ANTIC-IN throughout the whole loop
- and thus effectively hoisted across loops by combination of
- PRE and hoisting. */
- if (! loop_exit_edge_p (block->loop_father, e))
- bitmap_ior_and_into (&availout_in_some, &hoistable_set.values,
- &AVAIL_OUT (e->dest)->values);
- bitmap_clear (&hoistable_set.values);
-
- /* Short-cut for a common case: availout_in_some is empty. */
- if (bitmap_empty_p (&availout_in_some))
- return false;
-
- /* Hack hoitable_set in-place so we can use sorted_array_from_bitmap_set. */
- bitmap_move (&hoistable_set.values, &availout_in_some);
- hoistable_set.expressions = ANTIC_IN (block)->expressions;
-
- /* Now finally construct the topological-ordered expression set. */
- vec<pre_expr> exprs = sorted_array_from_bitmap_set (&hoistable_set);
-
- bitmap_clear (&hoistable_set.values);
-
- /* If there are candidate values for hoisting, insert expressions
- strategically to make the hoistable expressions fully redundant. */
- pre_expr expr;
- FOR_EACH_VEC_ELT (exprs, i, expr)
- {
- /* While we try to sort expressions topologically above the
- sorting doesn't work out perfectly. Catch expressions we
- already inserted. */
- unsigned int value_id = get_expr_value_id (expr);
- if (bitmap_set_contains_value (AVAIL_OUT (block), value_id))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file,
- "Already inserted expression for ");
- print_pre_expr (dump_file, expr);
- fprintf (dump_file, " (%04d)\n", value_id);
- }
- continue;
- }
-
- /* If we end up with a punned expression representation and this
- happens to be a float typed one give up - we can't know for
- sure whether all paths perform the floating-point load we are
- about to insert and on some targets this can cause correctness
- issues. See PR88240. */
- if (expr->kind == REFERENCE
- && PRE_EXPR_REFERENCE (expr)->punned
- && FLOAT_TYPE_P (get_expr_type (expr)))
- continue;
-
- /* OK, we should hoist this value. Perform the transformation. */
- pre_stats.hoist_insert++;
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file,
- "Inserting expression in block %d for code hoisting: ",
- block->index);
- print_pre_expr (dump_file, expr);
- fprintf (dump_file, " (%04d)\n", value_id);
- }
-
- gimple_seq stmts = NULL;
- tree res = create_expression_by_pieces (block, expr, &stmts,
- get_expr_type (expr));
-
- /* Do not return true if expression creation ultimately
- did not insert any statements. */
- if (gimple_seq_empty_p (stmts))
- res = NULL_TREE;
- else
- {
- if (gsi_end_p (last) || is_ctrl_stmt (gsi_stmt (last)))
- gsi_insert_seq_before (&last, stmts, GSI_SAME_STMT);
- else
- gsi_insert_seq_after (&last, stmts, GSI_NEW_STMT);
- }
-
- /* Make sure to not return true if expression creation ultimately
- failed but also make sure to insert any stmts produced as they
- are tracked in inserted_exprs. */
- if (! res)
- continue;
-
- new_stuff = true;
- }
-
- exprs.release ();
-
- return new_stuff;
-}
-
-/* Perform insertion of partially redundant and hoistable values. */
-
-static void
-insert (void)
-{
- basic_block bb;
-
- FOR_ALL_BB_FN (bb, cfun)
- NEW_SETS (bb) = bitmap_set_new ();
-
- int *rpo = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
- int *bb_rpo = XNEWVEC (int, last_basic_block_for_fn (cfun) + 1);
- int rpo_num = pre_and_rev_post_order_compute (NULL, rpo, false);
- for (int i = 0; i < rpo_num; ++i)
- bb_rpo[rpo[i]] = i;
-
- int num_iterations = 0;
- bool changed;
- do
- {
- num_iterations++;
- if (dump_file && dump_flags & TDF_DETAILS)
- fprintf (dump_file, "Starting insert iteration %d\n", num_iterations);
-
- changed = false;
- for (int idx = 0; idx < rpo_num; ++idx)
- {
- basic_block block = BASIC_BLOCK_FOR_FN (cfun, rpo[idx]);
- basic_block dom = get_immediate_dominator (CDI_DOMINATORS, block);
- if (dom)
- {
- unsigned i;
- bitmap_iterator bi;
- bitmap_set_t newset;
-
- /* First, update the AVAIL_OUT set with anything we may have
- inserted higher up in the dominator tree. */
- newset = NEW_SETS (dom);
-
- /* Note that we need to value_replace both NEW_SETS, and
- AVAIL_OUT. For both the case of NEW_SETS, the value may be
- represented by some non-simple expression here that we want
- to replace it with. */
- bool avail_out_changed = false;
- FOR_EACH_EXPR_ID_IN_SET (newset, i, bi)
- {
- pre_expr expr = expression_for_id (i);
- bitmap_value_replace_in_set (NEW_SETS (block), expr);
- avail_out_changed
- |= bitmap_value_replace_in_set (AVAIL_OUT (block), expr);
- }
- /* We need to iterate if AVAIL_OUT of an already processed
- block source changed. */
- if (avail_out_changed && !changed)
- {
- edge_iterator ei;
- edge e;
- FOR_EACH_EDGE (e, ei, block->succs)
- if (e->dest->index != EXIT_BLOCK
- && bb_rpo[e->dest->index] < idx)
- changed = true;
- }
-
- /* Insert expressions for partial redundancies. */
- if (flag_tree_pre && !single_pred_p (block))
- {
- vec<pre_expr> exprs
- = sorted_array_from_bitmap_set (ANTIC_IN (block));
- /* Sorting is not perfect, iterate locally. */
- while (do_pre_regular_insertion (block, dom, exprs))
- ;
- exprs.release ();
- if (do_partial_partial)
- {
- exprs = sorted_array_from_bitmap_set (PA_IN (block));
- while (do_pre_partial_partial_insertion (block, dom,
- exprs))
- ;
- exprs.release ();
- }
- }
- }
- }
-
- /* Clear the NEW sets before the next iteration. We have already
- fully propagated its contents. */
- if (changed)
- FOR_ALL_BB_FN (bb, cfun)
- bitmap_set_free (NEW_SETS (bb));
- }
- while (changed);
-
- statistics_histogram_event (cfun, "insert iterations", num_iterations);
-
- /* AVAIL_OUT is not needed after insertion so we don't have to
- propagate NEW_SETS from hoist insertion. */
- FOR_ALL_BB_FN (bb, cfun)
- {
- bitmap_set_free (NEW_SETS (bb));
- bitmap_set_pool.remove (NEW_SETS (bb));
- NEW_SETS (bb) = NULL;
- }
-
- /* Insert expressions for hoisting. Do a backward walk here since
- inserting into BLOCK exposes new opportunities in its predecessors.
- Since PRE and hoist insertions can cause back-to-back iteration
- and we are interested in PRE insertion exposed hoisting opportunities
- but not in hoisting exposed PRE ones do hoist insertion only after
- PRE insertion iteration finished and do not iterate it. */
- if (flag_code_hoisting)
- for (int idx = rpo_num - 1; idx >= 0; --idx)
- {
- basic_block block = BASIC_BLOCK_FOR_FN (cfun, rpo[idx]);
- if (EDGE_COUNT (block->succs) >= 2)
- changed |= do_hoist_insertion (block);
- }
-
- free (rpo);
- free (bb_rpo);
-}
-
-
-/* Compute the AVAIL set for all basic blocks.
-
- This function performs value numbering of the statements in each basic
- block. The AVAIL sets are built from information we glean while doing
- this value numbering, since the AVAIL sets contain only one entry per
- value.
-
- AVAIL_IN[BLOCK] = AVAIL_OUT[dom(BLOCK)].
- AVAIL_OUT[BLOCK] = AVAIL_IN[BLOCK] U PHI_GEN[BLOCK] U TMP_GEN[BLOCK]. */
-
-static void
-compute_avail (function *fun)
-{
-
- basic_block block, son;
- basic_block *worklist;
- size_t sp = 0;
- unsigned i;
- tree name;
-
- /* We pretend that default definitions are defined in the entry block.
- This includes function arguments and the static chain decl. */
- FOR_EACH_SSA_NAME (i, name, fun)
- {
- pre_expr e;
- if (!SSA_NAME_IS_DEFAULT_DEF (name)
- || has_zero_uses (name)
- || virtual_operand_p (name))
- continue;
-
- e = get_or_alloc_expr_for_name (name);
- add_to_value (get_expr_value_id (e), e);
- bitmap_insert_into_set (TMP_GEN (ENTRY_BLOCK_PTR_FOR_FN (fun)), e);
- bitmap_value_insert_into_set (AVAIL_OUT (ENTRY_BLOCK_PTR_FOR_FN (fun)),
- e);
- }
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- print_bitmap_set (dump_file, TMP_GEN (ENTRY_BLOCK_PTR_FOR_FN (fun)),
- "tmp_gen", ENTRY_BLOCK);
- print_bitmap_set (dump_file, AVAIL_OUT (ENTRY_BLOCK_PTR_FOR_FN (fun)),
- "avail_out", ENTRY_BLOCK);
- }
-
- /* Allocate the worklist. */
- worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (fun));
-
- /* Seed the algorithm by putting the dominator children of the entry
- block on the worklist. */
- for (son = first_dom_son (CDI_DOMINATORS, ENTRY_BLOCK_PTR_FOR_FN (fun));
- son;
- son = next_dom_son (CDI_DOMINATORS, son))
- worklist[sp++] = son;
-
- BB_LIVE_VOP_ON_EXIT (ENTRY_BLOCK_PTR_FOR_FN (fun))
- = ssa_default_def (fun, gimple_vop (fun));
-
- /* Loop until the worklist is empty. */
- while (sp)
- {
- gimple *stmt;
- basic_block dom;
-
- /* Pick a block from the worklist. */
- block = worklist[--sp];
- vn_context_bb = block;
-
- /* Initially, the set of available values in BLOCK is that of
- its immediate dominator. */
- dom = get_immediate_dominator (CDI_DOMINATORS, block);
- if (dom)
- {
- bitmap_set_copy (AVAIL_OUT (block), AVAIL_OUT (dom));
- BB_LIVE_VOP_ON_EXIT (block) = BB_LIVE_VOP_ON_EXIT (dom);
- }
-
- /* Generate values for PHI nodes. */
- for (gphi_iterator gsi = gsi_start_phis (block); !gsi_end_p (gsi);
- gsi_next (&gsi))
- {
- tree result = gimple_phi_result (gsi.phi ());
-
- /* We have no need for virtual phis, as they don't represent
- actual computations. */
- if (virtual_operand_p (result))
- {
- BB_LIVE_VOP_ON_EXIT (block) = result;
- continue;
- }
-
- pre_expr e = get_or_alloc_expr_for_name (result);
- add_to_value (get_expr_value_id (e), e);
- bitmap_value_insert_into_set (AVAIL_OUT (block), e);
- bitmap_insert_into_set (PHI_GEN (block), e);
- }
-
- BB_MAY_NOTRETURN (block) = 0;
-
- /* Now compute value numbers and populate value sets with all
- the expressions computed in BLOCK. */
- bool set_bb_may_notreturn = false;
- for (gimple_stmt_iterator gsi = gsi_start_bb (block); !gsi_end_p (gsi);
- gsi_next (&gsi))
- {
- ssa_op_iter iter;
- tree op;
-
- stmt = gsi_stmt (gsi);
-
- if (set_bb_may_notreturn)
- {
- BB_MAY_NOTRETURN (block) = 1;
- set_bb_may_notreturn = false;
- }
-
- /* Cache whether the basic-block has any non-visible side-effect
- or control flow.
- If this isn't a call or it is the last stmt in the
- basic-block then the CFG represents things correctly. */
- if (is_gimple_call (stmt) && !stmt_ends_bb_p (stmt))
- {
- /* Non-looping const functions always return normally.
- Otherwise the call might not return or have side-effects
- that forbids hoisting possibly trapping expressions
- before it. */
- int flags = gimple_call_flags (stmt);
- if (!(flags & (ECF_CONST|ECF_PURE))
- || (flags & ECF_LOOPING_CONST_OR_PURE)
- || stmt_can_throw_external (fun, stmt))
- /* Defer setting of BB_MAY_NOTRETURN to avoid it
- influencing the processing of the call itself. */
- set_bb_may_notreturn = true;
- }
-
- FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_DEF)
- {
- pre_expr e = get_or_alloc_expr_for_name (op);
-
- add_to_value (get_expr_value_id (e), e);
- bitmap_insert_into_set (TMP_GEN (block), e);
- bitmap_value_insert_into_set (AVAIL_OUT (block), e);
- }
-
- if (gimple_vdef (stmt))
- BB_LIVE_VOP_ON_EXIT (block) = gimple_vdef (stmt);
-
- if (gimple_has_side_effects (stmt)
- || stmt_could_throw_p (fun, stmt)
- || is_gimple_debug (stmt))
- continue;
-
- FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE)
- {
- if (ssa_undefined_value_p (op))
- continue;
- pre_expr e = get_or_alloc_expr_for_name (op);
- bitmap_value_insert_into_set (EXP_GEN (block), e);
- }
-
- switch (gimple_code (stmt))
- {
- case GIMPLE_RETURN:
- continue;
-
- case GIMPLE_CALL:
- {
- vn_reference_t ref;
- vn_reference_s ref1;
- pre_expr result = NULL;
-
- vn_reference_lookup_call (as_a <gcall *> (stmt), &ref, &ref1);
- /* There is no point to PRE a call without a value. */
- if (!ref || !ref->result)
- continue;
-
- /* If the value of the call is not invalidated in
- this block until it is computed, add the expression
- to EXP_GEN. */
- if ((!gimple_vuse (stmt)
- || gimple_code
- (SSA_NAME_DEF_STMT (gimple_vuse (stmt))) == GIMPLE_PHI
- || gimple_bb (SSA_NAME_DEF_STMT
- (gimple_vuse (stmt))) != block)
- /* If the REFERENCE traps and there was a preceding
- point in the block that might not return avoid
- adding the reference to EXP_GEN. */
- && (!BB_MAY_NOTRETURN (block)
- || !vn_reference_may_trap (ref)))
- {
- result = get_or_alloc_expr_for_reference
- (ref, gimple_location (stmt));
- add_to_value (get_expr_value_id (result), result);
- bitmap_value_insert_into_set (EXP_GEN (block), result);
- }
- continue;
- }
-
- case GIMPLE_ASSIGN:
- {
- pre_expr result = NULL;
- switch (vn_get_stmt_kind (stmt))
- {
- case VN_NARY:
- {
- enum tree_code code = gimple_assign_rhs_code (stmt);
- vn_nary_op_t nary;
-
- /* COND_EXPR is awkward in that it contains an
- embedded complex expression.
- Don't even try to shove it through PRE. */
- if (code == COND_EXPR)
- continue;
-
- vn_nary_op_lookup_stmt (stmt, &nary);
- if (!nary || nary->predicated_values)
- continue;
-
- /* If the NARY traps and there was a preceding
- point in the block that might not return avoid
- adding the nary to EXP_GEN. */
- if (BB_MAY_NOTRETURN (block)
- && vn_nary_may_trap (nary))
- continue;
-
- result = get_or_alloc_expr_for_nary
- (nary, gimple_location (stmt));
- break;
- }
-
- case VN_REFERENCE:
- {
- tree rhs1 = gimple_assign_rhs1 (stmt);
- ao_ref rhs1_ref;
- ao_ref_init (&rhs1_ref, rhs1);
- alias_set_type set = ao_ref_alias_set (&rhs1_ref);
- alias_set_type base_set
- = ao_ref_base_alias_set (&rhs1_ref);
- vec<vn_reference_op_s> operands
- = vn_reference_operands_for_lookup (rhs1);
- vn_reference_t ref;
- vn_reference_lookup_pieces (gimple_vuse (stmt), set,
- base_set, TREE_TYPE (rhs1),
- operands, &ref, VN_WALK);
- if (!ref)
- {
- operands.release ();
- continue;
- }
-
- /* If the REFERENCE traps and there was a preceding
- point in the block that might not return avoid
- adding the reference to EXP_GEN. */
- if (BB_MAY_NOTRETURN (block)
- && vn_reference_may_trap (ref))
- {
- operands.release ();
- continue;
- }
-
- /* If the value of the reference is not invalidated in
- this block until it is computed, add the expression
- to EXP_GEN. */
- if (gimple_vuse (stmt))
- {
- gimple *def_stmt;
- bool ok = true;
- def_stmt = SSA_NAME_DEF_STMT (gimple_vuse (stmt));
- while (!gimple_nop_p (def_stmt)
- && gimple_code (def_stmt) != GIMPLE_PHI
- && gimple_bb (def_stmt) == block)
- {
- if (stmt_may_clobber_ref_p
- (def_stmt, gimple_assign_rhs1 (stmt)))
- {
- ok = false;
- break;
- }
- def_stmt
- = SSA_NAME_DEF_STMT (gimple_vuse (def_stmt));
- }
- if (!ok)
- {
- operands.release ();
- continue;
- }
- }
-
- /* If the load was value-numbered to another
- load make sure we do not use its expression
- for insertion if it wouldn't be a valid
- replacement. */
- /* At the momemt we have a testcase
- for hoist insertion of aligned vs. misaligned
- variants in gcc.dg/torture/pr65270-1.c thus
- with just alignment to be considered we can
- simply replace the expression in the hashtable
- with the most conservative one. */
- vn_reference_op_t ref1 = &ref->operands.last ();
- while (ref1->opcode != TARGET_MEM_REF
- && ref1->opcode != MEM_REF
- && ref1 != &ref->operands[0])
- --ref1;
- vn_reference_op_t ref2 = &operands.last ();
- while (ref2->opcode != TARGET_MEM_REF
- && ref2->opcode != MEM_REF
- && ref2 != &operands[0])
- --ref2;
- if ((ref1->opcode == TARGET_MEM_REF
- || ref1->opcode == MEM_REF)
- && (TYPE_ALIGN (ref1->type)
- > TYPE_ALIGN (ref2->type)))
- ref1->type
- = build_aligned_type (ref1->type,
- TYPE_ALIGN (ref2->type));
- /* TBAA behavior is an obvious part so make sure
- that the hashtable one covers this as well
- by adjusting the ref alias set and its base. */
- if (ref->set == set
- || alias_set_subset_of (set, ref->set))
- ;
- else if (ref1->opcode != ref2->opcode
- || (ref1->opcode != MEM_REF
- && ref1->opcode != TARGET_MEM_REF))
- {
- /* With mismatching base opcodes or bases
- other than MEM_REF or TARGET_MEM_REF we
- can't do any easy TBAA adjustment. */
- operands.release ();
- continue;
- }
- else if (alias_set_subset_of (ref->set, set))
- {
- ref->set = set;
- if (ref1->opcode == MEM_REF)
- ref1->op0
- = wide_int_to_tree (TREE_TYPE (ref2->op0),
- wi::to_wide (ref1->op0));
- else
- ref1->op2
- = wide_int_to_tree (TREE_TYPE (ref2->op2),
- wi::to_wide (ref1->op2));
- }
- else
- {
- ref->set = 0;
- if (ref1->opcode == MEM_REF)
- ref1->op0
- = wide_int_to_tree (ptr_type_node,
- wi::to_wide (ref1->op0));
- else
- ref1->op2
- = wide_int_to_tree (ptr_type_node,
- wi::to_wide (ref1->op2));
- }
- operands.release ();
-
- result = get_or_alloc_expr_for_reference
- (ref, gimple_location (stmt));
- break;
- }
-
- default:
- continue;
- }
-
- add_to_value (get_expr_value_id (result), result);
- bitmap_value_insert_into_set (EXP_GEN (block), result);
- continue;
- }
- default:
- break;
- }
- }
- if (set_bb_may_notreturn)
- {
- BB_MAY_NOTRETURN (block) = 1;
- set_bb_may_notreturn = false;
- }
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- print_bitmap_set (dump_file, EXP_GEN (block),
- "exp_gen", block->index);
- print_bitmap_set (dump_file, PHI_GEN (block),
- "phi_gen", block->index);
- print_bitmap_set (dump_file, TMP_GEN (block),
- "tmp_gen", block->index);
- print_bitmap_set (dump_file, AVAIL_OUT (block),
- "avail_out", block->index);
- }
-
- /* Put the dominator children of BLOCK on the worklist of blocks
- to compute available sets for. */
- for (son = first_dom_son (CDI_DOMINATORS, block);
- son;
- son = next_dom_son (CDI_DOMINATORS, son))
- worklist[sp++] = son;
- }
- vn_context_bb = NULL;
-
- free (worklist);
-}
-
-
-/* Initialize data structures used by PRE. */
-
-static void
-init_pre (void)
-{
- basic_block bb;
-
- next_expression_id = 1;
- expressions.create (0);
- expressions.safe_push (NULL);
- value_expressions.create (get_max_value_id () + 1);
- value_expressions.quick_grow_cleared (get_max_value_id () + 1);
- constant_value_expressions.create (get_max_constant_value_id () + 1);
- constant_value_expressions.quick_grow_cleared (get_max_constant_value_id () + 1);
- name_to_id.create (0);
-
- inserted_exprs = BITMAP_ALLOC (NULL);
-
- connect_infinite_loops_to_exit ();
- memset (&pre_stats, 0, sizeof (pre_stats));
-
- alloc_aux_for_blocks (sizeof (struct bb_bitmap_sets));
-
- calculate_dominance_info (CDI_DOMINATORS);
-
- bitmap_obstack_initialize (&grand_bitmap_obstack);
- expression_to_id = new hash_table<pre_expr_d> (num_ssa_names * 3);
- FOR_ALL_BB_FN (bb, cfun)
- {
- EXP_GEN (bb) = bitmap_set_new ();
- PHI_GEN (bb) = bitmap_set_new ();
- TMP_GEN (bb) = bitmap_set_new ();
- AVAIL_OUT (bb) = bitmap_set_new ();
- PHI_TRANS_TABLE (bb) = NULL;
- }
-}
-
-
-/* Deallocate data structures used by PRE. */
-
-static void
-fini_pre ()
-{
- value_expressions.release ();
- constant_value_expressions.release ();
- expressions.release ();
- bitmap_obstack_release (&grand_bitmap_obstack);
- bitmap_set_pool.release ();
- pre_expr_pool.release ();
- delete expression_to_id;
- expression_to_id = NULL;
- name_to_id.release ();
-
- basic_block bb;
- FOR_ALL_BB_FN (bb, cfun)
- if (bb->aux && PHI_TRANS_TABLE (bb))
- delete PHI_TRANS_TABLE (bb);
- free_aux_for_blocks ();
-}
-
-namespace {
-
-const pass_data pass_data_pre =
-{
- GIMPLE_PASS, /* type */
- "pre", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_TREE_PRE, /* tv_id */
- ( PROP_cfg | PROP_ssa ), /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- TODO_rebuild_alias, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_pre : public gimple_opt_pass
-{
-public:
- pass_pre (gcc::context *ctxt)
- : gimple_opt_pass (pass_data_pre, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual bool gate (function *)
- { return flag_tree_pre != 0 || flag_code_hoisting != 0; }
- virtual unsigned int execute (function *);
-
-}; // class pass_pre
-
-/* Valueization hook for RPO VN when we are calling back to it
- at ANTIC compute time. */
-
-static tree
-pre_valueize (tree name)
-{
- if (TREE_CODE (name) == SSA_NAME)
- {
- tree tem = VN_INFO (name)->valnum;
- if (tem != VN_TOP && tem != name)
- {
- if (TREE_CODE (tem) != SSA_NAME
- || SSA_NAME_IS_DEFAULT_DEF (tem))
- return tem;
- /* We create temporary SSA names for representatives that
- do not have a definition (yet) but are not default defs either
- assume they are fine to use. */
- basic_block def_bb = gimple_bb (SSA_NAME_DEF_STMT (tem));
- if (! def_bb
- || dominated_by_p (CDI_DOMINATORS, vn_context_bb, def_bb))
- return tem;
- /* ??? Now we could look for a leader. Ideally we'd somehow
- expose RPO VN leaders and get rid of AVAIL_OUT as well... */
- }
- }
- return name;
-}
-
-unsigned int
-pass_pre::execute (function *fun)
-{
- unsigned int todo = 0;
-
- do_partial_partial =
- flag_tree_partial_pre && optimize_function_for_speed_p (fun);
-
- /* This has to happen before VN runs because
- loop_optimizer_init may create new phis, etc. */
- loop_optimizer_init (LOOPS_NORMAL);
- split_edges_for_insertion ();
- scev_initialize ();
- calculate_dominance_info (CDI_DOMINATORS);
-
- run_rpo_vn (VN_WALK);
-
- init_pre ();
-
- vn_valueize = pre_valueize;
-
- /* Insert can get quite slow on an incredibly large number of basic
- blocks due to some quadratic behavior. Until this behavior is
- fixed, don't run it when he have an incredibly large number of
- bb's. If we aren't going to run insert, there is no point in
- computing ANTIC, either, even though it's plenty fast nor do
- we require AVAIL. */
- if (n_basic_blocks_for_fn (fun) < 4000)
- {
- compute_avail (fun);
- compute_antic ();
- insert ();
- }
-
- /* Make sure to remove fake edges before committing our inserts.
- This makes sure we don't end up with extra critical edges that
- we would need to split. */
- remove_fake_exit_edges ();
- gsi_commit_edge_inserts ();
-
- /* Eliminate folds statements which might (should not...) end up
- not keeping virtual operands up-to-date. */
- gcc_assert (!need_ssa_update_p (fun));
-
- statistics_counter_event (fun, "Insertions", pre_stats.insertions);
- statistics_counter_event (fun, "PA inserted", pre_stats.pa_insert);
- statistics_counter_event (fun, "HOIST inserted", pre_stats.hoist_insert);
- statistics_counter_event (fun, "New PHIs", pre_stats.phis);
-
- todo |= eliminate_with_rpo_vn (inserted_exprs);
-
- vn_valueize = NULL;
-
- fini_pre ();
-
- scev_finalize ();
- loop_optimizer_finalize ();
-
- /* Perform a CFG cleanup before we run simple_dce_from_worklist since
- unreachable code regions will have not up-to-date SSA form which
- confuses it. */
- bool need_crit_edge_split = false;
- if (todo & TODO_cleanup_cfg)
- {
- cleanup_tree_cfg ();
- need_crit_edge_split = true;
- }
-
- /* Because we don't follow exactly the standard PRE algorithm, and decide not
- to insert PHI nodes sometimes, and because value numbering of casts isn't
- perfect, we sometimes end up inserting dead code. This simple DCE-like
- pass removes any insertions we made that weren't actually used. */
- simple_dce_from_worklist (inserted_exprs);
- BITMAP_FREE (inserted_exprs);
-
- /* TODO: tail_merge_optimize may merge all predecessors of a block, in which
- case we can merge the block with the remaining predecessor of the block.
- It should either:
- - call merge_blocks after each tail merge iteration
- - call merge_blocks after all tail merge iterations
- - mark TODO_cleanup_cfg when necessary. */
- todo |= tail_merge_optimize (need_crit_edge_split);
-
- free_rpo_vn ();
-
- /* Tail merging invalidates the virtual SSA web, together with
- cfg-cleanup opportunities exposed by PRE this will wreck the
- SSA updating machinery. So make sure to run update-ssa
- manually, before eventually scheduling cfg-cleanup as part of
- the todo. */
- update_ssa (TODO_update_ssa_only_virtuals);
-
- return todo;
-}
-
-} // anon namespace
-
-gimple_opt_pass *
-make_pass_pre (gcc::context *ctxt)
-{
- return new pass_pre (ctxt);
-}
generated by cgit v1.1 at 2025-09-07 19:32:06 +0000