aboutsummaryrefslogtreecommitdiff
path: root/gcc/cfgloopmanip.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/cfgloopmanip.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/cfgloopmanip.c')
-rw-r--r--gcc/cfgloopmanip.c1714
1 files changed, 0 insertions, 1714 deletions
diff --git a/gcc/cfgloopmanip.c b/gcc/cfgloopmanip.c
deleted file mode 100644
index b4357c0..0000000
--- a/gcc/cfgloopmanip.c
+++ /dev/null
@@ -1,1714 +0,0 @@
-/* Loop manipulation code for GNU compiler.
- Copyright (C) 2002-2022 Free Software Foundation, Inc.
-
-This file is part of GCC.
-
-GCC is free software; you can redistribute it and/or modify it under
-the terms of the GNU General Public License as published by the Free
-Software Foundation; either version 3, or (at your option) any later
-version.
-
-GCC is distributed in the hope that it will be useful, but WITHOUT ANY
-WARRANTY; without even the implied warranty of MERCHANTABILITY or
-FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-for more details.
-
-You should have received a copy of the GNU General Public License
-along with GCC; see the file COPYING3. If not see
-<http://www.gnu.org/licenses/>. */
-
-#include "config.h"
-#include "system.h"
-#include "coretypes.h"
-#include "backend.h"
-#include "rtl.h"
-#include "tree.h"
-#include "gimple.h"
-#include "cfghooks.h"
-#include "cfganal.h"
-#include "cfgloop.h"
-#include "gimple-iterator.h"
-#include "gimplify-me.h"
-#include "tree-ssa-loop-manip.h"
-#include "dumpfile.h"
-
-static void copy_loops_to (class loop **, int,
- class loop *);
-static void loop_redirect_edge (edge, basic_block);
-static void remove_bbs (basic_block *, int);
-static bool rpe_enum_p (const_basic_block, const void *);
-static int find_path (edge, basic_block **);
-static void fix_loop_placements (class loop *, bool *);
-static bool fix_bb_placement (basic_block);
-static void fix_bb_placements (basic_block, bool *, bitmap);
-
-/* Checks whether basic block BB is dominated by DATA. */
-static bool
-rpe_enum_p (const_basic_block bb, const void *data)
-{
- return dominated_by_p (CDI_DOMINATORS, bb, (const_basic_block) data);
-}
-
-/* Remove basic blocks BBS. NBBS is the number of the basic blocks. */
-
-static void
-remove_bbs (basic_block *bbs, int nbbs)
-{
- int i;
-
- for (i = 0; i < nbbs; i++)
- delete_basic_block (bbs[i]);
-}
-
-/* Find path -- i.e. the basic blocks dominated by edge E and put them
- into array BBS, that will be allocated large enough to contain them.
- E->dest must have exactly one predecessor for this to work (it is
- easy to achieve and we do not put it here because we do not want to
- alter anything by this function). The number of basic blocks in the
- path is returned. */
-static int
-find_path (edge e, basic_block **bbs)
-{
- gcc_assert (EDGE_COUNT (e->dest->preds) <= 1);
-
- /* Find bbs in the path. */
- *bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
- return dfs_enumerate_from (e->dest, 0, rpe_enum_p, *bbs,
- n_basic_blocks_for_fn (cfun), e->dest);
-}
-
-/* Fix placement of basic block BB inside loop hierarchy --
- Let L be a loop to that BB belongs. Then every successor of BB must either
- 1) belong to some superloop of loop L, or
- 2) be a header of loop K such that K->outer is superloop of L
- Returns true if we had to move BB into other loop to enforce this condition,
- false if the placement of BB was already correct (provided that placements
- of its successors are correct). */
-static bool
-fix_bb_placement (basic_block bb)
-{
- edge e;
- edge_iterator ei;
- class loop *loop = current_loops->tree_root, *act;
-
- FOR_EACH_EDGE (e, ei, bb->succs)
- {
- if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun))
- continue;
-
- act = e->dest->loop_father;
- if (act->header == e->dest)
- act = loop_outer (act);
-
- if (flow_loop_nested_p (loop, act))
- loop = act;
- }
-
- if (loop == bb->loop_father)
- return false;
-
- remove_bb_from_loops (bb);
- add_bb_to_loop (bb, loop);
-
- return true;
-}
-
-/* Fix placement of LOOP inside loop tree, i.e. find the innermost superloop
- of LOOP to that leads at least one exit edge of LOOP, and set it
- as the immediate superloop of LOOP. Return true if the immediate superloop
- of LOOP changed.
-
- IRRED_INVALIDATED is set to true if a change in the loop structures might
- invalidate the information about irreducible regions. */
-
-static bool
-fix_loop_placement (class loop *loop, bool *irred_invalidated)
-{
- unsigned i;
- edge e;
- auto_vec<edge> exits = get_loop_exit_edges (loop);
- class loop *father = current_loops->tree_root, *act;
- bool ret = false;
-
- FOR_EACH_VEC_ELT (exits, i, e)
- {
- act = find_common_loop (loop, e->dest->loop_father);
- if (flow_loop_nested_p (father, act))
- father = act;
- }
-
- if (father != loop_outer (loop))
- {
- for (act = loop_outer (loop); act != father; act = loop_outer (act))
- act->num_nodes -= loop->num_nodes;
- flow_loop_tree_node_remove (loop);
- flow_loop_tree_node_add (father, loop);
-
- /* The exit edges of LOOP no longer exits its original immediate
- superloops; remove them from the appropriate exit lists. */
- FOR_EACH_VEC_ELT (exits, i, e)
- {
- /* We may need to recompute irreducible loops. */
- if (e->flags & EDGE_IRREDUCIBLE_LOOP)
- *irred_invalidated = true;
- rescan_loop_exit (e, false, false);
- }
-
- ret = true;
- }
-
- return ret;
-}
-
-/* Fix placements of basic blocks inside loop hierarchy stored in loops; i.e.
- enforce condition stated in description of fix_bb_placement. We
- start from basic block FROM that had some of its successors removed, so that
- his placement no longer has to be correct, and iteratively fix placement of
- its predecessors that may change if placement of FROM changed. Also fix
- placement of subloops of FROM->loop_father, that might also be altered due
- to this change; the condition for them is similar, except that instead of
- successors we consider edges coming out of the loops.
-
- If the changes may invalidate the information about irreducible regions,
- IRRED_INVALIDATED is set to true.
-
- If LOOP_CLOSED_SSA_INVLIDATED is non-zero then all basic blocks with
- changed loop_father are collected there. */
-
-static void
-fix_bb_placements (basic_block from,
- bool *irred_invalidated,
- bitmap loop_closed_ssa_invalidated)
-{
- basic_block *queue, *qtop, *qbeg, *qend;
- class loop *base_loop, *target_loop;
- edge e;
-
- /* We pass through blocks back-reachable from FROM, testing whether some
- of their successors moved to outer loop. It may be necessary to
- iterate several times, but it is finite, as we stop unless we move
- the basic block up the loop structure. The whole story is a bit
- more complicated due to presence of subloops, those are moved using
- fix_loop_placement. */
-
- base_loop = from->loop_father;
- /* If we are already in the outermost loop, the basic blocks cannot be moved
- outside of it. If FROM is the header of the base loop, it cannot be moved
- outside of it, either. In both cases, we can end now. */
- if (base_loop == current_loops->tree_root
- || from == base_loop->header)
- return;
-
- auto_sbitmap in_queue (last_basic_block_for_fn (cfun));
- bitmap_clear (in_queue);
- bitmap_set_bit (in_queue, from->index);
- /* Prevent us from going out of the base_loop. */
- bitmap_set_bit (in_queue, base_loop->header->index);
-
- queue = XNEWVEC (basic_block, base_loop->num_nodes + 1);
- qtop = queue + base_loop->num_nodes + 1;
- qbeg = queue;
- qend = queue + 1;
- *qbeg = from;
-
- while (qbeg != qend)
- {
- edge_iterator ei;
- from = *qbeg;
- qbeg++;
- if (qbeg == qtop)
- qbeg = queue;
- bitmap_clear_bit (in_queue, from->index);
-
- if (from->loop_father->header == from)
- {
- /* Subloop header, maybe move the loop upward. */
- if (!fix_loop_placement (from->loop_father, irred_invalidated))
- continue;
- target_loop = loop_outer (from->loop_father);
- if (loop_closed_ssa_invalidated)
- {
- basic_block *bbs = get_loop_body (from->loop_father);
- for (unsigned i = 0; i < from->loop_father->num_nodes; ++i)
- bitmap_set_bit (loop_closed_ssa_invalidated, bbs[i]->index);
- free (bbs);
- }
- }
- else
- {
- /* Ordinary basic block. */
- if (!fix_bb_placement (from))
- continue;
- target_loop = from->loop_father;
- if (loop_closed_ssa_invalidated)
- bitmap_set_bit (loop_closed_ssa_invalidated, from->index);
- }
-
- FOR_EACH_EDGE (e, ei, from->succs)
- {
- if (e->flags & EDGE_IRREDUCIBLE_LOOP)
- *irred_invalidated = true;
- }
-
- /* Something has changed, insert predecessors into queue. */
- FOR_EACH_EDGE (e, ei, from->preds)
- {
- basic_block pred = e->src;
- class loop *nca;
-
- if (e->flags & EDGE_IRREDUCIBLE_LOOP)
- *irred_invalidated = true;
-
- if (bitmap_bit_p (in_queue, pred->index))
- continue;
-
- /* If it is subloop, then it either was not moved, or
- the path up the loop tree from base_loop do not contain
- it. */
- nca = find_common_loop (pred->loop_father, base_loop);
- if (pred->loop_father != base_loop
- && (nca == base_loop
- || nca != pred->loop_father))
- pred = pred->loop_father->header;
- else if (!flow_loop_nested_p (target_loop, pred->loop_father))
- {
- /* If PRED is already higher in the loop hierarchy than the
- TARGET_LOOP to that we moved FROM, the change of the position
- of FROM does not affect the position of PRED, so there is no
- point in processing it. */
- continue;
- }
-
- if (bitmap_bit_p (in_queue, pred->index))
- continue;
-
- /* Schedule the basic block. */
- *qend = pred;
- qend++;
- if (qend == qtop)
- qend = queue;
- bitmap_set_bit (in_queue, pred->index);
- }
- }
- free (queue);
-}
-
-/* Removes path beginning at edge E, i.e. remove basic blocks dominated by E
- and update loop structures and dominators. Return true if we were able
- to remove the path, false otherwise (and nothing is affected then). */
-bool
-remove_path (edge e, bool *irred_invalidated,
- bitmap loop_closed_ssa_invalidated)
-{
- edge ae;
- basic_block *rem_bbs, *bord_bbs, from, bb;
- vec<basic_block> dom_bbs;
- int i, nrem, n_bord_bbs;
- bool local_irred_invalidated = false;
- edge_iterator ei;
- class loop *l, *f;
-
- if (! irred_invalidated)
- irred_invalidated = &local_irred_invalidated;
-
- if (!can_remove_branch_p (e))
- return false;
-
- /* Keep track of whether we need to update information about irreducible
- regions. This is the case if the removed area is a part of the
- irreducible region, or if the set of basic blocks that belong to a loop
- that is inside an irreducible region is changed, or if such a loop is
- removed. */
- if (e->flags & EDGE_IRREDUCIBLE_LOOP)
- *irred_invalidated = true;
-
- /* We need to check whether basic blocks are dominated by the edge
- e, but we only have basic block dominators. This is easy to
- fix -- when e->dest has exactly one predecessor, this corresponds
- to blocks dominated by e->dest, if not, split the edge. */
- if (!single_pred_p (e->dest))
- e = single_pred_edge (split_edge (e));
-
- /* It may happen that by removing path we remove one or more loops
- we belong to. In this case first unloop the loops, then proceed
- normally. We may assume that e->dest is not a header of any loop,
- as it now has exactly one predecessor. */
- for (l = e->src->loop_father; loop_outer (l); l = f)
- {
- f = loop_outer (l);
- if (dominated_by_p (CDI_DOMINATORS, l->latch, e->dest))
- unloop (l, irred_invalidated, loop_closed_ssa_invalidated);
- }
-
- /* Identify the path. */
- nrem = find_path (e, &rem_bbs);
-
- n_bord_bbs = 0;
- bord_bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
- auto_sbitmap seen (last_basic_block_for_fn (cfun));
- bitmap_clear (seen);
-
- /* Find "border" hexes -- i.e. those with predecessor in removed path. */
- for (i = 0; i < nrem; i++)
- bitmap_set_bit (seen, rem_bbs[i]->index);
- if (!*irred_invalidated)
- FOR_EACH_EDGE (ae, ei, e->src->succs)
- if (ae != e && ae->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
- && !bitmap_bit_p (seen, ae->dest->index)
- && ae->flags & EDGE_IRREDUCIBLE_LOOP)
- {
- *irred_invalidated = true;
- break;
- }
-
- for (i = 0; i < nrem; i++)
- {
- FOR_EACH_EDGE (ae, ei, rem_bbs[i]->succs)
- if (ae->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
- && !bitmap_bit_p (seen, ae->dest->index))
- {
- bitmap_set_bit (seen, ae->dest->index);
- bord_bbs[n_bord_bbs++] = ae->dest;
-
- if (ae->flags & EDGE_IRREDUCIBLE_LOOP)
- *irred_invalidated = true;
- }
- }
-
- /* Remove the path. */
- from = e->src;
- remove_branch (e);
- dom_bbs.create (0);
-
- /* Cancel loops contained in the path. */
- for (i = 0; i < nrem; i++)
- if (rem_bbs[i]->loop_father->header == rem_bbs[i])
- cancel_loop_tree (rem_bbs[i]->loop_father);
-
- remove_bbs (rem_bbs, nrem);
- free (rem_bbs);
-
- /* Find blocks whose dominators may be affected. */
- bitmap_clear (seen);
- for (i = 0; i < n_bord_bbs; i++)
- {
- basic_block ldom;
-
- bb = get_immediate_dominator (CDI_DOMINATORS, bord_bbs[i]);
- if (bitmap_bit_p (seen, bb->index))
- continue;
- bitmap_set_bit (seen, bb->index);
-
- for (ldom = first_dom_son (CDI_DOMINATORS, bb);
- ldom;
- ldom = next_dom_son (CDI_DOMINATORS, ldom))
- if (!dominated_by_p (CDI_DOMINATORS, from, ldom))
- dom_bbs.safe_push (ldom);
- }
-
- /* Recount dominators. */
- iterate_fix_dominators (CDI_DOMINATORS, dom_bbs, true);
- dom_bbs.release ();
- free (bord_bbs);
-
- /* Fix placements of basic blocks inside loops and the placement of
- loops in the loop tree. */
- fix_bb_placements (from, irred_invalidated, loop_closed_ssa_invalidated);
- fix_loop_placements (from->loop_father, irred_invalidated);
-
- if (local_irred_invalidated
- && loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS))
- mark_irreducible_loops ();
-
- return true;
-}
-
-/* Creates place for a new LOOP in loops structure of FN. */
-
-void
-place_new_loop (struct function *fn, class loop *loop)
-{
- loop->num = number_of_loops (fn);
- vec_safe_push (loops_for_fn (fn)->larray, loop);
-}
-
-/* Given LOOP structure with filled header and latch, find the body of the
- corresponding loop and add it to loops tree. Insert the LOOP as a son of
- outer. */
-
-void
-add_loop (class loop *loop, class loop *outer)
-{
- basic_block *bbs;
- int i, n;
- class loop *subloop;
- edge e;
- edge_iterator ei;
-
- /* Add it to loop structure. */
- place_new_loop (cfun, loop);
- flow_loop_tree_node_add (outer, loop);
-
- /* Find its nodes. */
- bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
- n = get_loop_body_with_size (loop, bbs, n_basic_blocks_for_fn (cfun));
-
- for (i = 0; i < n; i++)
- {
- if (bbs[i]->loop_father == outer)
- {
- remove_bb_from_loops (bbs[i]);
- add_bb_to_loop (bbs[i], loop);
- continue;
- }
-
- loop->num_nodes++;
-
- /* If we find a direct subloop of OUTER, move it to LOOP. */
- subloop = bbs[i]->loop_father;
- if (loop_outer (subloop) == outer
- && subloop->header == bbs[i])
- {
- flow_loop_tree_node_remove (subloop);
- flow_loop_tree_node_add (loop, subloop);
- }
- }
-
- /* Update the information about loop exit edges. */
- for (i = 0; i < n; i++)
- {
- FOR_EACH_EDGE (e, ei, bbs[i]->succs)
- {
- rescan_loop_exit (e, false, false);
- }
- }
-
- free (bbs);
-}
-
-/* Scale profile of loop by P. */
-
-void
-scale_loop_frequencies (class loop *loop, profile_probability p)
-{
- basic_block *bbs;
-
- bbs = get_loop_body (loop);
- scale_bbs_frequencies (bbs, loop->num_nodes, p);
- free (bbs);
-}
-
-/* Scale profile in LOOP by P.
- If ITERATION_BOUND is non-zero, scale even further if loop is predicted
- to iterate too many times.
- Before caling this function, preheader block profile should be already
- scaled to final count. This is necessary because loop iterations are
- determined by comparing header edge count to latch ege count and thus
- they need to be scaled synchronously. */
-
-void
-scale_loop_profile (class loop *loop, profile_probability p,
- gcov_type iteration_bound)
-{
- edge e, preheader_e;
- edge_iterator ei;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, ";; Scaling loop %i with scale ",
- loop->num);
- p.dump (dump_file);
- fprintf (dump_file, " bounding iterations to %i\n",
- (int)iteration_bound);
- }
-
- /* Scale the probabilities. */
- scale_loop_frequencies (loop, p);
-
- if (iteration_bound == 0)
- return;
-
- gcov_type iterations = expected_loop_iterations_unbounded (loop, NULL, true);
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- {
- fprintf (dump_file, ";; guessed iterations after scaling %i\n",
- (int)iterations);
- }
-
- /* See if loop is predicted to iterate too many times. */
- if (iterations <= iteration_bound)
- return;
-
- preheader_e = loop_preheader_edge (loop);
-
- /* We could handle also loops without preheaders, but bounding is
- currently used only by optimizers that have preheaders constructed. */
- gcc_checking_assert (preheader_e);
- profile_count count_in = preheader_e->count ();
-
- if (count_in > profile_count::zero ()
- && loop->header->count.initialized_p ())
- {
- profile_count count_delta = profile_count::zero ();
-
- e = single_exit (loop);
- if (e)
- {
- edge other_e;
- FOR_EACH_EDGE (other_e, ei, e->src->succs)
- if (!(other_e->flags & (EDGE_ABNORMAL | EDGE_FAKE))
- && e != other_e)
- break;
-
- /* Probability of exit must be 1/iterations. */
- count_delta = e->count ();
- e->probability = profile_probability::always ()
- .apply_scale (1, iteration_bound);
- other_e->probability = e->probability.invert ();
-
- /* In code below we only handle the following two updates. */
- if (other_e->dest != loop->header
- && other_e->dest != loop->latch
- && (dump_file && (dump_flags & TDF_DETAILS)))
- {
- fprintf (dump_file, ";; giving up on update of paths from "
- "exit condition to latch\n");
- }
- }
- else
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, ";; Loop has multiple exit edges; "
- "giving up on exit condition update\n");
-
- /* Roughly speaking we want to reduce the loop body profile by the
- difference of loop iterations. We however can do better if
- we look at the actual profile, if it is available. */
- p = profile_probability::always ();
-
- count_in = count_in.apply_scale (iteration_bound, 1);
- p = count_in.probability_in (loop->header->count);
- if (!(p > profile_probability::never ()))
- p = profile_probability::very_unlikely ();
-
- if (p == profile_probability::always ()
- || !p.initialized_p ())
- return;
-
- /* If latch exists, change its count, since we changed
- probability of exit. Theoretically we should update everything from
- source of exit edge to latch, but for vectorizer this is enough. */
- if (loop->latch && loop->latch != e->src)
- loop->latch->count += count_delta;
-
- /* Scale the probabilities. */
- scale_loop_frequencies (loop, p);
-
- /* Change latch's count back. */
- if (loop->latch && loop->latch != e->src)
- loop->latch->count -= count_delta;
-
- if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, ";; guessed iterations are now %i\n",
- (int)expected_loop_iterations_unbounded (loop, NULL, true));
- }
-}
-
-/* Recompute dominance information for basic blocks outside LOOP. */
-
-static void
-update_dominators_in_loop (class loop *loop)
-{
- vec<basic_block> dom_bbs = vNULL;
- basic_block *body;
- unsigned i;
-
- auto_sbitmap seen (last_basic_block_for_fn (cfun));
- bitmap_clear (seen);
- body = get_loop_body (loop);
-
- for (i = 0; i < loop->num_nodes; i++)
- bitmap_set_bit (seen, body[i]->index);
-
- for (i = 0; i < loop->num_nodes; i++)
- {
- basic_block ldom;
-
- for (ldom = first_dom_son (CDI_DOMINATORS, body[i]);
- ldom;
- ldom = next_dom_son (CDI_DOMINATORS, ldom))
- if (!bitmap_bit_p (seen, ldom->index))
- {
- bitmap_set_bit (seen, ldom->index);
- dom_bbs.safe_push (ldom);
- }
- }
-
- iterate_fix_dominators (CDI_DOMINATORS, dom_bbs, false);
- free (body);
- dom_bbs.release ();
-}
-
-/* Creates an if region as shown above. CONDITION is used to create
- the test for the if.
-
- |
- | ------------- -------------
- | | pred_bb | | pred_bb |
- | ------------- -------------
- | | |
- | | | ENTRY_EDGE
- | | ENTRY_EDGE V
- | | ====> -------------
- | | | cond_bb |
- | | | CONDITION |
- | | -------------
- | V / \
- | ------------- e_false / \ e_true
- | | succ_bb | V V
- | ------------- ----------- -----------
- | | false_bb | | true_bb |
- | ----------- -----------
- | \ /
- | \ /
- | V V
- | -------------
- | | join_bb |
- | -------------
- | | exit_edge (result)
- | V
- | -----------
- | | succ_bb |
- | -----------
- |
- */
-
-edge
-create_empty_if_region_on_edge (edge entry_edge, tree condition)
-{
-
- basic_block cond_bb, true_bb, false_bb, join_bb;
- edge e_true, e_false, exit_edge;
- gcond *cond_stmt;
- tree simple_cond;
- gimple_stmt_iterator gsi;
-
- cond_bb = split_edge (entry_edge);
-
- /* Insert condition in cond_bb. */
- gsi = gsi_last_bb (cond_bb);
- simple_cond =
- force_gimple_operand_gsi (&gsi, condition, true, NULL,
- false, GSI_NEW_STMT);
- cond_stmt = gimple_build_cond_from_tree (simple_cond, NULL_TREE, NULL_TREE);
- gsi = gsi_last_bb (cond_bb);
- gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
-
- join_bb = split_edge (single_succ_edge (cond_bb));
-
- e_true = single_succ_edge (cond_bb);
- true_bb = split_edge (e_true);
-
- e_false = make_edge (cond_bb, join_bb, 0);
- false_bb = split_edge (e_false);
-
- e_true->flags &= ~EDGE_FALLTHRU;
- e_true->flags |= EDGE_TRUE_VALUE;
- e_false->flags &= ~EDGE_FALLTHRU;
- e_false->flags |= EDGE_FALSE_VALUE;
-
- set_immediate_dominator (CDI_DOMINATORS, cond_bb, entry_edge->src);
- set_immediate_dominator (CDI_DOMINATORS, true_bb, cond_bb);
- set_immediate_dominator (CDI_DOMINATORS, false_bb, cond_bb);
- set_immediate_dominator (CDI_DOMINATORS, join_bb, cond_bb);
-
- exit_edge = single_succ_edge (join_bb);
-
- if (single_pred_p (exit_edge->dest))
- set_immediate_dominator (CDI_DOMINATORS, exit_edge->dest, join_bb);
-
- return exit_edge;
-}
-
-/* create_empty_loop_on_edge
- |
- | - pred_bb - ------ pred_bb ------
- | | | | iv0 = initial_value |
- | -----|----- ---------|-----------
- | | ______ | entry_edge
- | | entry_edge / | |
- | | ====> | -V---V- loop_header -------------
- | V | | iv_before = phi (iv0, iv_after) |
- | - succ_bb - | ---|-----------------------------
- | | | | |
- | ----------- | ---V--- loop_body ---------------
- | | | iv_after = iv_before + stride |
- | | | if (iv_before < upper_bound) |
- | | ---|--------------\--------------
- | | | \ exit_e
- | | V \
- | | - loop_latch - V- succ_bb -
- | | | | | |
- | | /------------- -----------
- | \ ___ /
-
- Creates an empty loop as shown above, the IV_BEFORE is the SSA_NAME
- that is used before the increment of IV. IV_BEFORE should be used for
- adding code to the body that uses the IV. OUTER is the outer loop in
- which the new loop should be inserted.
-
- Both INITIAL_VALUE and UPPER_BOUND expressions are gimplified and
- inserted on the loop entry edge. This implies that this function
- should be used only when the UPPER_BOUND expression is a loop
- invariant. */
-
-class loop *
-create_empty_loop_on_edge (edge entry_edge,
- tree initial_value,
- tree stride, tree upper_bound,
- tree iv,
- tree *iv_before,
- tree *iv_after,
- class loop *outer)
-{
- basic_block loop_header, loop_latch, succ_bb, pred_bb;
- class loop *loop;
- gimple_stmt_iterator gsi;
- gimple_seq stmts;
- gcond *cond_expr;
- tree exit_test;
- edge exit_e;
-
- gcc_assert (entry_edge && initial_value && stride && upper_bound && iv);
-
- /* Create header, latch and wire up the loop. */
- pred_bb = entry_edge->src;
- loop_header = split_edge (entry_edge);
- loop_latch = split_edge (single_succ_edge (loop_header));
- succ_bb = single_succ (loop_latch);
- make_edge (loop_header, succ_bb, 0);
- redirect_edge_succ_nodup (single_succ_edge (loop_latch), loop_header);
-
- /* Set immediate dominator information. */
- set_immediate_dominator (CDI_DOMINATORS, loop_header, pred_bb);
- set_immediate_dominator (CDI_DOMINATORS, loop_latch, loop_header);
- set_immediate_dominator (CDI_DOMINATORS, succ_bb, loop_header);
-
- /* Initialize a loop structure and put it in a loop hierarchy. */
- loop = alloc_loop ();
- loop->header = loop_header;
- loop->latch = loop_latch;
- add_loop (loop, outer);
-
- /* TODO: Fix counts. */
- scale_loop_frequencies (loop, profile_probability::even ());
-
- /* Update dominators. */
- update_dominators_in_loop (loop);
-
- /* Modify edge flags. */
- exit_e = single_exit (loop);
- exit_e->flags = EDGE_LOOP_EXIT | EDGE_FALSE_VALUE;
- single_pred_edge (loop_latch)->flags = EDGE_TRUE_VALUE;
-
- /* Construct IV code in loop. */
- initial_value = force_gimple_operand (initial_value, &stmts, true, iv);
- if (stmts)
- {
- gsi_insert_seq_on_edge (loop_preheader_edge (loop), stmts);
- gsi_commit_edge_inserts ();
- }
-
- upper_bound = force_gimple_operand (upper_bound, &stmts, true, NULL);
- if (stmts)
- {
- gsi_insert_seq_on_edge (loop_preheader_edge (loop), stmts);
- gsi_commit_edge_inserts ();
- }
-
- gsi = gsi_last_bb (loop_header);
- create_iv (initial_value, stride, iv, loop, &gsi, false,
- iv_before, iv_after);
-
- /* Insert loop exit condition. */
- cond_expr = gimple_build_cond
- (LT_EXPR, *iv_before, upper_bound, NULL_TREE, NULL_TREE);
-
- exit_test = gimple_cond_lhs (cond_expr);
- exit_test = force_gimple_operand_gsi (&gsi, exit_test, true, NULL,
- false, GSI_NEW_STMT);
- gimple_cond_set_lhs (cond_expr, exit_test);
- gsi = gsi_last_bb (exit_e->src);
- gsi_insert_after (&gsi, cond_expr, GSI_NEW_STMT);
-
- split_block_after_labels (loop_header);
-
- return loop;
-}
-
-/* Remove the latch edge of a LOOP and update loops to indicate that
- the LOOP was removed. After this function, original loop latch will
- have no successor, which caller is expected to fix somehow.
-
- If this may cause the information about irreducible regions to become
- invalid, IRRED_INVALIDATED is set to true.
-
- LOOP_CLOSED_SSA_INVALIDATED, if non-NULL, is a bitmap where we store
- basic blocks that had non-trivial update on their loop_father.*/
-
-void
-unloop (class loop *loop, bool *irred_invalidated,
- bitmap loop_closed_ssa_invalidated)
-{
- basic_block *body;
- class loop *ploop;
- unsigned i, n;
- basic_block latch = loop->latch;
- bool dummy = false;
-
- if (loop_preheader_edge (loop)->flags & EDGE_IRREDUCIBLE_LOOP)
- *irred_invalidated = true;
-
- /* This is relatively straightforward. The dominators are unchanged, as
- loop header dominates loop latch, so the only thing we have to care of
- is the placement of loops and basic blocks inside the loop tree. We
- move them all to the loop->outer, and then let fix_bb_placements do
- its work. */
-
- body = get_loop_body (loop);
- n = loop->num_nodes;
- for (i = 0; i < n; i++)
- if (body[i]->loop_father == loop)
- {
- remove_bb_from_loops (body[i]);
- add_bb_to_loop (body[i], loop_outer (loop));
- }
- free (body);
-
- while (loop->inner)
- {
- ploop = loop->inner;
- flow_loop_tree_node_remove (ploop);
- flow_loop_tree_node_add (loop_outer (loop), ploop);
- }
-
- /* Remove the loop and free its data. */
- delete_loop (loop);
-
- remove_edge (single_succ_edge (latch));
-
- /* We do not pass IRRED_INVALIDATED to fix_bb_placements here, as even if
- there is an irreducible region inside the cancelled loop, the flags will
- be still correct. */
- fix_bb_placements (latch, &dummy, loop_closed_ssa_invalidated);
-}
-
-/* Fix placement of superloops of LOOP inside loop tree, i.e. ensure that
- condition stated in description of fix_loop_placement holds for them.
- It is used in case when we removed some edges coming out of LOOP, which
- may cause the right placement of LOOP inside loop tree to change.
-
- IRRED_INVALIDATED is set to true if a change in the loop structures might
- invalidate the information about irreducible regions. */
-
-static void
-fix_loop_placements (class loop *loop, bool *irred_invalidated)
-{
- class loop *outer;
-
- while (loop_outer (loop))
- {
- outer = loop_outer (loop);
- if (!fix_loop_placement (loop, irred_invalidated))
- break;
-
- /* Changing the placement of a loop in the loop tree may alter the
- validity of condition 2) of the description of fix_bb_placement
- for its preheader, because the successor is the header and belongs
- to the loop. So call fix_bb_placements to fix up the placement
- of the preheader and (possibly) of its predecessors. */
- fix_bb_placements (loop_preheader_edge (loop)->src,
- irred_invalidated, NULL);
- loop = outer;
- }
-}
-
-/* Duplicate loop bounds and other information we store about
- the loop into its duplicate. */
-
-void
-copy_loop_info (class loop *loop, class loop *target)
-{
- gcc_checking_assert (!target->any_upper_bound && !target->any_estimate);
- target->any_upper_bound = loop->any_upper_bound;
- target->nb_iterations_upper_bound = loop->nb_iterations_upper_bound;
- target->any_likely_upper_bound = loop->any_likely_upper_bound;
- target->nb_iterations_likely_upper_bound
- = loop->nb_iterations_likely_upper_bound;
- target->any_estimate = loop->any_estimate;
- target->nb_iterations_estimate = loop->nb_iterations_estimate;
- target->estimate_state = loop->estimate_state;
- target->safelen = loop->safelen;
- target->simdlen = loop->simdlen;
- target->constraints = loop->constraints;
- target->can_be_parallel = loop->can_be_parallel;
- target->warned_aggressive_loop_optimizations
- |= loop->warned_aggressive_loop_optimizations;
- target->dont_vectorize = loop->dont_vectorize;
- target->force_vectorize = loop->force_vectorize;
- target->in_oacc_kernels_region = loop->in_oacc_kernels_region;
- target->finite_p = loop->finite_p;
- target->unroll = loop->unroll;
- target->owned_clique = loop->owned_clique;
-}
-
-/* Copies copy of LOOP as subloop of TARGET loop, placing newly
- created loop into loops structure. If AFTER is non-null
- the new loop is added at AFTER->next, otherwise in front of TARGETs
- sibling list. */
-class loop *
-duplicate_loop (class loop *loop, class loop *target, class loop *after)
-{
- class loop *cloop;
- cloop = alloc_loop ();
- place_new_loop (cfun, cloop);
-
- copy_loop_info (loop, cloop);
-
- /* Mark the new loop as copy of LOOP. */
- set_loop_copy (loop, cloop);
-
- /* Add it to target. */
- flow_loop_tree_node_add (target, cloop, after);
-
- return cloop;
-}
-
-/* Copies structure of subloops of LOOP into TARGET loop, placing
- newly created loops into loop tree at the end of TARGETs sibling
- list in the original order. */
-void
-duplicate_subloops (class loop *loop, class loop *target)
-{
- class loop *aloop, *cloop, *tail;
-
- for (tail = target->inner; tail && tail->next; tail = tail->next)
- ;
- for (aloop = loop->inner; aloop; aloop = aloop->next)
- {
- cloop = duplicate_loop (aloop, target, tail);
- tail = cloop;
- gcc_assert(!tail->next);
- duplicate_subloops (aloop, cloop);
- }
-}
-
-/* Copies structure of subloops of N loops, stored in array COPIED_LOOPS,
- into TARGET loop, placing newly created loops into loop tree adding
- them to TARGETs sibling list at the end in order. */
-static void
-copy_loops_to (class loop **copied_loops, int n, class loop *target)
-{
- class loop *aloop, *tail;
- int i;
-
- for (tail = target->inner; tail && tail->next; tail = tail->next)
- ;
- for (i = 0; i < n; i++)
- {
- aloop = duplicate_loop (copied_loops[i], target, tail);
- tail = aloop;
- gcc_assert(!tail->next);
- duplicate_subloops (copied_loops[i], aloop);
- }
-}
-
-/* Redirects edge E to basic block DEST. */
-static void
-loop_redirect_edge (edge e, basic_block dest)
-{
- if (e->dest == dest)
- return;
-
- redirect_edge_and_branch_force (e, dest);
-}
-
-/* Check whether LOOP's body can be duplicated. */
-bool
-can_duplicate_loop_p (const class loop *loop)
-{
- int ret;
- basic_block *bbs = get_loop_body (loop);
-
- ret = can_copy_bbs_p (bbs, loop->num_nodes);
- free (bbs);
-
- return ret;
-}
-
-/* Duplicates body of LOOP to given edge E NDUPL times. Takes care of updating
- loop structure and dominators (order of inner subloops is retained).
- E's destination must be LOOP header for this to work, i.e. it must be entry
- or latch edge of this loop; these are unique, as the loops must have
- preheaders for this function to work correctly (in case E is latch, the
- function unrolls the loop, if E is entry edge, it peels the loop). Store
- edges created by copying ORIG edge from copies corresponding to set bits in
- WONT_EXIT bitmap (bit 0 corresponds to original LOOP body, the other copies
- are numbered in order given by control flow through them) into TO_REMOVE
- array. Returns false if duplication is
- impossible. */
-
-bool
-duplicate_loop_body_to_header_edge (class loop *loop, edge e,
- unsigned int ndupl, sbitmap wont_exit,
- edge orig, vec<edge> *to_remove, int flags)
-{
- class loop *target, *aloop;
- class loop **orig_loops;
- unsigned n_orig_loops;
- basic_block header = loop->header, latch = loop->latch;
- basic_block *new_bbs, *bbs, *first_active;
- basic_block new_bb, bb, first_active_latch = NULL;
- edge ae, latch_edge;
- edge spec_edges[2], new_spec_edges[2];
- const int SE_LATCH = 0;
- const int SE_ORIG = 1;
- unsigned i, j, n;
- int is_latch = (latch == e->src);
- profile_probability *scale_step = NULL;
- profile_probability scale_main = profile_probability::always ();
- profile_probability scale_act = profile_probability::always ();
- profile_count after_exit_num = profile_count::zero (),
- after_exit_den = profile_count::zero ();
- bool scale_after_exit = false;
- int add_irreducible_flag;
- basic_block place_after;
- bitmap bbs_to_scale = NULL;
- bitmap_iterator bi;
-
- gcc_assert (e->dest == loop->header);
- gcc_assert (ndupl > 0);
-
- if (orig)
- {
- /* Orig must be edge out of the loop. */
- gcc_assert (flow_bb_inside_loop_p (loop, orig->src));
- gcc_assert (!flow_bb_inside_loop_p (loop, orig->dest));
- }
-
- n = loop->num_nodes;
- bbs = get_loop_body_in_dom_order (loop);
- gcc_assert (bbs[0] == loop->header);
- gcc_assert (bbs[n - 1] == loop->latch);
-
- /* Check whether duplication is possible. */
- if (!can_copy_bbs_p (bbs, loop->num_nodes))
- {
- free (bbs);
- return false;
- }
- new_bbs = XNEWVEC (basic_block, loop->num_nodes);
-
- /* In case we are doing loop peeling and the loop is in the middle of
- irreducible region, the peeled copies will be inside it too. */
- add_irreducible_flag = e->flags & EDGE_IRREDUCIBLE_LOOP;
- gcc_assert (!is_latch || !add_irreducible_flag);
-
- /* Find edge from latch. */
- latch_edge = loop_latch_edge (loop);
-
- if (flags & DLTHE_FLAG_UPDATE_FREQ)
- {
- /* Calculate coefficients by that we have to scale counts
- of duplicated loop bodies. */
- profile_count count_in = header->count;
- profile_count count_le = latch_edge->count ();
- profile_count count_out_orig = orig ? orig->count () : count_in - count_le;
- profile_probability prob_pass_thru = count_le.probability_in (count_in);
- profile_probability prob_pass_wont_exit =
- (count_le + count_out_orig).probability_in (count_in);
-
- if (orig && orig->probability.initialized_p ()
- && !(orig->probability == profile_probability::always ()))
- {
- /* The blocks that are dominated by a removed exit edge ORIG have
- frequencies scaled by this. */
- if (orig->count ().initialized_p ())
- {
- after_exit_num = orig->src->count;
- after_exit_den = after_exit_num - orig->count ();
- scale_after_exit = true;
- }
- bbs_to_scale = BITMAP_ALLOC (NULL);
- for (i = 0; i < n; i++)
- {
- if (bbs[i] != orig->src
- && dominated_by_p (CDI_DOMINATORS, bbs[i], orig->src))
- bitmap_set_bit (bbs_to_scale, i);
- }
- }
-
- scale_step = XNEWVEC (profile_probability, ndupl);
-
- for (i = 1; i <= ndupl; i++)
- scale_step[i - 1] = bitmap_bit_p (wont_exit, i)
- ? prob_pass_wont_exit
- : prob_pass_thru;
-
- /* Complete peeling is special as the probability of exit in last
- copy becomes 1. */
- if (flags & DLTHE_FLAG_COMPLETTE_PEEL)
- {
- profile_count wanted_count = e->count ();
-
- gcc_assert (!is_latch);
- /* First copy has count of incoming edge. Each subsequent
- count should be reduced by prob_pass_wont_exit. Caller
- should've managed the flags so all except for original loop
- has won't exist set. */
- scale_act = wanted_count.probability_in (count_in);
- /* Now simulate the duplication adjustments and compute header
- frequency of the last copy. */
- for (i = 0; i < ndupl; i++)
- wanted_count = wanted_count.apply_probability (scale_step [i]);
- scale_main = wanted_count.probability_in (count_in);
- }
- /* Here we insert loop bodies inside the loop itself (for loop unrolling).
- First iteration will be original loop followed by duplicated bodies.
- It is necessary to scale down the original so we get right overall
- number of iterations. */
- else if (is_latch)
- {
- profile_probability prob_pass_main = bitmap_bit_p (wont_exit, 0)
- ? prob_pass_wont_exit
- : prob_pass_thru;
- profile_probability p = prob_pass_main;
- profile_count scale_main_den = count_in;
- for (i = 0; i < ndupl; i++)
- {
- scale_main_den += count_in.apply_probability (p);
- p = p * scale_step[i];
- }
- /* If original loop is executed COUNT_IN times, the unrolled
- loop will account SCALE_MAIN_DEN times. */
- scale_main = count_in.probability_in (scale_main_den);
- scale_act = scale_main * prob_pass_main;
- }
- else
- {
- profile_count preheader_count = e->count ();
- for (i = 0; i < ndupl; i++)
- scale_main = scale_main * scale_step[i];
- scale_act = preheader_count.probability_in (count_in);
- }
- }
-
- /* Loop the new bbs will belong to. */
- target = e->src->loop_father;
-
- /* Original loops. */
- n_orig_loops = 0;
- for (aloop = loop->inner; aloop; aloop = aloop->next)
- n_orig_loops++;
- orig_loops = XNEWVEC (class loop *, n_orig_loops);
- for (aloop = loop->inner, i = 0; aloop; aloop = aloop->next, i++)
- orig_loops[i] = aloop;
-
- set_loop_copy (loop, target);
-
- first_active = XNEWVEC (basic_block, n);
- if (is_latch)
- {
- memcpy (first_active, bbs, n * sizeof (basic_block));
- first_active_latch = latch;
- }
-
- spec_edges[SE_ORIG] = orig;
- spec_edges[SE_LATCH] = latch_edge;
-
- place_after = e->src;
- for (j = 0; j < ndupl; j++)
- {
- /* Copy loops. */
- copy_loops_to (orig_loops, n_orig_loops, target);
-
- /* Copy bbs. */
- copy_bbs (bbs, n, new_bbs, spec_edges, 2, new_spec_edges, loop,
- place_after, true);
- place_after = new_spec_edges[SE_LATCH]->src;
-
- if (flags & DLTHE_RECORD_COPY_NUMBER)
- for (i = 0; i < n; i++)
- {
- gcc_assert (!new_bbs[i]->aux);
- new_bbs[i]->aux = (void *)(size_t)(j + 1);
- }
-
- /* Note whether the blocks and edges belong to an irreducible loop. */
- if (add_irreducible_flag)
- {
- for (i = 0; i < n; i++)
- new_bbs[i]->flags |= BB_DUPLICATED;
- for (i = 0; i < n; i++)
- {
- edge_iterator ei;
- new_bb = new_bbs[i];
- if (new_bb->loop_father == target)
- new_bb->flags |= BB_IRREDUCIBLE_LOOP;
-
- FOR_EACH_EDGE (ae, ei, new_bb->succs)
- if ((ae->dest->flags & BB_DUPLICATED)
- && (ae->src->loop_father == target
- || ae->dest->loop_father == target))
- ae->flags |= EDGE_IRREDUCIBLE_LOOP;
- }
- for (i = 0; i < n; i++)
- new_bbs[i]->flags &= ~BB_DUPLICATED;
- }
-
- /* Redirect the special edges. */
- if (is_latch)
- {
- redirect_edge_and_branch_force (latch_edge, new_bbs[0]);
- redirect_edge_and_branch_force (new_spec_edges[SE_LATCH],
- loop->header);
- set_immediate_dominator (CDI_DOMINATORS, new_bbs[0], latch);
- latch = loop->latch = new_bbs[n - 1];
- e = latch_edge = new_spec_edges[SE_LATCH];
- }
- else
- {
- redirect_edge_and_branch_force (new_spec_edges[SE_LATCH],
- loop->header);
- redirect_edge_and_branch_force (e, new_bbs[0]);
- set_immediate_dominator (CDI_DOMINATORS, new_bbs[0], e->src);
- e = new_spec_edges[SE_LATCH];
- }
-
- /* Record exit edge in this copy. */
- if (orig && bitmap_bit_p (wont_exit, j + 1))
- {
- if (to_remove)
- to_remove->safe_push (new_spec_edges[SE_ORIG]);
- force_edge_cold (new_spec_edges[SE_ORIG], true);
-
- /* Scale the frequencies of the blocks dominated by the exit. */
- if (bbs_to_scale && scale_after_exit)
- {
- EXECUTE_IF_SET_IN_BITMAP (bbs_to_scale, 0, i, bi)
- scale_bbs_frequencies_profile_count (new_bbs + i, 1, after_exit_num,
- after_exit_den);
- }
- }
-
- /* Record the first copy in the control flow order if it is not
- the original loop (i.e. in case of peeling). */
- if (!first_active_latch)
- {
- memcpy (first_active, new_bbs, n * sizeof (basic_block));
- first_active_latch = new_bbs[n - 1];
- }
-
- /* Set counts and frequencies. */
- if (flags & DLTHE_FLAG_UPDATE_FREQ)
- {
- scale_bbs_frequencies (new_bbs, n, scale_act);
- scale_act = scale_act * scale_step[j];
- }
- }
- free (new_bbs);
- free (orig_loops);
-
- /* Record the exit edge in the original loop body, and update the frequencies. */
- if (orig && bitmap_bit_p (wont_exit, 0))
- {
- if (to_remove)
- to_remove->safe_push (orig);
- force_edge_cold (orig, true);
-
- /* Scale the frequencies of the blocks dominated by the exit. */
- if (bbs_to_scale && scale_after_exit)
- {
- EXECUTE_IF_SET_IN_BITMAP (bbs_to_scale, 0, i, bi)
- scale_bbs_frequencies_profile_count (bbs + i, 1, after_exit_num,
- after_exit_den);
- }
- }
-
- /* Update the original loop. */
- if (!is_latch)
- set_immediate_dominator (CDI_DOMINATORS, e->dest, e->src);
- if (flags & DLTHE_FLAG_UPDATE_FREQ)
- {
- scale_bbs_frequencies (bbs, n, scale_main);
- free (scale_step);
- }
-
- /* Update dominators of outer blocks if affected. */
- for (i = 0; i < n; i++)
- {
- basic_block dominated, dom_bb;
- unsigned j;
-
- bb = bbs[i];
- bb->aux = 0;
-
- auto_vec<basic_block> dom_bbs = get_dominated_by (CDI_DOMINATORS, bb);
- FOR_EACH_VEC_ELT (dom_bbs, j, dominated)
- {
- if (flow_bb_inside_loop_p (loop, dominated))
- continue;
- dom_bb = nearest_common_dominator (
- CDI_DOMINATORS, first_active[i], first_active_latch);
- set_immediate_dominator (CDI_DOMINATORS, dominated, dom_bb);
- }
- }
- free (first_active);
-
- free (bbs);
- BITMAP_FREE (bbs_to_scale);
-
- return true;
-}
-
-/* A callback for make_forwarder block, to redirect all edges except for
- MFB_KJ_EDGE to the entry part. E is the edge for that we should decide
- whether to redirect it. */
-
-edge mfb_kj_edge;
-bool
-mfb_keep_just (edge e)
-{
- return e != mfb_kj_edge;
-}
-
-/* True when a candidate preheader BLOCK has predecessors from LOOP. */
-
-static bool
-has_preds_from_loop (basic_block block, class loop *loop)
-{
- edge e;
- edge_iterator ei;
-
- FOR_EACH_EDGE (e, ei, block->preds)
- if (e->src->loop_father == loop)
- return true;
- return false;
-}
-
-/* Creates a pre-header for a LOOP. Returns newly created block. Unless
- CP_SIMPLE_PREHEADERS is set in FLAGS, we only force LOOP to have single
- entry; otherwise we also force preheader block to have only one successor.
- When CP_FALLTHRU_PREHEADERS is set in FLAGS, we force the preheader block
- to be a fallthru predecessor to the loop header and to have only
- predecessors from outside of the loop.
- The function also updates dominators. */
-
-basic_block
-create_preheader (class loop *loop, int flags)
-{
- edge e;
- basic_block dummy;
- int nentry = 0;
- bool irred = false;
- bool latch_edge_was_fallthru;
- edge one_succ_pred = NULL, single_entry = NULL;
- edge_iterator ei;
-
- FOR_EACH_EDGE (e, ei, loop->header->preds)
- {
- if (e->src == loop->latch)
- continue;
- irred |= (e->flags & EDGE_IRREDUCIBLE_LOOP) != 0;
- nentry++;
- single_entry = e;
- if (single_succ_p (e->src))
- one_succ_pred = e;
- }
- gcc_assert (nentry);
- if (nentry == 1)
- {
- bool need_forwarder_block = false;
-
- /* We do not allow entry block to be the loop preheader, since we
- cannot emit code there. */
- if (single_entry->src == ENTRY_BLOCK_PTR_FOR_FN (cfun))
- need_forwarder_block = true;
- else
- {
- /* If we want simple preheaders, also force the preheader to have
- just a single successor and a normal edge. */
- if ((flags & CP_SIMPLE_PREHEADERS)
- && ((single_entry->flags & EDGE_COMPLEX)
- || !single_succ_p (single_entry->src)))
- need_forwarder_block = true;
- /* If we want fallthru preheaders, also create forwarder block when
- preheader ends with a jump or has predecessors from loop. */
- else if ((flags & CP_FALLTHRU_PREHEADERS)
- && (JUMP_P (BB_END (single_entry->src))
- || has_preds_from_loop (single_entry->src, loop)))
- need_forwarder_block = true;
- }
- if (! need_forwarder_block)
- return NULL;
- }
-
- mfb_kj_edge = loop_latch_edge (loop);
- latch_edge_was_fallthru = (mfb_kj_edge->flags & EDGE_FALLTHRU) != 0;
- if (nentry == 1
- && ((flags & CP_FALLTHRU_PREHEADERS) == 0
- || (single_entry->flags & EDGE_CROSSING) == 0))
- dummy = split_edge (single_entry);
- else
- {
- edge fallthru = make_forwarder_block (loop->header, mfb_keep_just, NULL);
- dummy = fallthru->src;
- loop->header = fallthru->dest;
- }
-
- /* Try to be clever in placing the newly created preheader. The idea is to
- avoid breaking any "fallthruness" relationship between blocks.
-
- The preheader was created just before the header and all incoming edges
- to the header were redirected to the preheader, except the latch edge.
- So the only problematic case is when this latch edge was a fallthru
- edge: it is not anymore after the preheader creation so we have broken
- the fallthruness. We're therefore going to look for a better place. */
- if (latch_edge_was_fallthru)
- {
- if (one_succ_pred)
- e = one_succ_pred;
- else
- e = EDGE_PRED (dummy, 0);
-
- move_block_after (dummy, e->src);
- }
-
- if (irred)
- {
- dummy->flags |= BB_IRREDUCIBLE_LOOP;
- single_succ_edge (dummy)->flags |= EDGE_IRREDUCIBLE_LOOP;
- }
-
- if (dump_file)
- fprintf (dump_file, "Created preheader block for loop %i\n",
- loop->num);
-
- if (flags & CP_FALLTHRU_PREHEADERS)
- gcc_assert ((single_succ_edge (dummy)->flags & EDGE_FALLTHRU)
- && !JUMP_P (BB_END (dummy)));
-
- return dummy;
-}
-
-/* Create preheaders for each loop; for meaning of FLAGS see create_preheader. */
-
-void
-create_preheaders (int flags)
-{
- if (!current_loops)
- return;
-
- for (auto loop : loops_list (cfun, 0))
- create_preheader (loop, flags);
- loops_state_set (LOOPS_HAVE_PREHEADERS);
-}
-
-/* Forces all loop latches to have only single successor. */
-
-void
-force_single_succ_latches (void)
-{
- edge e;
-
- for (auto loop : loops_list (cfun, 0))
- {
- if (loop->latch != loop->header && single_succ_p (loop->latch))
- continue;
-
- e = find_edge (loop->latch, loop->header);
- gcc_checking_assert (e != NULL);
-
- split_edge (e);
- }
- loops_state_set (LOOPS_HAVE_SIMPLE_LATCHES);
-}
-
-/* This function is called from loop_version. It splits the entry edge
- of the loop we want to version, adds the versioning condition, and
- adjust the edges to the two versions of the loop appropriately.
- e is an incoming edge. Returns the basic block containing the
- condition.
-
- --- edge e ---- > [second_head]
-
- Split it and insert new conditional expression and adjust edges.
-
- --- edge e ---> [cond expr] ---> [first_head]
- |
- +---------> [second_head]
-
- THEN_PROB is the probability of then branch of the condition.
- ELSE_PROB is the probability of else branch. Note that they may be both
- REG_BR_PROB_BASE when condition is IFN_LOOP_VECTORIZED or
- IFN_LOOP_DIST_ALIAS. */
-
-static basic_block
-lv_adjust_loop_entry_edge (basic_block first_head, basic_block second_head,
- edge e, void *cond_expr,
- profile_probability then_prob,
- profile_probability else_prob)
-{
- basic_block new_head = NULL;
- edge e1;
-
- gcc_assert (e->dest == second_head);
-
- /* Split edge 'e'. This will create a new basic block, where we can
- insert conditional expr. */
- new_head = split_edge (e);
-
- lv_add_condition_to_bb (first_head, second_head, new_head,
- cond_expr);
-
- /* Don't set EDGE_TRUE_VALUE in RTL mode, as it's invalid there. */
- e = single_succ_edge (new_head);
- e1 = make_edge (new_head, first_head,
- current_ir_type () == IR_GIMPLE ? EDGE_TRUE_VALUE : 0);
- e1->probability = then_prob;
- e->probability = else_prob;
-
- set_immediate_dominator (CDI_DOMINATORS, first_head, new_head);
- set_immediate_dominator (CDI_DOMINATORS, second_head, new_head);
-
- /* Adjust loop header phi nodes. */
- lv_adjust_loop_header_phi (first_head, second_head, new_head, e1);
-
- return new_head;
-}
-
-/* Main entry point for Loop Versioning transformation.
-
- This transformation given a condition and a loop, creates
- -if (condition) { loop_copy1 } else { loop_copy2 },
- where loop_copy1 is the loop transformed in one way, and loop_copy2
- is the loop transformed in another way (or unchanged). COND_EXPR
- may be a run time test for things that were not resolved by static
- analysis (overlapping ranges (anti-aliasing), alignment, etc.).
-
- If non-NULL, CONDITION_BB is set to the basic block containing the
- condition.
-
- THEN_PROB is the probability of the then edge of the if. THEN_SCALE
- is the ratio by that the frequencies in the original loop should
- be scaled. ELSE_SCALE is the ratio by that the frequencies in the
- new loop should be scaled.
-
- If PLACE_AFTER is true, we place the new loop after LOOP in the
- instruction stream, otherwise it is placed before LOOP. */
-
-class loop *
-loop_version (class loop *loop,
- void *cond_expr, basic_block *condition_bb,
- profile_probability then_prob, profile_probability else_prob,
- profile_probability then_scale, profile_probability else_scale,
- bool place_after)
-{
- basic_block first_head, second_head;
- edge entry, latch_edge;
- int irred_flag;
- class loop *nloop;
- basic_block cond_bb;
-
- /* Record entry and latch edges for the loop */
- entry = loop_preheader_edge (loop);
- irred_flag = entry->flags & EDGE_IRREDUCIBLE_LOOP;
- entry->flags &= ~EDGE_IRREDUCIBLE_LOOP;
-
- /* Note down head of loop as first_head. */
- first_head = entry->dest;
-
- /* 1) Duplicate loop on the entry edge. */
- if (!cfg_hook_duplicate_loop_body_to_header_edge (loop, entry, 1, NULL, NULL,
- NULL, 0))
- {
- entry->flags |= irred_flag;
- return NULL;
- }
-
- /* 2) loopify the duplicated new loop. */
- latch_edge = single_succ_edge (get_bb_copy (loop->latch));
- nloop = alloc_loop ();
- class loop *outer = loop_outer (latch_edge->dest->loop_father);
- edge new_header_edge = single_pred_edge (get_bb_copy (loop->header));
- nloop->header = new_header_edge->dest;
- nloop->latch = latch_edge->src;
- loop_redirect_edge (latch_edge, nloop->header);
-
- /* Compute new loop. */
- add_loop (nloop, outer);
- copy_loop_info (loop, nloop);
- set_loop_copy (loop, nloop);
-
- /* loopify redirected latch_edge. Update its PENDING_STMTS. */
- lv_flush_pending_stmts (latch_edge);
-
- /* After duplication entry edge now points to new loop head block.
- Note down new head as second_head. */
- second_head = entry->dest;
-
- /* 3) Split loop entry edge and insert new block with cond expr. */
- cond_bb = lv_adjust_loop_entry_edge (first_head, second_head,
- entry, cond_expr, then_prob, else_prob);
- if (condition_bb)
- *condition_bb = cond_bb;
-
- if (!cond_bb)
- {
- entry->flags |= irred_flag;
- return NULL;
- }
-
- /* Add cond_bb to appropriate loop. */
- if (cond_bb->loop_father)
- remove_bb_from_loops (cond_bb);
- add_bb_to_loop (cond_bb, outer);
-
- /* 4) Scale the original loop and new loop frequency. */
- scale_loop_frequencies (loop, then_scale);
- scale_loop_frequencies (nloop, else_scale);
- update_dominators_in_loop (loop);
- update_dominators_in_loop (nloop);
-
- /* Adjust irreducible flag. */
- if (irred_flag)
- {
- cond_bb->flags |= BB_IRREDUCIBLE_LOOP;
- loop_preheader_edge (loop)->flags |= EDGE_IRREDUCIBLE_LOOP;
- loop_preheader_edge (nloop)->flags |= EDGE_IRREDUCIBLE_LOOP;
- single_pred_edge (cond_bb)->flags |= EDGE_IRREDUCIBLE_LOOP;
- }
-
- if (place_after)
- {
- basic_block *bbs = get_loop_body_in_dom_order (nloop), after;
- unsigned i;
-
- after = loop->latch;
-
- for (i = 0; i < nloop->num_nodes; i++)
- {
- move_block_after (bbs[i], after);
- after = bbs[i];
- }
- free (bbs);
- }
-
- /* At this point condition_bb is loop preheader with two successors,
- first_head and second_head. Make sure that loop preheader has only
- one successor. */
- split_edge (loop_preheader_edge (loop));
- split_edge (loop_preheader_edge (nloop));
-
- return nloop;
-}
generated by cgit v1.1 at 2025-09-03 10:56:38 +0000