aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-ssa-loop-ivcanon.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-loop-ivcanon.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-loop-ivcanon.c')
-rw-r--r--gcc/tree-ssa-loop-ivcanon.c1677
1 files changed, 0 insertions, 1677 deletions
diff --git a/gcc/tree-ssa-loop-ivcanon.c b/gcc/tree-ssa-loop-ivcanon.c
deleted file mode 100644
index e2ac204..0000000
--- a/gcc/tree-ssa-loop-ivcanon.c
+++ /dev/null
@@ -1,1677 +0,0 @@
-/* Induction variable canonicalization and loop peeling.
- Copyright (C) 2004-2022 Free Software Foundation, Inc.
-
-This file is part of GCC.
-
-GCC is free software; you can redistribute it and/or modify it
-under the terms of the GNU General Public License as published by the
-Free Software Foundation; either version 3, or (at your option) any
-later version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-/* This pass detects the loops that iterate a constant number of times,
- adds a canonical induction variable (step -1, tested against 0)
- and replaces the exit test. This enables the less powerful rtl
- level analysis to use this information.
-
- This might spoil the code in some cases (by increasing register pressure).
- Note that in the case the new variable is not needed, ivopts will get rid
- of it, so it might only be a problem when there are no other linear induction
- variables. In that case the created optimization possibilities are likely
- to pay up.
-
- We also perform
- - complete unrolling (or peeling) when the loops is rolling few enough
- times
- - simple peeling (i.e. copying few initial iterations prior the loop)
- when number of iteration estimate is known (typically by the profile
- info). */
-
-#include "config.h"
-#include "system.h"
-#include "coretypes.h"
-#include "backend.h"
-#include "tree.h"
-#include "gimple.h"
-#include "cfghooks.h"
-#include "tree-pass.h"
-#include "ssa.h"
-#include "cgraph.h"
-#include "gimple-pretty-print.h"
-#include "fold-const.h"
-#include "profile.h"
-#include "gimple-fold.h"
-#include "tree-eh.h"
-#include "gimple-iterator.h"
-#include "tree-cfg.h"
-#include "tree-ssa-loop-manip.h"
-#include "tree-ssa-loop-niter.h"
-#include "tree-ssa-loop.h"
-#include "tree-into-ssa.h"
-#include "cfgloop.h"
-#include "tree-chrec.h"
-#include "tree-scalar-evolution.h"
-#include "tree-inline.h"
-#include "tree-cfgcleanup.h"
-#include "builtins.h"
-#include "tree-ssa-sccvn.h"
-#include "dbgcnt.h"
-
-/* Specifies types of loops that may be unrolled. */
-
-enum unroll_level
-{
- UL_SINGLE_ITER, /* Only loops that exit immediately in the first
- iteration. */
- UL_NO_GROWTH, /* Only loops whose unrolling will not cause increase
- of code size. */
- UL_ALL /* All suitable loops. */
-};
-
-/* Adds a canonical induction variable to LOOP iterating NITER times. EXIT
- is the exit edge whose condition is replaced. The ssa versions of the new
- IV before and after increment will be stored in VAR_BEFORE and VAR_AFTER
- if they are not NULL. */
-
-void
-create_canonical_iv (class loop *loop, edge exit, tree niter,
- tree *var_before = NULL, tree *var_after = NULL)
-{
- edge in;
- tree type, var;
- gcond *cond;
- gimple_stmt_iterator incr_at;
- enum tree_code cmp;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Added canonical iv to loop %d, ", loop->num);
- print_generic_expr (dump_file, niter, TDF_SLIM);
- fprintf (dump_file, " iterations.\n");
- }
-
- cond = as_a <gcond *> (last_stmt (exit->src));
- in = EDGE_SUCC (exit->src, 0);
- if (in == exit)
- in = EDGE_SUCC (exit->src, 1);
-
- /* Note that we do not need to worry about overflows, since
- type of niter is always unsigned and all comparisons are
- just for equality/nonequality -- i.e. everything works
- with a modulo arithmetics. */
-
- type = TREE_TYPE (niter);
- niter = fold_build2 (PLUS_EXPR, type,
- niter,
- build_int_cst (type, 1));
- incr_at = gsi_last_bb (in->src);
- create_iv (niter,
- build_int_cst (type, -1),
- NULL_TREE, loop,
- &incr_at, false, var_before, &var);
- if (var_after)
- *var_after = var;
-
- cmp = (exit->flags & EDGE_TRUE_VALUE) ? EQ_EXPR : NE_EXPR;
- gimple_cond_set_code (cond, cmp);
- gimple_cond_set_lhs (cond, var);
- gimple_cond_set_rhs (cond, build_int_cst (type, 0));
- update_stmt (cond);
-}
-
-/* Describe size of loop as detected by tree_estimate_loop_size. */
-struct loop_size
-{
- /* Number of instructions in the loop. */
- int overall;
-
- /* Number of instructions that will be likely optimized out in
- peeled iterations of loop (i.e. computation based on induction
- variable where induction variable starts at known constant.) */
- int eliminated_by_peeling;
-
- /* Same statistics for last iteration of loop: it is smaller because
- instructions after exit are not executed. */
- int last_iteration;
- int last_iteration_eliminated_by_peeling;
-
- /* If some IV computation will become constant. */
- bool constant_iv;
-
- /* Number of call stmts that are not a builtin and are pure or const
- present on the hot path. */
- int num_pure_calls_on_hot_path;
- /* Number of call stmts that are not a builtin and are not pure nor const
- present on the hot path. */
- int num_non_pure_calls_on_hot_path;
- /* Number of statements other than calls in the loop. */
- int non_call_stmts_on_hot_path;
- /* Number of branches seen on the hot path. */
- int num_branches_on_hot_path;
-};
-
-/* Return true if OP in STMT will be constant after peeling LOOP. */
-
-static bool
-constant_after_peeling (tree op, gimple *stmt, class loop *loop)
-{
- if (CONSTANT_CLASS_P (op))
- return true;
-
- /* We can still fold accesses to constant arrays when index is known. */
- if (TREE_CODE (op) != SSA_NAME)
- {
- tree base = op;
-
- /* First make fast look if we see constant array inside. */
- while (handled_component_p (base))
- base = TREE_OPERAND (base, 0);
- if ((DECL_P (base)
- && ctor_for_folding (base) != error_mark_node)
- || CONSTANT_CLASS_P (base))
- {
- /* If so, see if we understand all the indices. */
- base = op;
- while (handled_component_p (base))
- {
- if (TREE_CODE (base) == ARRAY_REF
- && !constant_after_peeling (TREE_OPERAND (base, 1), stmt, loop))
- return false;
- base = TREE_OPERAND (base, 0);
- }
- return true;
- }
- return false;
- }
-
- /* Induction variables are constants when defined in loop. */
- if (loop_containing_stmt (stmt) != loop)
- return false;
- tree ev = analyze_scalar_evolution (loop, op);
- if (chrec_contains_undetermined (ev)
- || chrec_contains_symbols (ev))
- return false;
- return true;
-}
-
-/* Computes an estimated number of insns in LOOP.
- EXIT (if non-NULL) is an exite edge that will be eliminated in all but last
- iteration of the loop.
- EDGE_TO_CANCEL (if non-NULL) is an non-exit edge eliminated in the last iteration
- of loop.
- Return results in SIZE, estimate benefits for complete unrolling exiting by EXIT.
- Stop estimating after UPPER_BOUND is met. Return true in this case. */
-
-static bool
-tree_estimate_loop_size (class loop *loop, edge exit, edge edge_to_cancel,
- struct loop_size *size, int upper_bound)
-{
- basic_block *body = get_loop_body (loop);
- gimple_stmt_iterator gsi;
- unsigned int i;
- bool after_exit;
- auto_vec<basic_block> path = get_loop_hot_path (loop);
-
- size->overall = 0;
- size->eliminated_by_peeling = 0;
- size->last_iteration = 0;
- size->last_iteration_eliminated_by_peeling = 0;
- size->num_pure_calls_on_hot_path = 0;
- size->num_non_pure_calls_on_hot_path = 0;
- size->non_call_stmts_on_hot_path = 0;
- size->num_branches_on_hot_path = 0;
- size->constant_iv = 0;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Estimating sizes for loop %i\n", loop->num);
- for (i = 0; i < loop->num_nodes; i++)
- {
- if (edge_to_cancel && body[i] != edge_to_cancel->src
- && dominated_by_p (CDI_DOMINATORS, body[i], edge_to_cancel->src))
- after_exit = true;
- else
- after_exit = false;
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, " BB: %i, after_exit: %i\n", body[i]->index,
- after_exit);
-
- for (gsi = gsi_start_bb (body[i]); !gsi_end_p (gsi); gsi_next (&gsi))
- {
- gimple *stmt = gsi_stmt (gsi);
- int num = estimate_num_insns (stmt, &eni_size_weights);
- bool likely_eliminated = false;
- bool likely_eliminated_last = false;
- bool likely_eliminated_peeled = false;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, " size: %3i ", num);
- print_gimple_stmt (dump_file, gsi_stmt (gsi), 0);
- }
-
- /* Look for reasons why we might optimize this stmt away. */
-
- if (!gimple_has_side_effects (stmt))
- {
- /* Exit conditional. */
- if (exit && body[i] == exit->src
- && stmt == last_stmt (exit->src))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, " Exit condition will be eliminated "
- "in peeled copies.\n");
- likely_eliminated_peeled = true;
- }
- if (edge_to_cancel && body[i] == edge_to_cancel->src
- && stmt == last_stmt (edge_to_cancel->src))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, " Exit condition will be eliminated "
- "in last copy.\n");
- likely_eliminated_last = true;
- }
- /* Sets of IV variables */
- if (gimple_code (stmt) == GIMPLE_ASSIGN
- && constant_after_peeling (gimple_assign_lhs (stmt), stmt, loop))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, " Induction variable computation will"
- " be folded away.\n");
- likely_eliminated = true;
- }
- /* Assignments of IV variables. */
- else if (gimple_code (stmt) == GIMPLE_ASSIGN
- && TREE_CODE (gimple_assign_lhs (stmt)) == SSA_NAME
- && constant_after_peeling (gimple_assign_rhs1 (stmt),
- stmt, loop)
- && (gimple_assign_rhs_class (stmt) != GIMPLE_BINARY_RHS
- || constant_after_peeling (gimple_assign_rhs2 (stmt),
- stmt, loop))
- && gimple_assign_rhs_class (stmt) != GIMPLE_TERNARY_RHS)
- {
- size->constant_iv = true;
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file,
- " Constant expression will be folded away.\n");
- likely_eliminated = true;
- }
- /* Conditionals. */
- else if ((gimple_code (stmt) == GIMPLE_COND
- && constant_after_peeling (gimple_cond_lhs (stmt), stmt,
- loop)
- && constant_after_peeling (gimple_cond_rhs (stmt), stmt,
- loop)
- /* We don't simplify all constant compares so make sure
- they are not both constant already. See PR70288. */
- && (! is_gimple_min_invariant (gimple_cond_lhs (stmt))
- || ! is_gimple_min_invariant
- (gimple_cond_rhs (stmt))))
- || (gimple_code (stmt) == GIMPLE_SWITCH
- && constant_after_peeling (gimple_switch_index (
- as_a <gswitch *>
- (stmt)),
- stmt, loop)
- && ! is_gimple_min_invariant
- (gimple_switch_index
- (as_a <gswitch *> (stmt)))))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, " Constant conditional.\n");
- likely_eliminated = true;
- }
- }
-
- size->overall += num;
- if (likely_eliminated || likely_eliminated_peeled)
- size->eliminated_by_peeling += num;
- if (!after_exit)
- {
- size->last_iteration += num;
- if (likely_eliminated || likely_eliminated_last)
- size->last_iteration_eliminated_by_peeling += num;
- }
- if ((size->overall * 3 / 2 - size->eliminated_by_peeling
- - size->last_iteration_eliminated_by_peeling) > upper_bound)
- {
- free (body);
- return true;
- }
- }
- }
- while (path.length ())
- {
- basic_block bb = path.pop ();
- for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
- {
- gimple *stmt = gsi_stmt (gsi);
- if (gimple_code (stmt) == GIMPLE_CALL
- && !gimple_inexpensive_call_p (as_a <gcall *> (stmt)))
- {
- int flags = gimple_call_flags (stmt);
- if (flags & (ECF_PURE | ECF_CONST))
- size->num_pure_calls_on_hot_path++;
- else
- size->num_non_pure_calls_on_hot_path++;
- size->num_branches_on_hot_path ++;
- }
- /* Count inexpensive calls as non-calls, because they will likely
- expand inline. */
- else if (gimple_code (stmt) != GIMPLE_DEBUG)
- size->non_call_stmts_on_hot_path++;
- if (((gimple_code (stmt) == GIMPLE_COND
- && (!constant_after_peeling (gimple_cond_lhs (stmt), stmt, loop)
- || !constant_after_peeling (gimple_cond_rhs (stmt), stmt,
- loop)))
- || (gimple_code (stmt) == GIMPLE_SWITCH
- && !constant_after_peeling (gimple_switch_index (
- as_a <gswitch *> (stmt)),
- stmt, loop)))
- && (!exit || bb != exit->src))
- size->num_branches_on_hot_path++;
- }
- }
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "size: %i-%i, last_iteration: %i-%i\n", size->overall,
- size->eliminated_by_peeling, size->last_iteration,
- size->last_iteration_eliminated_by_peeling);
-
- free (body);
- return false;
-}
-
-/* Estimate number of insns of completely unrolled loop.
- It is (NUNROLL + 1) * size of loop body with taking into account
- the fact that in last copy everything after exit conditional
- is dead and that some instructions will be eliminated after
- peeling.
-
- Loop body is likely going to simplify further, this is difficult
- to guess, we just decrease the result by 1/3. */
-
-static unsigned HOST_WIDE_INT
-estimated_unrolled_size (struct loop_size *size,
- unsigned HOST_WIDE_INT nunroll)
-{
- HOST_WIDE_INT unr_insns = ((nunroll)
- * (HOST_WIDE_INT) (size->overall
- - size->eliminated_by_peeling));
- if (!nunroll)
- unr_insns = 0;
- unr_insns += size->last_iteration - size->last_iteration_eliminated_by_peeling;
-
- unr_insns = unr_insns * 2 / 3;
- if (unr_insns <= 0)
- unr_insns = 1;
-
- return unr_insns;
-}
-
-/* Loop LOOP is known to not loop. See if there is an edge in the loop
- body that can be remove to make the loop to always exit and at
- the same time it does not make any code potentially executed
- during the last iteration dead.
-
- After complete unrolling we still may get rid of the conditional
- on the exit in the last copy even if we have no idea what it does.
- This is quite common case for loops of form
-
- int a[5];
- for (i=0;i<b;i++)
- a[i]=0;
-
- Here we prove the loop to iterate 5 times but we do not know
- it from induction variable.
-
- For now we handle only simple case where there is exit condition
- just before the latch block and the latch block contains no statements
- with side effect that may otherwise terminate the execution of loop
- (such as by EH or by terminating the program or longjmp).
-
- In the general case we may want to cancel the paths leading to statements
- loop-niter identified as having undefined effect in the last iteration.
- The other cases are hopefully rare and will be cleaned up later. */
-
-static edge
-loop_edge_to_cancel (class loop *loop)
-{
- unsigned i;
- edge edge_to_cancel;
- gimple_stmt_iterator gsi;
-
- /* We want only one predecestor of the loop. */
- if (EDGE_COUNT (loop->latch->preds) > 1)
- return NULL;
-
- auto_vec<edge> exits = get_loop_exit_edges (loop);
-
- FOR_EACH_VEC_ELT (exits, i, edge_to_cancel)
- {
- /* Find the other edge than the loop exit
- leaving the conditoinal. */
- if (EDGE_COUNT (edge_to_cancel->src->succs) != 2)
- continue;
- if (EDGE_SUCC (edge_to_cancel->src, 0) == edge_to_cancel)
- edge_to_cancel = EDGE_SUCC (edge_to_cancel->src, 1);
- else
- edge_to_cancel = EDGE_SUCC (edge_to_cancel->src, 0);
-
- /* We only can handle conditionals. */
- if (!(edge_to_cancel->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
- continue;
-
- /* We should never have conditionals in the loop latch. */
- gcc_assert (edge_to_cancel->dest != loop->header);
-
- /* Check that it leads to loop latch. */
- if (edge_to_cancel->dest != loop->latch)
- continue;
-
- /* Verify that the code in loop latch does nothing that may end program
- execution without really reaching the exit. This may include
- non-pure/const function calls, EH statements, volatile ASMs etc. */
- for (gsi = gsi_start_bb (loop->latch); !gsi_end_p (gsi); gsi_next (&gsi))
- if (gimple_has_side_effects (gsi_stmt (gsi)))
- return NULL;
- return edge_to_cancel;
- }
- return NULL;
-}
-
-/* Remove all tests for exits that are known to be taken after LOOP was
- peeled NPEELED times. Put gcc_unreachable before every statement
- known to not be executed. */
-
-static bool
-remove_exits_and_undefined_stmts (class loop *loop, unsigned int npeeled)
-{
- class nb_iter_bound *elt;
- bool changed = false;
-
- for (elt = loop->bounds; elt; elt = elt->next)
- {
- /* If statement is known to be undefined after peeling, turn it
- into unreachable (or trap when debugging experience is supposed
- to be good). */
- if (!elt->is_exit
- && wi::ltu_p (elt->bound, npeeled))
- {
- gimple_stmt_iterator gsi = gsi_for_stmt (elt->stmt);
- gcall *stmt = gimple_build_call
- (builtin_decl_implicit (BUILT_IN_UNREACHABLE), 0);
- gimple_set_location (stmt, gimple_location (elt->stmt));
- gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
- split_block (gimple_bb (stmt), stmt);
- changed = true;
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Forced statement unreachable: ");
- print_gimple_stmt (dump_file, elt->stmt, 0);
- }
- }
- /* If we know the exit will be taken after peeling, update. */
- else if (elt->is_exit
- && wi::leu_p (elt->bound, npeeled))
- {
- basic_block bb = gimple_bb (elt->stmt);
- edge exit_edge = EDGE_SUCC (bb, 0);
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Forced exit to be taken: ");
- print_gimple_stmt (dump_file, elt->stmt, 0);
- }
- if (!loop_exit_edge_p (loop, exit_edge))
- exit_edge = EDGE_SUCC (bb, 1);
- exit_edge->probability = profile_probability::always ();
- gcc_checking_assert (loop_exit_edge_p (loop, exit_edge));
- gcond *cond_stmt = as_a <gcond *> (elt->stmt);
- if (exit_edge->flags & EDGE_TRUE_VALUE)
- gimple_cond_make_true (cond_stmt);
- else
- gimple_cond_make_false (cond_stmt);
- update_stmt (cond_stmt);
- changed = true;
- }
- }
- return changed;
-}
-
-/* Remove all exits that are known to be never taken because of the loop bound
- discovered. */
-
-static bool
-remove_redundant_iv_tests (class loop *loop)
-{
- class nb_iter_bound *elt;
- bool changed = false;
-
- if (!loop->any_upper_bound)
- return false;
- for (elt = loop->bounds; elt; elt = elt->next)
- {
- /* Exit is pointless if it won't be taken before loop reaches
- upper bound. */
- if (elt->is_exit && loop->any_upper_bound
- && wi::ltu_p (loop->nb_iterations_upper_bound, elt->bound))
- {
- basic_block bb = gimple_bb (elt->stmt);
- edge exit_edge = EDGE_SUCC (bb, 0);
- class tree_niter_desc niter;
-
- if (!loop_exit_edge_p (loop, exit_edge))
- exit_edge = EDGE_SUCC (bb, 1);
-
- /* Only when we know the actual number of iterations, not
- just a bound, we can remove the exit. */
- if (!number_of_iterations_exit (loop, exit_edge,
- &niter, false, false)
- || !integer_onep (niter.assumptions)
- || !integer_zerop (niter.may_be_zero)
- || !niter.niter
- || TREE_CODE (niter.niter) != INTEGER_CST
- || !wi::ltu_p (loop->nb_iterations_upper_bound,
- wi::to_widest (niter.niter)))
- continue;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Removed pointless exit: ");
- print_gimple_stmt (dump_file, elt->stmt, 0);
- }
- gcond *cond_stmt = as_a <gcond *> (elt->stmt);
- if (exit_edge->flags & EDGE_TRUE_VALUE)
- gimple_cond_make_false (cond_stmt);
- else
- gimple_cond_make_true (cond_stmt);
- update_stmt (cond_stmt);
- changed = true;
- }
- }
- return changed;
-}
-
-/* Stores loops that will be unlooped and edges that will be removed
- after we process whole loop tree. */
-static vec<loop_p> loops_to_unloop;
-static vec<int> loops_to_unloop_nunroll;
-static vec<edge> edges_to_remove;
-/* Stores loops that has been peeled. */
-static bitmap peeled_loops;
-
-/* Cancel all fully unrolled loops by putting __builtin_unreachable
- on the latch edge.
- We do it after all unrolling since unlooping moves basic blocks
- across loop boundaries trashing loop closed SSA form as well
- as SCEV info needed to be intact during unrolling.
-
- IRRED_INVALIDATED is used to bookkeep if information about
- irreducible regions may become invalid as a result
- of the transformation.
- LOOP_CLOSED_SSA_INVALIDATED is used to bookkepp the case
- when we need to go into loop closed SSA form. */
-
-static void
-unloop_loops (bitmap loop_closed_ssa_invalidated,
- bool *irred_invalidated)
-{
- while (loops_to_unloop.length ())
- {
- class loop *loop = loops_to_unloop.pop ();
- int n_unroll = loops_to_unloop_nunroll.pop ();
- basic_block latch = loop->latch;
- edge latch_edge = loop_latch_edge (loop);
- int flags = latch_edge->flags;
- location_t locus = latch_edge->goto_locus;
- gcall *stmt;
- gimple_stmt_iterator gsi;
-
- remove_exits_and_undefined_stmts (loop, n_unroll);
-
- /* Unloop destroys the latch edge. */
- unloop (loop, irred_invalidated, loop_closed_ssa_invalidated);
-
- /* Create new basic block for the latch edge destination and wire
- it in. */
- stmt = gimple_build_call (builtin_decl_implicit (BUILT_IN_UNREACHABLE), 0);
- latch_edge = make_edge (latch, create_basic_block (NULL, NULL, latch), flags);
- latch_edge->probability = profile_probability::never ();
- latch_edge->flags |= flags;
- latch_edge->goto_locus = locus;
-
- add_bb_to_loop (latch_edge->dest, current_loops->tree_root);
- latch_edge->dest->count = profile_count::zero ();
- set_immediate_dominator (CDI_DOMINATORS, latch_edge->dest, latch_edge->src);
-
- gsi = gsi_start_bb (latch_edge->dest);
- gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
- }
- loops_to_unloop.release ();
- loops_to_unloop_nunroll.release ();
-
- /* Remove edges in peeled copies. Given remove_path removes dominated
- regions we need to cope with removal of already removed paths. */
- unsigned i;
- edge e;
- auto_vec<int, 20> src_bbs;
- src_bbs.reserve_exact (edges_to_remove.length ());
- FOR_EACH_VEC_ELT (edges_to_remove, i, e)
- src_bbs.quick_push (e->src->index);
- FOR_EACH_VEC_ELT (edges_to_remove, i, e)
- if (BASIC_BLOCK_FOR_FN (cfun, src_bbs[i]))
- {
- bool ok = remove_path (e, irred_invalidated,
- loop_closed_ssa_invalidated);
- gcc_assert (ok);
- }
- edges_to_remove.release ();
-}
-
-/* Tries to unroll LOOP completely, i.e. NITER times.
- UL determines which loops we are allowed to unroll.
- EXIT is the exit of the loop that should be eliminated.
- MAXITER specfy bound on number of iterations, -1 if it is
- not known or too large for HOST_WIDE_INT. The location
- LOCUS corresponding to the loop is used when emitting
- a summary of the unroll to the dump file. */
-
-static bool
-try_unroll_loop_completely (class loop *loop,
- edge exit, tree niter, bool may_be_zero,
- enum unroll_level ul,
- HOST_WIDE_INT maxiter,
- dump_user_location_t locus, bool allow_peel)
-{
- unsigned HOST_WIDE_INT n_unroll = 0;
- bool n_unroll_found = false;
- edge edge_to_cancel = NULL;
-
- /* See if we proved number of iterations to be low constant.
-
- EXIT is an edge that will be removed in all but last iteration of
- the loop.
-
- EDGE_TO_CACNEL is an edge that will be removed from the last iteration
- of the unrolled sequence and is expected to make the final loop not
- rolling.
-
- If the number of execution of loop is determined by standard induction
- variable test, then EXIT and EDGE_TO_CANCEL are the two edges leaving
- from the iv test. */
- if (tree_fits_uhwi_p (niter))
- {
- n_unroll = tree_to_uhwi (niter);
- n_unroll_found = true;
- edge_to_cancel = EDGE_SUCC (exit->src, 0);
- if (edge_to_cancel == exit)
- edge_to_cancel = EDGE_SUCC (exit->src, 1);
- }
- /* We do not know the number of iterations and thus we cannot eliminate
- the EXIT edge. */
- else
- exit = NULL;
-
- /* See if we can improve our estimate by using recorded loop bounds. */
- if ((maxiter == 0 || ul != UL_SINGLE_ITER)
- && maxiter >= 0
- && (!n_unroll_found || (unsigned HOST_WIDE_INT)maxiter < n_unroll))
- {
- n_unroll = maxiter;
- n_unroll_found = true;
- /* Loop terminates before the IV variable test, so we cannot
- remove it in the last iteration. */
- edge_to_cancel = NULL;
- /* If we do not allow peeling and we iterate just allow cases
- that do not grow code. */
- if (!allow_peel && maxiter != 0)
- ul = UL_NO_GROWTH;
- }
-
- if (!n_unroll_found)
- return false;
-
- if (!loop->unroll
- && n_unroll > (unsigned) param_max_completely_peel_times)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Not unrolling loop %d "
- "(--param max-completely-peel-times limit reached).\n",
- loop->num);
- return false;
- }
-
- if (!edge_to_cancel)
- edge_to_cancel = loop_edge_to_cancel (loop);
-
- if (n_unroll)
- {
- if (ul == UL_SINGLE_ITER)
- return false;
-
- if (loop->unroll)
- {
- /* If the unrolling factor is too large, bail out. */
- if (n_unroll > (unsigned)loop->unroll)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file,
- "Not unrolling loop %d: "
- "user didn't want it unrolled completely.\n",
- loop->num);
- return false;
- }
- }
- else
- {
- struct loop_size size;
- /* EXIT can be removed only if we are sure it passes first N_UNROLL
- iterations. */
- bool remove_exit = (exit && niter
- && TREE_CODE (niter) == INTEGER_CST
- && wi::leu_p (n_unroll, wi::to_widest (niter)));
- bool large
- = tree_estimate_loop_size
- (loop, remove_exit ? exit : NULL, edge_to_cancel, &size,
- param_max_completely_peeled_insns);
- if (large)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Not unrolling loop %d: it is too large.\n",
- loop->num);
- return false;
- }
-
- unsigned HOST_WIDE_INT ninsns = size.overall;
- unsigned HOST_WIDE_INT unr_insns
- = estimated_unrolled_size (&size, n_unroll);
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, " Loop size: %d\n", (int) ninsns);
- fprintf (dump_file, " Estimated size after unrolling: %d\n",
- (int) unr_insns);
- }
-
- /* If the code is going to shrink, we don't need to be extra
- cautious on guessing if the unrolling is going to be
- profitable. */
- if (unr_insns
- /* If there is IV variable that will become constant, we
- save one instruction in the loop prologue we do not
- account otherwise. */
- <= ninsns + (size.constant_iv != false))
- ;
- /* We unroll only inner loops, because we do not consider it
- profitable otheriwse. We still can cancel loopback edge
- of not rolling loop; this is always a good idea. */
- else if (ul == UL_NO_GROWTH)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Not unrolling loop %d: size would grow.\n",
- loop->num);
- return false;
- }
- /* Outer loops tend to be less interesting candidates for
- complete unrolling unless we can do a lot of propagation
- into the inner loop body. For now we disable outer loop
- unrolling when the code would grow. */
- else if (loop->inner)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Not unrolling loop %d: "
- "it is not innermost and code would grow.\n",
- loop->num);
- return false;
- }
- /* If there is call on a hot path through the loop, then
- there is most probably not much to optimize. */
- else if (size.num_non_pure_calls_on_hot_path)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Not unrolling loop %d: "
- "contains call and code would grow.\n",
- loop->num);
- return false;
- }
- /* If there is pure/const call in the function, then we can
- still optimize the unrolled loop body if it contains some
- other interesting code than the calls and code storing or
- cumulating the return value. */
- else if (size.num_pure_calls_on_hot_path
- /* One IV increment, one test, one ivtmp store and
- one useful stmt. That is about minimal loop
- doing pure call. */
- && (size.non_call_stmts_on_hot_path
- <= 3 + size.num_pure_calls_on_hot_path))
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Not unrolling loop %d: "
- "contains just pure calls and code would grow.\n",
- loop->num);
- return false;
- }
- /* Complete unrolling is major win when control flow is
- removed and one big basic block is created. If the loop
- contains control flow the optimization may still be a win
- because of eliminating the loop overhead but it also may
- blow the branch predictor tables. Limit number of
- branches on the hot path through the peeled sequence. */
- else if (size.num_branches_on_hot_path * (int)n_unroll
- > param_max_peel_branches)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Not unrolling loop %d: "
- "number of branches on hot path in the unrolled "
- "sequence reaches --param max-peel-branches limit.\n",
- loop->num);
- return false;
- }
- else if (unr_insns
- > (unsigned) param_max_completely_peeled_insns)
- {
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Not unrolling loop %d: "
- "number of insns in the unrolled sequence reaches "
- "--param max-completely-peeled-insns limit.\n",
- loop->num);
- return false;
- }
- }
-
- if (!dbg_cnt (gimple_unroll))
- return false;
-
- initialize_original_copy_tables ();
- auto_sbitmap wont_exit (n_unroll + 1);
- if (exit && niter
- && TREE_CODE (niter) == INTEGER_CST
- && wi::leu_p (n_unroll, wi::to_widest (niter)))
- {
- bitmap_ones (wont_exit);
- if (wi::eq_p (wi::to_widest (niter), n_unroll)
- || edge_to_cancel)
- bitmap_clear_bit (wont_exit, 0);
- }
- else
- {
- exit = NULL;
- bitmap_clear (wont_exit);
- }
- if (may_be_zero)
- bitmap_clear_bit (wont_exit, 1);
-
- if (!gimple_duplicate_loop_body_to_header_edge (
- loop, loop_preheader_edge (loop), n_unroll, wont_exit, exit,
- &edges_to_remove,
- DLTHE_FLAG_UPDATE_FREQ | DLTHE_FLAG_COMPLETTE_PEEL))
- {
- free_original_copy_tables ();
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Failed to duplicate the loop\n");
- return false;
- }
-
- free_original_copy_tables ();
- }
-
- /* Remove the conditional from the last copy of the loop. */
- if (edge_to_cancel)
- {
- gcond *cond = as_a <gcond *> (last_stmt (edge_to_cancel->src));
- force_edge_cold (edge_to_cancel, true);
- if (edge_to_cancel->flags & EDGE_TRUE_VALUE)
- gimple_cond_make_false (cond);
- else
- gimple_cond_make_true (cond);
- update_stmt (cond);
- /* Do not remove the path, as doing so may remove outer loop and
- confuse bookkeeping code in tree_unroll_loops_completely. */
- }
-
- /* Store the loop for later unlooping and exit removal. */
- loops_to_unloop.safe_push (loop);
- loops_to_unloop_nunroll.safe_push (n_unroll);
-
- if (dump_enabled_p ())
- {
- if (!n_unroll)
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS | TDF_DETAILS, locus,
- "loop turned into non-loop; it never loops\n");
- else
- {
- dump_printf_loc (MSG_OPTIMIZED_LOCATIONS | TDF_DETAILS, locus,
- "loop with %d iterations completely unrolled",
- (int) n_unroll);
- if (loop->header->count.initialized_p ())
- dump_printf (MSG_OPTIMIZED_LOCATIONS | TDF_DETAILS,
- " (header execution count %d)",
- (int)loop->header->count.to_gcov_type ());
- dump_printf (MSG_OPTIMIZED_LOCATIONS | TDF_DETAILS, "\n");
- }
- }
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- if (exit)
- fprintf (dump_file, "Exit condition of peeled iterations was "
- "eliminated.\n");
- if (edge_to_cancel)
- fprintf (dump_file, "Last iteration exit edge was proved true.\n");
- else
- fprintf (dump_file, "Latch of last iteration was marked by "
- "__builtin_unreachable ().\n");
- }
-
- return true;
-}
-
-/* Return number of instructions after peeling. */
-static unsigned HOST_WIDE_INT
-estimated_peeled_sequence_size (struct loop_size *size,
- unsigned HOST_WIDE_INT npeel)
-{
- return MAX (npeel * (HOST_WIDE_INT) (size->overall
- - size->eliminated_by_peeling), 1);
-}
-
-/* If the loop is expected to iterate N times and is
- small enough, duplicate the loop body N+1 times before
- the loop itself. This way the hot path will never
- enter the loop.
- Parameters are the same as for try_unroll_loops_completely */
-
-static bool
-try_peel_loop (class loop *loop,
- edge exit, tree niter, bool may_be_zero,
- HOST_WIDE_INT maxiter)
-{
- HOST_WIDE_INT npeel;
- struct loop_size size;
- int peeled_size;
-
- if (!flag_peel_loops
- || param_max_peel_times <= 0
- || !peeled_loops)
- return false;
-
- if (bitmap_bit_p (peeled_loops, loop->num))
- {
- if (dump_file)
- fprintf (dump_file, "Not peeling: loop is already peeled\n");
- return false;
- }
-
- /* We don't peel loops that will be unrolled as this can duplicate a
- loop more times than the user requested. */
- if (loop->unroll)
- {
- if (dump_file)
- fprintf (dump_file, "Not peeling: user didn't want it peeled.\n");
- return false;
- }
-
- /* Peel only innermost loops.
- While the code is perfectly capable of peeling non-innermost loops,
- the heuristics would probably need some improvements. */
- if (loop->inner)
- {
- if (dump_file)
- fprintf (dump_file, "Not peeling: outer loop\n");
- return false;
- }
-
- if (!optimize_loop_for_speed_p (loop))
- {
- if (dump_file)
- fprintf (dump_file, "Not peeling: cold loop\n");
- return false;
- }
-
- /* Check if there is an estimate on the number of iterations. */
- npeel = estimated_loop_iterations_int (loop);
- if (npeel < 0)
- npeel = likely_max_loop_iterations_int (loop);
- if (npeel < 0)
- {
- if (dump_file)
- fprintf (dump_file, "Not peeling: number of iterations is not "
- "estimated\n");
- return false;
- }
- if (maxiter >= 0 && maxiter <= npeel)
- {
- if (dump_file)
- fprintf (dump_file, "Not peeling: upper bound is known so can "
- "unroll completely\n");
- return false;
- }
-
- /* We want to peel estimated number of iterations + 1 (so we never
- enter the loop on quick path). Check against PARAM_MAX_PEEL_TIMES
- and be sure to avoid overflows. */
- if (npeel > param_max_peel_times - 1)
- {
- if (dump_file)
- fprintf (dump_file, "Not peeling: rolls too much "
- "(%i + 1 > --param max-peel-times)\n", (int) npeel);
- return false;
- }
- npeel++;
-
- /* Check peeled loops size. */
- tree_estimate_loop_size (loop, exit, NULL, &size,
- param_max_peeled_insns);
- if ((peeled_size = estimated_peeled_sequence_size (&size, (int) npeel))
- > param_max_peeled_insns)
- {
- if (dump_file)
- fprintf (dump_file, "Not peeling: peeled sequence size is too large "
- "(%i insns > --param max-peel-insns)", peeled_size);
- return false;
- }
-
- if (!dbg_cnt (gimple_unroll))
- return false;
-
- /* Duplicate possibly eliminating the exits. */
- initialize_original_copy_tables ();
- auto_sbitmap wont_exit (npeel + 1);
- if (exit && niter
- && TREE_CODE (niter) == INTEGER_CST
- && wi::leu_p (npeel, wi::to_widest (niter)))
- {
- bitmap_ones (wont_exit);
- bitmap_clear_bit (wont_exit, 0);
- }
- else
- {
- exit = NULL;
- bitmap_clear (wont_exit);
- }
- if (may_be_zero)
- bitmap_clear_bit (wont_exit, 1);
- if (!gimple_duplicate_loop_body_to_header_edge (
- loop, loop_preheader_edge (loop), npeel, wont_exit, exit,
- &edges_to_remove, DLTHE_FLAG_UPDATE_FREQ))
- {
- free_original_copy_tables ();
- return false;
- }
- free_original_copy_tables ();
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, "Peeled loop %d, %i times.\n",
- loop->num, (int) npeel);
- }
- if (loop->any_estimate)
- {
- if (wi::ltu_p (npeel, loop->nb_iterations_estimate))
- loop->nb_iterations_estimate -= npeel;
- else
- loop->nb_iterations_estimate = 0;
- }
- if (loop->any_upper_bound)
- {
- if (wi::ltu_p (npeel, loop->nb_iterations_upper_bound))
- loop->nb_iterations_upper_bound -= npeel;
- else
- loop->nb_iterations_upper_bound = 0;
- }
- if (loop->any_likely_upper_bound)
- {
- if (wi::ltu_p (npeel, loop->nb_iterations_likely_upper_bound))
- loop->nb_iterations_likely_upper_bound -= npeel;
- else
- {
- loop->any_estimate = true;
- loop->nb_iterations_estimate = 0;
- loop->nb_iterations_likely_upper_bound = 0;
- }
- }
- profile_count entry_count = profile_count::zero ();
-
- edge e;
- edge_iterator ei;
- FOR_EACH_EDGE (e, ei, loop->header->preds)
- if (e->src != loop->latch)
- {
- if (e->src->count.initialized_p ())
- entry_count += e->src->count;
- gcc_assert (!flow_bb_inside_loop_p (loop, e->src));
- }
- profile_probability p;
- p = entry_count.probability_in (loop->header->count);
- scale_loop_profile (loop, p, 0);
- bitmap_set_bit (peeled_loops, loop->num);
- return true;
-}
-/* Adds a canonical induction variable to LOOP if suitable.
- CREATE_IV is true if we may create a new iv. UL determines
- which loops we are allowed to completely unroll. If TRY_EVAL is true, we try
- to determine the number of iterations of a loop by direct evaluation.
- Returns true if cfg is changed. */
-
-static bool
-canonicalize_loop_induction_variables (class loop *loop,
- bool create_iv, enum unroll_level ul,
- bool try_eval, bool allow_peel)
-{
- edge exit = NULL;
- tree niter;
- HOST_WIDE_INT maxiter;
- bool modified = false;
- dump_user_location_t locus;
- class tree_niter_desc niter_desc;
- bool may_be_zero = false;
-
- /* For unrolling allow conditional constant or zero iterations, thus
- perform loop-header copying on-the-fly. */
- exit = single_exit (loop);
- niter = chrec_dont_know;
- if (exit && number_of_iterations_exit (loop, exit, &niter_desc, false))
- {
- niter = niter_desc.niter;
- may_be_zero
- = niter_desc.may_be_zero && !integer_zerop (niter_desc.may_be_zero);
- }
- if (TREE_CODE (niter) == INTEGER_CST)
- locus = last_stmt (exit->src);
- else
- {
- /* For non-constant niter fold may_be_zero into niter again. */
- if (may_be_zero)
- {
- if (COMPARISON_CLASS_P (niter_desc.may_be_zero))
- niter = fold_build3 (COND_EXPR, TREE_TYPE (niter),
- niter_desc.may_be_zero,
- build_int_cst (TREE_TYPE (niter), 0), niter);
- else
- niter = chrec_dont_know;
- may_be_zero = false;
- }
-
- /* If the loop has more than one exit, try checking all of them
- for # of iterations determinable through scev. */
- if (!exit)
- niter = find_loop_niter (loop, &exit);
-
- /* Finally if everything else fails, try brute force evaluation. */
- if (try_eval
- && (chrec_contains_undetermined (niter)
- || TREE_CODE (niter) != INTEGER_CST))
- niter = find_loop_niter_by_eval (loop, &exit);
-
- if (exit)
- locus = last_stmt (exit->src);
-
- if (TREE_CODE (niter) != INTEGER_CST)
- exit = NULL;
- }
-
- /* We work exceptionally hard here to estimate the bound
- by find_loop_niter_by_eval. Be sure to keep it for future. */
- if (niter && TREE_CODE (niter) == INTEGER_CST)
- {
- auto_vec<edge> exits = get_loop_exit_edges (loop);
- record_niter_bound (loop, wi::to_widest (niter),
- exit == single_likely_exit (loop, exits), true);
- }
-
- /* Force re-computation of loop bounds so we can remove redundant exits. */
- maxiter = max_loop_iterations_int (loop);
-
- if (dump_file && (dump_flags & TDF_DETAILS)
- && TREE_CODE (niter) == INTEGER_CST)
- {
- fprintf (dump_file, "Loop %d iterates ", loop->num);
- print_generic_expr (dump_file, niter, TDF_SLIM);
- fprintf (dump_file, " times.\n");
- }
- if (dump_file && (dump_flags & TDF_DETAILS)
- && maxiter >= 0)
- {
- fprintf (dump_file, "Loop %d iterates at most %i times.\n", loop->num,
- (int)maxiter);
- }
- if (dump_file && (dump_flags & TDF_DETAILS)
- && likely_max_loop_iterations_int (loop) >= 0)
- {
- fprintf (dump_file, "Loop %d likely iterates at most %i times.\n",
- loop->num, (int)likely_max_loop_iterations_int (loop));
- }
-
- /* Remove exits that are known to be never taken based on loop bound.
- Needs to be called after compilation of max_loop_iterations_int that
- populates the loop bounds. */
- modified |= remove_redundant_iv_tests (loop);
-
- if (try_unroll_loop_completely (loop, exit, niter, may_be_zero, ul,
- maxiter, locus, allow_peel))
- return true;
-
- if (create_iv
- && niter && !chrec_contains_undetermined (niter)
- && exit && just_once_each_iteration_p (loop, exit->src))
- {
- tree iv_niter = niter;
- if (may_be_zero)
- {
- if (COMPARISON_CLASS_P (niter_desc.may_be_zero))
- iv_niter = fold_build3 (COND_EXPR, TREE_TYPE (iv_niter),
- niter_desc.may_be_zero,
- build_int_cst (TREE_TYPE (iv_niter), 0),
- iv_niter);
- else
- iv_niter = NULL_TREE;
- }
- if (iv_niter)
- create_canonical_iv (loop, exit, iv_niter);
- }
-
- if (ul == UL_ALL)
- modified |= try_peel_loop (loop, exit, niter, may_be_zero, maxiter);
-
- return modified;
-}
-
-/* The main entry point of the pass. Adds canonical induction variables
- to the suitable loops. */
-
-unsigned int
-canonicalize_induction_variables (void)
-{
- bool changed = false;
- bool irred_invalidated = false;
- bitmap loop_closed_ssa_invalidated = BITMAP_ALLOC (NULL);
-
- estimate_numbers_of_iterations (cfun);
-
- for (auto loop : loops_list (cfun, LI_FROM_INNERMOST))
- {
- changed |= canonicalize_loop_induction_variables (loop,
- true, UL_SINGLE_ITER,
- true, false);
- }
- gcc_assert (!need_ssa_update_p (cfun));
-
- unloop_loops (loop_closed_ssa_invalidated, &irred_invalidated);
- if (irred_invalidated
- && loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS))
- mark_irreducible_loops ();
-
- /* Clean up the information about numbers of iterations, since brute force
- evaluation could reveal new information. */
- free_numbers_of_iterations_estimates (cfun);
- scev_reset ();
-
- if (!bitmap_empty_p (loop_closed_ssa_invalidated))
- {
- gcc_checking_assert (loops_state_satisfies_p (LOOP_CLOSED_SSA));
- rewrite_into_loop_closed_ssa (NULL, TODO_update_ssa);
- }
- BITMAP_FREE (loop_closed_ssa_invalidated);
-
- if (changed)
- return TODO_cleanup_cfg;
- return 0;
-}
-
-/* Process loops from innermost to outer, stopping at the innermost
- loop we unrolled. */
-
-static bool
-tree_unroll_loops_completely_1 (bool may_increase_size, bool unroll_outer,
- bitmap father_bbs, class loop *loop)
-{
- class loop *loop_father;
- bool changed = false;
- class loop *inner;
- enum unroll_level ul;
- unsigned num = number_of_loops (cfun);
-
- /* Process inner loops first. Don't walk loops added by the recursive
- calls because SSA form is not up-to-date. They can be handled in the
- next iteration. */
- bitmap child_father_bbs = NULL;
- for (inner = loop->inner; inner != NULL; inner = inner->next)
- if ((unsigned) inner->num < num)
- {
- if (!child_father_bbs)
- child_father_bbs = BITMAP_ALLOC (NULL);
- if (tree_unroll_loops_completely_1 (may_increase_size, unroll_outer,
- child_father_bbs, inner))
- {
- bitmap_ior_into (father_bbs, child_father_bbs);
- bitmap_clear (child_father_bbs);
- changed = true;
- }
- }
- if (child_father_bbs)
- BITMAP_FREE (child_father_bbs);
-
- /* If we changed an inner loop we cannot process outer loops in this
- iteration because SSA form is not up-to-date. Continue with
- siblings of outer loops instead. */
- if (changed)
- {
- /* If we are recorded as father clear all other fathers that
- are necessarily covered already to avoid redundant work. */
- if (bitmap_bit_p (father_bbs, loop->header->index))
- {
- bitmap_clear (father_bbs);
- bitmap_set_bit (father_bbs, loop->header->index);
- }
- return true;
- }
-
- /* Don't unroll #pragma omp simd loops until the vectorizer
- attempts to vectorize those. */
- if (loop->force_vectorize)
- return false;
-
- /* Try to unroll this loop. */
- loop_father = loop_outer (loop);
- if (!loop_father)
- return false;
-
- if (loop->unroll > 1)
- ul = UL_ALL;
- else if (may_increase_size && optimize_loop_nest_for_speed_p (loop)
- /* Unroll outermost loops only if asked to do so or they do
- not cause code growth. */
- && (unroll_outer || loop_outer (loop_father)))
- ul = UL_ALL;
- else
- ul = UL_NO_GROWTH;
-
- if (canonicalize_loop_induction_variables
- (loop, false, ul, !flag_tree_loop_ivcanon, unroll_outer))
- {
- /* If we'll continue unrolling, we need to propagate constants
- within the new basic blocks to fold away induction variable
- computations; otherwise, the size might blow up before the
- iteration is complete and the IR eventually cleaned up. */
- if (loop_outer (loop_father))
- {
- /* Once we process our father we will have processed
- the fathers of our children as well, so avoid doing
- redundant work and clear fathers we've gathered sofar. */
- bitmap_clear (father_bbs);
- bitmap_set_bit (father_bbs, loop_father->header->index);
- }
- else if (unroll_outer)
- /* Trigger scalar cleanup once any outermost loop gets unrolled. */
- cfun->pending_TODOs |= PENDING_TODO_force_next_scalar_cleanup;
-
- return true;
- }
-
- return false;
-}
-
-/* Unroll LOOPS completely if they iterate just few times. Unless
- MAY_INCREASE_SIZE is true, perform the unrolling only if the
- size of the code does not increase. */
-
-static unsigned int
-tree_unroll_loops_completely (bool may_increase_size, bool unroll_outer)
-{
- bitmap father_bbs = BITMAP_ALLOC (NULL);
- bool changed;
- int iteration = 0;
- bool irred_invalidated = false;
-
- estimate_numbers_of_iterations (cfun);
-
- do
- {
- changed = false;
- bitmap loop_closed_ssa_invalidated = NULL;
-
- if (loops_state_satisfies_p (LOOP_CLOSED_SSA))
- loop_closed_ssa_invalidated = BITMAP_ALLOC (NULL);
-
- free_numbers_of_iterations_estimates (cfun);
- estimate_numbers_of_iterations (cfun);
-
- changed = tree_unroll_loops_completely_1 (may_increase_size,
- unroll_outer, father_bbs,
- current_loops->tree_root);
- if (changed)
- {
- unsigned i;
-
- unloop_loops (loop_closed_ssa_invalidated, &irred_invalidated);
-
- /* We cannot use TODO_update_ssa_no_phi because VOPS gets confused. */
- if (loop_closed_ssa_invalidated
- && !bitmap_empty_p (loop_closed_ssa_invalidated))
- rewrite_into_loop_closed_ssa (loop_closed_ssa_invalidated,
- TODO_update_ssa);
- else
- update_ssa (TODO_update_ssa);
-
- /* father_bbs is a bitmap of loop father header BB indices.
- Translate that to what non-root loops these BBs belong to now. */
- bitmap_iterator bi;
- bitmap fathers = BITMAP_ALLOC (NULL);
- EXECUTE_IF_SET_IN_BITMAP (father_bbs, 0, i, bi)
- {
- basic_block unrolled_loop_bb = BASIC_BLOCK_FOR_FN (cfun, i);
- if (! unrolled_loop_bb)
- continue;
- if (loop_outer (unrolled_loop_bb->loop_father))
- bitmap_set_bit (fathers,
- unrolled_loop_bb->loop_father->num);
- }
- bitmap_clear (father_bbs);
- /* Propagate the constants within the new basic blocks. */
- EXECUTE_IF_SET_IN_BITMAP (fathers, 0, i, bi)
- {
- loop_p father = get_loop (cfun, i);
- bitmap exit_bbs = BITMAP_ALLOC (NULL);
- loop_exit *exit = father->exits->next;
- while (exit->e)
- {
- bitmap_set_bit (exit_bbs, exit->e->dest->index);
- exit = exit->next;
- }
- do_rpo_vn (cfun, loop_preheader_edge (father), exit_bbs);
- }
- BITMAP_FREE (fathers);
-
- /* This will take care of removing completely unrolled loops
- from the loop structures so we can continue unrolling now
- innermost loops. */
- if (cleanup_tree_cfg ())
- update_ssa (TODO_update_ssa_only_virtuals);
-
- /* Clean up the information about numbers of iterations, since
- complete unrolling might have invalidated it. */
- scev_reset ();
- if (flag_checking && loops_state_satisfies_p (LOOP_CLOSED_SSA))
- verify_loop_closed_ssa (true);
- }
- if (loop_closed_ssa_invalidated)
- BITMAP_FREE (loop_closed_ssa_invalidated);
- }
- while (changed
- && ++iteration <= param_max_unroll_iterations);
-
- BITMAP_FREE (father_bbs);
-
- if (irred_invalidated
- && loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS))
- mark_irreducible_loops ();
-
- return 0;
-}
-
-/* Canonical induction variable creation pass. */
-
-namespace {
-
-const pass_data pass_data_iv_canon =
-{
- GIMPLE_PASS, /* type */
- "ivcanon", /* name */
- OPTGROUP_LOOP, /* optinfo_flags */
- TV_TREE_LOOP_IVCANON, /* tv_id */
- ( PROP_cfg | PROP_ssa ), /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_iv_canon : public gimple_opt_pass
-{
-public:
- pass_iv_canon (gcc::context *ctxt)
- : gimple_opt_pass (pass_data_iv_canon, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual bool gate (function *) { return flag_tree_loop_ivcanon != 0; }
- virtual unsigned int execute (function *fun);
-
-}; // class pass_iv_canon
-
-unsigned int
-pass_iv_canon::execute (function *fun)
-{
- if (number_of_loops (fun) <= 1)
- return 0;
-
- return canonicalize_induction_variables ();
-}
-
-} // anon namespace
-
-gimple_opt_pass *
-make_pass_iv_canon (gcc::context *ctxt)
-{
- return new pass_iv_canon (ctxt);
-}
-
-/* Complete unrolling of loops. */
-
-namespace {
-
-const pass_data pass_data_complete_unroll =
-{
- GIMPLE_PASS, /* type */
- "cunroll", /* name */
- OPTGROUP_LOOP, /* optinfo_flags */
- TV_COMPLETE_UNROLL, /* tv_id */
- ( PROP_cfg | PROP_ssa ), /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_complete_unroll : public gimple_opt_pass
-{
-public:
- pass_complete_unroll (gcc::context *ctxt)
- : gimple_opt_pass (pass_data_complete_unroll, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual unsigned int execute (function *);
-
-}; // class pass_complete_unroll
-
-unsigned int
-pass_complete_unroll::execute (function *fun)
-{
- if (number_of_loops (fun) <= 1)
- return 0;
-
- /* If we ever decide to run loop peeling more than once, we will need to
- track loops already peeled in loop structures themselves to avoid
- re-peeling the same loop multiple times. */
- if (flag_peel_loops)
- peeled_loops = BITMAP_ALLOC (NULL);
- unsigned int val = tree_unroll_loops_completely (flag_cunroll_grow_size,
- true);
- if (peeled_loops)
- {
- BITMAP_FREE (peeled_loops);
- peeled_loops = NULL;
- }
- return val;
-}
-
-} // anon namespace
-
-gimple_opt_pass *
-make_pass_complete_unroll (gcc::context *ctxt)
-{
- return new pass_complete_unroll (ctxt);
-}
-
-/* Complete unrolling of inner loops. */
-
-namespace {
-
-const pass_data pass_data_complete_unrolli =
-{
- GIMPLE_PASS, /* type */
- "cunrolli", /* name */
- OPTGROUP_LOOP, /* optinfo_flags */
- TV_COMPLETE_UNROLL, /* tv_id */
- ( PROP_cfg | PROP_ssa ), /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_complete_unrolli : public gimple_opt_pass
-{
-public:
- pass_complete_unrolli (gcc::context *ctxt)
- : gimple_opt_pass (pass_data_complete_unrolli, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual bool gate (function *) { return optimize >= 2; }
- virtual unsigned int execute (function *);
-
-}; // class pass_complete_unrolli
-
-unsigned int
-pass_complete_unrolli::execute (function *fun)
-{
- unsigned ret = 0;
-
- loop_optimizer_init (LOOPS_NORMAL | LOOPS_HAVE_RECORDED_EXITS);
- if (number_of_loops (fun) > 1)
- {
- scev_initialize ();
- ret = tree_unroll_loops_completely (optimize >= 3, false);
- scev_finalize ();
- }
- loop_optimizer_finalize ();
-
- return ret;
-}
-
-} // anon namespace
-
-gimple_opt_pass *
-make_pass_complete_unrolli (gcc::context *ctxt)
-{
- return new pass_complete_unrolli (ctxt);
-}
-
-
generated by cgit v1.1 at 2025-08-11 08:26:56 +0000