aboutsummaryrefslogtreecommitdiff
path: root/gcc/cfgloop.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/cfgloop.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/cfgloop.c')
-rw-r--r--gcc/cfgloop.c2170
1 files changed, 0 insertions, 2170 deletions
diff --git a/gcc/cfgloop.c b/gcc/cfgloop.c
deleted file mode 100644
index 78fd6d5..0000000
--- a/gcc/cfgloop.c
+++ /dev/null
@@ -1,2170 +0,0 @@
-/* Natural loop discovery code for GNU compiler.
- Copyright (C) 2000-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 "gimple-ssa.h"
-#include "diagnostic-core.h"
-#include "cfganal.h"
-#include "cfgloop.h"
-#include "gimple-iterator.h"
-#include "dumpfile.h"
-
-static void flow_loops_cfg_dump (FILE *);
-
-/* Dump loop related CFG information. */
-
-static void
-flow_loops_cfg_dump (FILE *file)
-{
- basic_block bb;
-
- if (!file)
- return;
-
- FOR_EACH_BB_FN (bb, cfun)
- {
- edge succ;
- edge_iterator ei;
-
- fprintf (file, ";; %d succs { ", bb->index);
- FOR_EACH_EDGE (succ, ei, bb->succs)
- fprintf (file, "%d ", succ->dest->index);
- fprintf (file, "}\n");
- }
-}
-
-/* Return nonzero if the nodes of LOOP are a subset of OUTER. */
-
-bool
-flow_loop_nested_p (const class loop *outer, const class loop *loop)
-{
- unsigned odepth = loop_depth (outer);
-
- return (loop_depth (loop) > odepth
- && (*loop->superloops)[odepth] == outer);
-}
-
-/* Returns the loop such that LOOP is nested DEPTH (indexed from zero)
- loops within LOOP. */
-
-class loop *
-superloop_at_depth (class loop *loop, unsigned depth)
-{
- unsigned ldepth = loop_depth (loop);
-
- gcc_assert (depth <= ldepth);
-
- if (depth == ldepth)
- return loop;
-
- return (*loop->superloops)[depth];
-}
-
-/* Returns the list of the latch edges of LOOP. */
-
-static vec<edge>
-get_loop_latch_edges (const class loop *loop)
-{
- edge_iterator ei;
- edge e;
- vec<edge> ret = vNULL;
-
- FOR_EACH_EDGE (e, ei, loop->header->preds)
- {
- if (dominated_by_p (CDI_DOMINATORS, e->src, loop->header))
- ret.safe_push (e);
- }
-
- return ret;
-}
-
-/* Dump the loop information specified by LOOP to the stream FILE
- using auxiliary dump callback function LOOP_DUMP_AUX if non null. */
-
-void
-flow_loop_dump (const class loop *loop, FILE *file,
- void (*loop_dump_aux) (const class loop *, FILE *, int),
- int verbose)
-{
- basic_block *bbs;
- unsigned i;
- vec<edge> latches;
- edge e;
-
- if (! loop || ! loop->header)
- return;
-
- fprintf (file, ";;\n;; Loop %d\n", loop->num);
-
- fprintf (file, ";; header %d, ", loop->header->index);
- if (loop->latch)
- fprintf (file, "latch %d\n", loop->latch->index);
- else
- {
- fprintf (file, "multiple latches:");
- latches = get_loop_latch_edges (loop);
- FOR_EACH_VEC_ELT (latches, i, e)
- fprintf (file, " %d", e->src->index);
- latches.release ();
- fprintf (file, "\n");
- }
-
- fprintf (file, ";; depth %d, outer %ld\n",
- loop_depth (loop), (long) (loop_outer (loop)
- ? loop_outer (loop)->num : -1));
-
- if (loop->latch)
- {
- bool read_profile_p;
- gcov_type nit = expected_loop_iterations_unbounded (loop, &read_profile_p);
- if (read_profile_p && !loop->any_estimate)
- fprintf (file, ";; profile-based iteration count: %" PRIu64 "\n",
- (uint64_t) nit);
- }
-
- fprintf (file, ";; nodes:");
- bbs = get_loop_body (loop);
- for (i = 0; i < loop->num_nodes; i++)
- fprintf (file, " %d", bbs[i]->index);
- free (bbs);
- fprintf (file, "\n");
-
- if (loop_dump_aux)
- loop_dump_aux (loop, file, verbose);
-}
-
-/* Dump the loop information about loops to the stream FILE,
- using auxiliary dump callback function LOOP_DUMP_AUX if non null. */
-
-void
-flow_loops_dump (FILE *file, void (*loop_dump_aux) (const class loop *, FILE *, int), int verbose)
-{
- if (!current_loops || ! file)
- return;
-
- fprintf (file, ";; %d loops found\n", number_of_loops (cfun));
-
- for (auto loop : loops_list (cfun, LI_INCLUDE_ROOT))
- {
- flow_loop_dump (loop, file, loop_dump_aux, verbose);
- }
-
- if (verbose)
- flow_loops_cfg_dump (file);
-}
-
-/* Free data allocated for LOOP. */
-
-void
-flow_loop_free (class loop *loop)
-{
- struct loop_exit *exit, *next;
-
- vec_free (loop->superloops);
-
- /* Break the list of the loop exit records. They will be freed when the
- corresponding edge is rescanned or removed, and this avoids
- accessing the (already released) head of the list stored in the
- loop structure. */
- for (exit = loop->exits->next; exit != loop->exits; exit = next)
- {
- next = exit->next;
- exit->next = exit;
- exit->prev = exit;
- }
-
- ggc_free (loop->exits);
- ggc_free (loop);
-}
-
-/* Free all the memory allocated for LOOPS. */
-
-void
-flow_loops_free (struct loops *loops)
-{
- if (loops->larray)
- {
- unsigned i;
- loop_p loop;
-
- /* Free the loop descriptors. */
- FOR_EACH_VEC_SAFE_ELT (loops->larray, i, loop)
- {
- if (!loop)
- continue;
-
- flow_loop_free (loop);
- }
-
- vec_free (loops->larray);
- }
-}
-
-/* Find the nodes contained within the LOOP with header HEADER.
- Return the number of nodes within the loop. */
-
-int
-flow_loop_nodes_find (basic_block header, class loop *loop)
-{
- vec<basic_block> stack = vNULL;
- int num_nodes = 1;
- edge latch;
- edge_iterator latch_ei;
-
- header->loop_father = loop;
-
- FOR_EACH_EDGE (latch, latch_ei, loop->header->preds)
- {
- if (latch->src->loop_father == loop
- || !dominated_by_p (CDI_DOMINATORS, latch->src, loop->header))
- continue;
-
- num_nodes++;
- stack.safe_push (latch->src);
- latch->src->loop_father = loop;
-
- while (!stack.is_empty ())
- {
- basic_block node;
- edge e;
- edge_iterator ei;
-
- node = stack.pop ();
-
- FOR_EACH_EDGE (e, ei, node->preds)
- {
- basic_block ancestor = e->src;
-
- if (ancestor->loop_father != loop)
- {
- ancestor->loop_father = loop;
- num_nodes++;
- stack.safe_push (ancestor);
- }
- }
- }
- }
- stack.release ();
-
- return num_nodes;
-}
-
-/* Records the vector of superloops of the loop LOOP, whose immediate
- superloop is FATHER. */
-
-static void
-establish_preds (class loop *loop, class loop *father)
-{
- loop_p ploop;
- unsigned depth = loop_depth (father) + 1;
- unsigned i;
-
- loop->superloops = 0;
- vec_alloc (loop->superloops, depth);
- FOR_EACH_VEC_SAFE_ELT (father->superloops, i, ploop)
- loop->superloops->quick_push (ploop);
- loop->superloops->quick_push (father);
-
- for (ploop = loop->inner; ploop; ploop = ploop->next)
- establish_preds (ploop, loop);
-}
-
-/* Add LOOP to the loop hierarchy tree where FATHER is father of the
- added loop. If LOOP has some children, take care of that their
- pred field will be initialized correctly. If AFTER is non-null
- then it's expected it's a pointer into FATHERs inner sibling
- list and LOOP is added behind AFTER, otherwise it's added in front
- of FATHERs siblings. */
-
-void
-flow_loop_tree_node_add (class loop *father, class loop *loop,
- class loop *after)
-{
- if (after)
- {
- loop->next = after->next;
- after->next = loop;
- }
- else
- {
- loop->next = father->inner;
- father->inner = loop;
- }
-
- establish_preds (loop, father);
-}
-
-/* Remove LOOP from the loop hierarchy tree. */
-
-void
-flow_loop_tree_node_remove (class loop *loop)
-{
- class loop *prev, *father;
-
- father = loop_outer (loop);
-
- /* Remove loop from the list of sons. */
- if (father->inner == loop)
- father->inner = loop->next;
- else
- {
- for (prev = father->inner; prev->next != loop; prev = prev->next)
- continue;
- prev->next = loop->next;
- }
-
- loop->superloops = NULL;
-}
-
-/* Allocates and returns new loop structure. */
-
-class loop *
-alloc_loop (void)
-{
- class loop *loop = ggc_cleared_alloc<class loop> ();
-
- loop->exits = ggc_cleared_alloc<loop_exit> ();
- loop->exits->next = loop->exits->prev = loop->exits;
- loop->can_be_parallel = false;
- loop->constraints = 0;
- loop->nb_iterations_upper_bound = 0;
- loop->nb_iterations_likely_upper_bound = 0;
- loop->nb_iterations_estimate = 0;
- return loop;
-}
-
-/* Initializes loops structure LOOPS, reserving place for NUM_LOOPS loops
- (including the root of the loop tree). */
-
-void
-init_loops_structure (struct function *fn,
- struct loops *loops, unsigned num_loops)
-{
- class loop *root;
-
- memset (loops, 0, sizeof *loops);
- vec_alloc (loops->larray, num_loops);
-
- /* Dummy loop containing whole function. */
- root = alloc_loop ();
- root->num_nodes = n_basic_blocks_for_fn (fn);
- root->latch = EXIT_BLOCK_PTR_FOR_FN (fn);
- root->header = ENTRY_BLOCK_PTR_FOR_FN (fn);
- ENTRY_BLOCK_PTR_FOR_FN (fn)->loop_father = root;
- EXIT_BLOCK_PTR_FOR_FN (fn)->loop_father = root;
-
- loops->larray->quick_push (root);
- loops->tree_root = root;
-}
-
-/* Returns whether HEADER is a loop header. */
-
-bool
-bb_loop_header_p (basic_block header)
-{
- edge_iterator ei;
- edge e;
-
- /* If we have an abnormal predecessor, do not consider the
- loop (not worth the problems). */
- if (bb_has_abnormal_pred (header))
- return false;
-
- /* Look for back edges where a predecessor is dominated
- by this block. A natural loop has a single entry
- node (header) that dominates all the nodes in the
- loop. It also has single back edge to the header
- from a latch node. */
- FOR_EACH_EDGE (e, ei, header->preds)
- {
- basic_block latch = e->src;
- if (latch != ENTRY_BLOCK_PTR_FOR_FN (cfun)
- && dominated_by_p (CDI_DOMINATORS, latch, header))
- return true;
- }
-
- return false;
-}
-
-/* Find all the natural loops in the function and save in LOOPS structure and
- recalculate loop_father information in basic block structures.
- If LOOPS is non-NULL then the loop structures for already recorded loops
- will be re-used and their number will not change. We assume that no
- stale loops exist in LOOPS.
- When LOOPS is NULL it is allocated and re-built from scratch.
- Return the built LOOPS structure. */
-
-struct loops *
-flow_loops_find (struct loops *loops)
-{
- bool from_scratch = (loops == NULL);
- int *rc_order;
- int b;
- unsigned i;
-
- /* Ensure that the dominators are computed. */
- calculate_dominance_info (CDI_DOMINATORS);
-
- if (!loops)
- {
- loops = ggc_cleared_alloc<struct loops> ();
- init_loops_structure (cfun, loops, 1);
- }
-
- /* Ensure that loop exits were released. */
- gcc_assert (loops->exits == NULL);
-
- /* Taking care of this degenerate case makes the rest of
- this code simpler. */
- if (n_basic_blocks_for_fn (cfun) == NUM_FIXED_BLOCKS)
- return loops;
-
- /* The root loop node contains all basic-blocks. */
- loops->tree_root->num_nodes = n_basic_blocks_for_fn (cfun);
-
- /* Compute depth first search order of the CFG so that outer
- natural loops will be found before inner natural loops. */
- rc_order = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
- pre_and_rev_post_order_compute (NULL, rc_order, false);
-
- /* Gather all loop headers in reverse completion order and allocate
- loop structures for loops that are not already present. */
- auto_vec<loop_p> larray (loops->larray->length ());
- for (b = 0; b < n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS; b++)
- {
- basic_block header = BASIC_BLOCK_FOR_FN (cfun, rc_order[b]);
- if (bb_loop_header_p (header))
- {
- class loop *loop;
-
- /* The current active loop tree has valid loop-fathers for
- header blocks. */
- if (!from_scratch
- && header->loop_father->header == header)
- {
- loop = header->loop_father;
- /* If we found an existing loop remove it from the
- loop tree. It is going to be inserted again
- below. */
- flow_loop_tree_node_remove (loop);
- }
- else
- {
- /* Otherwise allocate a new loop structure for the loop. */
- loop = alloc_loop ();
- /* ??? We could re-use unused loop slots here. */
- loop->num = loops->larray->length ();
- vec_safe_push (loops->larray, loop);
- loop->header = header;
-
- if (!from_scratch
- && dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "flow_loops_find: discovered new "
- "loop %d with header %d\n",
- loop->num, header->index);
- }
- /* Reset latch, we recompute it below. */
- loop->latch = NULL;
- larray.safe_push (loop);
- }
-
- /* Make blocks part of the loop root node at start. */
- header->loop_father = loops->tree_root;
- }
-
- free (rc_order);
-
- /* Now iterate over the loops found, insert them into the loop tree
- and assign basic-block ownership. */
- for (i = 0; i < larray.length (); ++i)
- {
- class loop *loop = larray[i];
- basic_block header = loop->header;
- edge_iterator ei;
- edge e;
-
- flow_loop_tree_node_add (header->loop_father, loop);
- loop->num_nodes = flow_loop_nodes_find (loop->header, loop);
-
- /* Look for the latch for this header block, if it has just a
- single one. */
- FOR_EACH_EDGE (e, ei, header->preds)
- {
- basic_block latch = e->src;
-
- if (flow_bb_inside_loop_p (loop, latch))
- {
- if (loop->latch != NULL)
- {
- /* More than one latch edge. */
- loop->latch = NULL;
- break;
- }
- loop->latch = latch;
- }
- }
- }
-
- return loops;
-}
-
-/* qsort helper for sort_sibling_loops. */
-
-static int *sort_sibling_loops_cmp_rpo;
-static int
-sort_sibling_loops_cmp (const void *la_, const void *lb_)
-{
- const class loop *la = *(const class loop * const *)la_;
- const class loop *lb = *(const class loop * const *)lb_;
- return (sort_sibling_loops_cmp_rpo[la->header->index]
- - sort_sibling_loops_cmp_rpo[lb->header->index]);
-}
-
-/* Sort sibling loops in RPO order. */
-
-void
-sort_sibling_loops (function *fn)
-{
- /* Match flow_loops_find in the order we sort sibling loops. */
- sort_sibling_loops_cmp_rpo = XNEWVEC (int, last_basic_block_for_fn (cfun));
- int *rc_order = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
- pre_and_rev_post_order_compute_fn (fn, NULL, rc_order, false);
- for (int i = 0; i < n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS; ++i)
- sort_sibling_loops_cmp_rpo[rc_order[i]] = i;
- free (rc_order);
-
- auto_vec<loop_p, 3> siblings;
- for (auto loop : loops_list (fn, LI_INCLUDE_ROOT))
- if (loop->inner && loop->inner->next)
- {
- loop_p sibling = loop->inner;
- do
- {
- siblings.safe_push (sibling);
- sibling = sibling->next;
- }
- while (sibling);
- siblings.qsort (sort_sibling_loops_cmp);
- loop_p *siblingp = &loop->inner;
- for (unsigned i = 0; i < siblings.length (); ++i)
- {
- *siblingp = siblings[i];
- siblingp = &(*siblingp)->next;
- }
- *siblingp = NULL;
- siblings.truncate (0);
- }
-
- free (sort_sibling_loops_cmp_rpo);
- sort_sibling_loops_cmp_rpo = NULL;
-}
-
-/* Ratio of frequencies of edges so that one of more latch edges is
- considered to belong to inner loop with same header. */
-#define HEAVY_EDGE_RATIO 8
-
-/* Minimum number of samples for that we apply
- find_subloop_latch_edge_by_profile heuristics. */
-#define HEAVY_EDGE_MIN_SAMPLES 10
-
-/* If the profile info is available, finds an edge in LATCHES that much more
- frequent than the remaining edges. Returns such an edge, or NULL if we do
- not find one.
-
- We do not use guessed profile here, only the measured one. The guessed
- profile is usually too flat and unreliable for this (and it is mostly based
- on the loop structure of the program, so it does not make much sense to
- derive the loop structure from it). */
-
-static edge
-find_subloop_latch_edge_by_profile (vec<edge> latches)
-{
- unsigned i;
- edge e, me = NULL;
- profile_count mcount = profile_count::zero (), tcount = profile_count::zero ();
-
- FOR_EACH_VEC_ELT (latches, i, e)
- {
- if (e->count ()> mcount)
- {
- me = e;
- mcount = e->count();
- }
- tcount += e->count();
- }
-
- if (!tcount.initialized_p () || !(tcount.ipa () > HEAVY_EDGE_MIN_SAMPLES)
- || (tcount - mcount).apply_scale (HEAVY_EDGE_RATIO, 1) > tcount)
- return NULL;
-
- if (dump_file)
- fprintf (dump_file,
- "Found latch edge %d -> %d using profile information.\n",
- me->src->index, me->dest->index);
- return me;
-}
-
-/* Among LATCHES, guesses a latch edge of LOOP corresponding to subloop, based
- on the structure of induction variables. Returns this edge, or NULL if we
- do not find any.
-
- We are quite conservative, and look just for an obvious simple innermost
- loop (which is the case where we would lose the most performance by not
- disambiguating the loop). More precisely, we look for the following
- situation: The source of the chosen latch edge dominates sources of all
- the other latch edges. Additionally, the header does not contain a phi node
- such that the argument from the chosen edge is equal to the argument from
- another edge. */
-
-static edge
-find_subloop_latch_edge_by_ivs (class loop *loop ATTRIBUTE_UNUSED, vec<edge> latches)
-{
- edge e, latch = latches[0];
- unsigned i;
- gphi *phi;
- gphi_iterator psi;
- tree lop;
- basic_block bb;
-
- /* Find the candidate for the latch edge. */
- for (i = 1; latches.iterate (i, &e); i++)
- if (dominated_by_p (CDI_DOMINATORS, latch->src, e->src))
- latch = e;
-
- /* Verify that it dominates all the latch edges. */
- FOR_EACH_VEC_ELT (latches, i, e)
- if (!dominated_by_p (CDI_DOMINATORS, e->src, latch->src))
- return NULL;
-
- /* Check for a phi node that would deny that this is a latch edge of
- a subloop. */
- for (psi = gsi_start_phis (loop->header); !gsi_end_p (psi); gsi_next (&psi))
- {
- phi = psi.phi ();
- lop = PHI_ARG_DEF_FROM_EDGE (phi, latch);
-
- /* Ignore the values that are not changed inside the subloop. */
- if (TREE_CODE (lop) != SSA_NAME
- || SSA_NAME_DEF_STMT (lop) == phi)
- continue;
- bb = gimple_bb (SSA_NAME_DEF_STMT (lop));
- if (!bb || !flow_bb_inside_loop_p (loop, bb))
- continue;
-
- FOR_EACH_VEC_ELT (latches, i, e)
- if (e != latch
- && PHI_ARG_DEF_FROM_EDGE (phi, e) == lop)
- return NULL;
- }
-
- if (dump_file)
- fprintf (dump_file,
- "Found latch edge %d -> %d using iv structure.\n",
- latch->src->index, latch->dest->index);
- return latch;
-}
-
-/* If we can determine that one of the several latch edges of LOOP behaves
- as a latch edge of a separate subloop, returns this edge. Otherwise
- returns NULL. */
-
-static edge
-find_subloop_latch_edge (class loop *loop)
-{
- vec<edge> latches = get_loop_latch_edges (loop);
- edge latch = NULL;
-
- if (latches.length () > 1)
- {
- latch = find_subloop_latch_edge_by_profile (latches);
-
- if (!latch
- /* We consider ivs to guess the latch edge only in SSA. Perhaps we
- should use cfghook for this, but it is hard to imagine it would
- be useful elsewhere. */
- && current_ir_type () == IR_GIMPLE)
- latch = find_subloop_latch_edge_by_ivs (loop, latches);
- }
-
- latches.release ();
- return latch;
-}
-
-/* Callback for make_forwarder_block. Returns true if the edge E is marked
- in the set MFB_REIS_SET. */
-
-static hash_set<edge> *mfb_reis_set;
-static bool
-mfb_redirect_edges_in_set (edge e)
-{
- return mfb_reis_set->contains (e);
-}
-
-/* Creates a subloop of LOOP with latch edge LATCH. */
-
-static void
-form_subloop (class loop *loop, edge latch)
-{
- edge_iterator ei;
- edge e, new_entry;
- class loop *new_loop;
-
- mfb_reis_set = new hash_set<edge>;
- FOR_EACH_EDGE (e, ei, loop->header->preds)
- {
- if (e != latch)
- mfb_reis_set->add (e);
- }
- new_entry = make_forwarder_block (loop->header, mfb_redirect_edges_in_set,
- NULL);
- delete mfb_reis_set;
-
- loop->header = new_entry->src;
-
- /* Find the blocks and subloops that belong to the new loop, and add it to
- the appropriate place in the loop tree. */
- new_loop = alloc_loop ();
- new_loop->header = new_entry->dest;
- new_loop->latch = latch->src;
- add_loop (new_loop, loop);
-}
-
-/* Make all the latch edges of LOOP to go to a single forwarder block --
- a new latch of LOOP. */
-
-static void
-merge_latch_edges (class loop *loop)
-{
- vec<edge> latches = get_loop_latch_edges (loop);
- edge latch, e;
- unsigned i;
-
- gcc_assert (latches.length () > 0);
-
- if (latches.length () == 1)
- loop->latch = latches[0]->src;
- else
- {
- if (dump_file)
- fprintf (dump_file, "Merged latch edges of loop %d\n", loop->num);
-
- mfb_reis_set = new hash_set<edge>;
- FOR_EACH_VEC_ELT (latches, i, e)
- mfb_reis_set->add (e);
- latch = make_forwarder_block (loop->header, mfb_redirect_edges_in_set,
- NULL);
- delete mfb_reis_set;
-
- loop->header = latch->dest;
- loop->latch = latch->src;
- }
-
- latches.release ();
-}
-
-/* LOOP may have several latch edges. Transform it into (possibly several)
- loops with single latch edge. */
-
-static void
-disambiguate_multiple_latches (class loop *loop)
-{
- edge e;
-
- /* We eliminate the multiple latches by splitting the header to the forwarder
- block F and the rest R, and redirecting the edges. There are two cases:
-
- 1) If there is a latch edge E that corresponds to a subloop (we guess
- that based on profile -- if it is taken much more often than the
- remaining edges; and on trees, using the information about induction
- variables of the loops), we redirect E to R, all the remaining edges to
- F, then rescan the loops and try again for the outer loop.
- 2) If there is no such edge, we redirect all latch edges to F, and the
- entry edges to R, thus making F the single latch of the loop. */
-
- if (dump_file)
- fprintf (dump_file, "Disambiguating loop %d with multiple latches\n",
- loop->num);
-
- /* During latch merging, we may need to redirect the entry edges to a new
- block. This would cause problems if the entry edge was the one from the
- entry block. To avoid having to handle this case specially, split
- such entry edge. */
- e = find_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun), loop->header);
- if (e)
- split_edge (e);
-
- while (1)
- {
- e = find_subloop_latch_edge (loop);
- if (!e)
- break;
-
- form_subloop (loop, e);
- }
-
- merge_latch_edges (loop);
-}
-
-/* Split loops with multiple latch edges. */
-
-void
-disambiguate_loops_with_multiple_latches (void)
-{
- for (auto loop : loops_list (cfun, 0))
- {
- if (!loop->latch)
- disambiguate_multiple_latches (loop);
- }
-}
-
-/* Return nonzero if basic block BB belongs to LOOP. */
-bool
-flow_bb_inside_loop_p (const class loop *loop, const_basic_block bb)
-{
- class loop *source_loop;
-
- if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)
- || bb == EXIT_BLOCK_PTR_FOR_FN (cfun))
- return 0;
-
- source_loop = bb->loop_father;
- return loop == source_loop || flow_loop_nested_p (loop, source_loop);
-}
-
-/* Enumeration predicate for get_loop_body_with_size. */
-static bool
-glb_enum_p (const_basic_block bb, const void *glb_loop)
-{
- const class loop *const loop = (const class loop *) glb_loop;
- return (bb != loop->header
- && dominated_by_p (CDI_DOMINATORS, bb, loop->header));
-}
-
-/* Gets basic blocks of a LOOP. Header is the 0-th block, rest is in dfs
- order against direction of edges from latch. Specially, if
- header != latch, latch is the 1-st block. LOOP cannot be the fake
- loop tree root, and its size must be at most MAX_SIZE. The blocks
- in the LOOP body are stored to BODY, and the size of the LOOP is
- returned. */
-
-unsigned
-get_loop_body_with_size (const class loop *loop, basic_block *body,
- unsigned max_size)
-{
- return dfs_enumerate_from (loop->header, 1, glb_enum_p,
- body, max_size, loop);
-}
-
-/* Gets basic blocks of a LOOP. Header is the 0-th block, rest is in dfs
- order against direction of edges from latch. Specially, if
- header != latch, latch is the 1-st block. */
-
-basic_block *
-get_loop_body (const class loop *loop)
-{
- basic_block *body, bb;
- unsigned tv = 0;
-
- gcc_assert (loop->num_nodes);
-
- body = XNEWVEC (basic_block, loop->num_nodes);
-
- if (loop->latch == EXIT_BLOCK_PTR_FOR_FN (cfun))
- {
- /* There may be blocks unreachable from EXIT_BLOCK, hence we need to
- special-case the fake loop that contains the whole function. */
- gcc_assert (loop->num_nodes == (unsigned) n_basic_blocks_for_fn (cfun));
- body[tv++] = loop->header;
- body[tv++] = EXIT_BLOCK_PTR_FOR_FN (cfun);
- FOR_EACH_BB_FN (bb, cfun)
- body[tv++] = bb;
- }
- else
- tv = get_loop_body_with_size (loop, body, loop->num_nodes);
-
- gcc_assert (tv == loop->num_nodes);
- return body;
-}
-
-/* Fills dominance descendants inside LOOP of the basic block BB into
- array TOVISIT from index *TV. */
-
-static void
-fill_sons_in_loop (const class loop *loop, basic_block bb,
- basic_block *tovisit, int *tv)
-{
- basic_block son, postpone = NULL;
-
- tovisit[(*tv)++] = bb;
- for (son = first_dom_son (CDI_DOMINATORS, bb);
- son;
- son = next_dom_son (CDI_DOMINATORS, son))
- {
- if (!flow_bb_inside_loop_p (loop, son))
- continue;
-
- if (dominated_by_p (CDI_DOMINATORS, loop->latch, son))
- {
- postpone = son;
- continue;
- }
- fill_sons_in_loop (loop, son, tovisit, tv);
- }
-
- if (postpone)
- fill_sons_in_loop (loop, postpone, tovisit, tv);
-}
-
-/* Gets body of a LOOP (that must be different from the outermost loop)
- sorted by dominance relation. Additionally, if a basic block s dominates
- the latch, then only blocks dominated by s are be after it. */
-
-basic_block *
-get_loop_body_in_dom_order (const class loop *loop)
-{
- basic_block *tovisit;
- int tv;
-
- gcc_assert (loop->num_nodes);
-
- tovisit = XNEWVEC (basic_block, loop->num_nodes);
-
- gcc_assert (loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun));
-
- tv = 0;
- fill_sons_in_loop (loop, loop->header, tovisit, &tv);
-
- gcc_assert (tv == (int) loop->num_nodes);
-
- return tovisit;
-}
-
-/* Gets body of a LOOP sorted via provided BB_COMPARATOR. */
-
-basic_block *
-get_loop_body_in_custom_order (const class loop *loop,
- int (*bb_comparator) (const void *, const void *))
-{
- basic_block *bbs = get_loop_body (loop);
-
- qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator);
-
- return bbs;
-}
-
-/* Same as above, but use gcc_sort_r instead of qsort. */
-
-basic_block *
-get_loop_body_in_custom_order (const class loop *loop, void *data,
- int (*bb_comparator) (const void *, const void *, void *))
-{
- basic_block *bbs = get_loop_body (loop);
-
- gcc_sort_r (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator, data);
-
- return bbs;
-}
-
-/* Get body of a LOOP in breadth first sort order. */
-
-basic_block *
-get_loop_body_in_bfs_order (const class loop *loop)
-{
- basic_block *blocks;
- basic_block bb;
- unsigned int i = 1;
- unsigned int vc = 0;
-
- gcc_assert (loop->num_nodes);
- gcc_assert (loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun));
-
- blocks = XNEWVEC (basic_block, loop->num_nodes);
- auto_bitmap visited;
- blocks[0] = loop->header;
- bitmap_set_bit (visited, loop->header->index);
- while (i < loop->num_nodes)
- {
- edge e;
- edge_iterator ei;
- gcc_assert (i > vc);
- bb = blocks[vc++];
-
- FOR_EACH_EDGE (e, ei, bb->succs)
- {
- if (flow_bb_inside_loop_p (loop, e->dest))
- {
- /* This bb is now visited. */
- if (bitmap_set_bit (visited, e->dest->index))
- blocks[i++] = e->dest;
- }
- }
- }
-
- return blocks;
-}
-
-/* Hash function for struct loop_exit. */
-
-hashval_t
-loop_exit_hasher::hash (loop_exit *exit)
-{
- return htab_hash_pointer (exit->e);
-}
-
-/* Equality function for struct loop_exit. Compares with edge. */
-
-bool
-loop_exit_hasher::equal (loop_exit *exit, edge e)
-{
- return exit->e == e;
-}
-
-/* Frees the list of loop exit descriptions EX. */
-
-void
-loop_exit_hasher::remove (loop_exit *exit)
-{
- loop_exit *next;
- for (; exit; exit = next)
- {
- next = exit->next_e;
-
- exit->next->prev = exit->prev;
- exit->prev->next = exit->next;
-
- ggc_free (exit);
- }
-}
-
-/* Returns the list of records for E as an exit of a loop. */
-
-static struct loop_exit *
-get_exit_descriptions (edge e)
-{
- return current_loops->exits->find_with_hash (e, htab_hash_pointer (e));
-}
-
-/* Updates the lists of loop exits in that E appears.
- If REMOVED is true, E is being removed, and we
- just remove it from the lists of exits.
- If NEW_EDGE is true and E is not a loop exit, we
- do not try to remove it from loop exit lists. */
-
-void
-rescan_loop_exit (edge e, bool new_edge, bool removed)
-{
- struct loop_exit *exits = NULL, *exit;
- class loop *aloop, *cloop;
-
- if (!loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
- return;
-
- if (!removed
- && e->src->loop_father != NULL
- && e->dest->loop_father != NULL
- && !flow_bb_inside_loop_p (e->src->loop_father, e->dest))
- {
- cloop = find_common_loop (e->src->loop_father, e->dest->loop_father);
- for (aloop = e->src->loop_father;
- aloop != cloop;
- aloop = loop_outer (aloop))
- {
- exit = ggc_alloc<loop_exit> ();
- exit->e = e;
-
- exit->next = aloop->exits->next;
- exit->prev = aloop->exits;
- exit->next->prev = exit;
- exit->prev->next = exit;
-
- exit->next_e = exits;
- exits = exit;
- }
- }
-
- if (!exits && new_edge)
- return;
-
- loop_exit **slot
- = current_loops->exits->find_slot_with_hash (e, htab_hash_pointer (e),
- exits ? INSERT : NO_INSERT);
- if (!slot)
- return;
-
- if (exits)
- {
- if (*slot)
- loop_exit_hasher::remove (*slot);
- *slot = exits;
- }
- else
- current_loops->exits->clear_slot (slot);
-}
-
-/* For each loop, record list of exit edges, and start maintaining these
- lists. */
-
-void
-record_loop_exits (void)
-{
- basic_block bb;
- edge_iterator ei;
- edge e;
-
- if (!current_loops)
- return;
-
- if (loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
- return;
- loops_state_set (LOOPS_HAVE_RECORDED_EXITS);
-
- gcc_assert (current_loops->exits == NULL);
- current_loops->exits
- = hash_table<loop_exit_hasher>::create_ggc (2 * number_of_loops (cfun));
-
- FOR_EACH_BB_FN (bb, cfun)
- {
- FOR_EACH_EDGE (e, ei, bb->succs)
- {
- rescan_loop_exit (e, true, false);
- }
- }
-}
-
-/* Dumps information about the exit in *SLOT to FILE.
- Callback for htab_traverse. */
-
-int
-dump_recorded_exit (loop_exit **slot, FILE *file)
-{
- struct loop_exit *exit = *slot;
- unsigned n = 0;
- edge e = exit->e;
-
- for (; exit != NULL; exit = exit->next_e)
- n++;
-
- fprintf (file, "Edge %d->%d exits %u loops\n",
- e->src->index, e->dest->index, n);
-
- return 1;
-}
-
-/* Dumps the recorded exits of loops to FILE. */
-
-extern void dump_recorded_exits (FILE *);
-void
-dump_recorded_exits (FILE *file)
-{
- if (!current_loops->exits)
- return;
- current_loops->exits->traverse<FILE *, dump_recorded_exit> (file);
-}
-
-/* Releases lists of loop exits. */
-
-void
-release_recorded_exits (function *fn)
-{
- gcc_assert (loops_state_satisfies_p (fn, LOOPS_HAVE_RECORDED_EXITS));
- loops_for_fn (fn)->exits->empty ();
- loops_for_fn (fn)->exits = NULL;
- loops_state_clear (fn, LOOPS_HAVE_RECORDED_EXITS);
-}
-
-/* Returns the list of the exit edges of a LOOP. */
-
-auto_vec<edge>
-get_loop_exit_edges (const class loop *loop, basic_block *body)
-{
- auto_vec<edge> edges;
- edge e;
- unsigned i;
- edge_iterator ei;
- struct loop_exit *exit;
-
- gcc_assert (loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun));
-
- /* If we maintain the lists of exits, use them. Otherwise we must
- scan the body of the loop. */
- if (loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
- {
- for (exit = loop->exits->next; exit->e; exit = exit->next)
- edges.safe_push (exit->e);
- }
- else
- {
- bool body_from_caller = true;
- if (!body)
- {
- body = get_loop_body (loop);
- body_from_caller = false;
- }
- for (i = 0; i < loop->num_nodes; i++)
- FOR_EACH_EDGE (e, ei, body[i]->succs)
- {
- if (!flow_bb_inside_loop_p (loop, e->dest))
- edges.safe_push (e);
- }
- if (!body_from_caller)
- free (body);
- }
-
- return edges;
-}
-
-/* Counts the number of conditional branches inside LOOP. */
-
-unsigned
-num_loop_branches (const class loop *loop)
-{
- unsigned i, n;
- basic_block * body;
-
- gcc_assert (loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun));
-
- body = get_loop_body (loop);
- n = 0;
- for (i = 0; i < loop->num_nodes; i++)
- if (EDGE_COUNT (body[i]->succs) >= 2)
- n++;
- free (body);
-
- return n;
-}
-
-/* Adds basic block BB to LOOP. */
-void
-add_bb_to_loop (basic_block bb, class loop *loop)
-{
- unsigned i;
- loop_p ploop;
- edge_iterator ei;
- edge e;
-
- gcc_assert (bb->loop_father == NULL);
- bb->loop_father = loop;
- loop->num_nodes++;
- FOR_EACH_VEC_SAFE_ELT (loop->superloops, i, ploop)
- ploop->num_nodes++;
-
- FOR_EACH_EDGE (e, ei, bb->succs)
- {
- rescan_loop_exit (e, true, false);
- }
- FOR_EACH_EDGE (e, ei, bb->preds)
- {
- rescan_loop_exit (e, true, false);
- }
-}
-
-/* Remove basic block BB from loops. */
-void
-remove_bb_from_loops (basic_block bb)
-{
- unsigned i;
- class loop *loop = bb->loop_father;
- loop_p ploop;
- edge_iterator ei;
- edge e;
-
- gcc_assert (loop != NULL);
- loop->num_nodes--;
- FOR_EACH_VEC_SAFE_ELT (loop->superloops, i, ploop)
- ploop->num_nodes--;
- bb->loop_father = NULL;
-
- FOR_EACH_EDGE (e, ei, bb->succs)
- {
- rescan_loop_exit (e, false, true);
- }
- FOR_EACH_EDGE (e, ei, bb->preds)
- {
- rescan_loop_exit (e, false, true);
- }
-}
-
-/* Finds nearest common ancestor in loop tree for given loops. */
-class loop *
-find_common_loop (class loop *loop_s, class loop *loop_d)
-{
- unsigned sdepth, ddepth;
-
- if (!loop_s) return loop_d;
- if (!loop_d) return loop_s;
-
- sdepth = loop_depth (loop_s);
- ddepth = loop_depth (loop_d);
-
- if (sdepth < ddepth)
- loop_d = (*loop_d->superloops)[sdepth];
- else if (sdepth > ddepth)
- loop_s = (*loop_s->superloops)[ddepth];
-
- while (loop_s != loop_d)
- {
- loop_s = loop_outer (loop_s);
- loop_d = loop_outer (loop_d);
- }
- return loop_s;
-}
-
-/* Removes LOOP from structures and frees its data. */
-
-void
-delete_loop (class loop *loop)
-{
- /* Remove the loop from structure. */
- flow_loop_tree_node_remove (loop);
-
- /* Remove loop from loops array. */
- (*current_loops->larray)[loop->num] = NULL;
-
- /* Free loop data. */
- flow_loop_free (loop);
-}
-
-/* Cancels the LOOP; it must be innermost one. */
-
-static void
-cancel_loop (class loop *loop)
-{
- basic_block *bbs;
- unsigned i;
- class loop *outer = loop_outer (loop);
-
- gcc_assert (!loop->inner);
-
- /* Move blocks up one level (they should be removed as soon as possible). */
- bbs = get_loop_body (loop);
- for (i = 0; i < loop->num_nodes; i++)
- bbs[i]->loop_father = outer;
-
- free (bbs);
- delete_loop (loop);
-}
-
-/* Cancels LOOP and all its subloops. */
-void
-cancel_loop_tree (class loop *loop)
-{
- while (loop->inner)
- cancel_loop_tree (loop->inner);
- cancel_loop (loop);
-}
-
-/* Disable warnings about missing quoting in GCC diagnostics for
- the verification errors. Their format strings don't follow GCC
- diagnostic conventions and the calls are ultimately followed by
- a deliberate ICE triggered by a failed assertion. */
-#if __GNUC__ >= 10
-# pragma GCC diagnostic push
-# pragma GCC diagnostic ignored "-Wformat-diag"
-#endif
-
-/* Checks that information about loops is correct
- -- sizes of loops are all right
- -- results of get_loop_body really belong to the loop
- -- loop header have just single entry edge and single latch edge
- -- loop latches have only single successor that is header of their loop
- -- irreducible loops are correctly marked
- -- the cached loop depth and loop father of each bb is correct
- */
-DEBUG_FUNCTION void
-verify_loop_structure (void)
-{
- unsigned *sizes, i, j;
- basic_block bb, *bbs;
- int err = 0;
- edge e;
- unsigned num = number_of_loops (cfun);
- struct loop_exit *exit, *mexit;
- bool dom_available = dom_info_available_p (CDI_DOMINATORS);
-
- if (loops_state_satisfies_p (LOOPS_NEED_FIXUP))
- {
- error ("loop verification on loop tree that needs fixup");
- err = 1;
- }
-
- /* We need up-to-date dominators, compute or verify them. */
- if (!dom_available)
- calculate_dominance_info (CDI_DOMINATORS);
- else
- verify_dominators (CDI_DOMINATORS);
-
- /* Check the loop tree root. */
- if (current_loops->tree_root->header != ENTRY_BLOCK_PTR_FOR_FN (cfun)
- || current_loops->tree_root->latch != EXIT_BLOCK_PTR_FOR_FN (cfun)
- || (current_loops->tree_root->num_nodes
- != (unsigned) n_basic_blocks_for_fn (cfun)))
- {
- error ("corrupt loop tree root");
- err = 1;
- }
-
- /* Check the headers. */
- FOR_EACH_BB_FN (bb, cfun)
- if (bb_loop_header_p (bb))
- {
- if (bb->loop_father->header == NULL)
- {
- error ("loop with header %d marked for removal", bb->index);
- err = 1;
- }
- else if (bb->loop_father->header != bb)
- {
- error ("loop with header %d not in loop tree", bb->index);
- err = 1;
- }
- }
- else if (bb->loop_father->header == bb)
- {
- error ("non-loop with header %d not marked for removal", bb->index);
- err = 1;
- }
-
- /* Check the recorded loop father and sizes of loops. */
- auto_sbitmap visited (last_basic_block_for_fn (cfun));
- bitmap_clear (visited);
- bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
- for (auto loop : loops_list (cfun, LI_FROM_INNERMOST))
- {
- unsigned n;
-
- if (loop->header == NULL)
- {
- error ("removed loop %d in loop tree", loop->num);
- err = 1;
- continue;
- }
-
- n = get_loop_body_with_size (loop, bbs, n_basic_blocks_for_fn (cfun));
- if (loop->num_nodes != n)
- {
- error ("size of loop %d should be %d, not %d",
- loop->num, n, loop->num_nodes);
- err = 1;
- }
-
- for (j = 0; j < n; j++)
- {
- bb = bbs[j];
-
- if (!flow_bb_inside_loop_p (loop, bb))
- {
- error ("bb %d does not belong to loop %d",
- bb->index, loop->num);
- err = 1;
- }
-
- /* Ignore this block if it is in an inner loop. */
- if (bitmap_bit_p (visited, bb->index))
- continue;
- bitmap_set_bit (visited, bb->index);
-
- if (bb->loop_father != loop)
- {
- error ("bb %d has father loop %d, should be loop %d",
- bb->index, bb->loop_father->num, loop->num);
- err = 1;
- }
- }
- }
- free (bbs);
-
- /* Check headers and latches. */
- for (auto loop : loops_list (cfun, 0))
- {
- i = loop->num;
- if (loop->header == NULL)
- continue;
- if (!bb_loop_header_p (loop->header))
- {
- error ("loop %d%'s header is not a loop header", i);
- err = 1;
- }
- if (loops_state_satisfies_p (LOOPS_HAVE_PREHEADERS)
- && EDGE_COUNT (loop->header->preds) != 2)
- {
- error ("loop %d%'s header does not have exactly 2 entries", i);
- err = 1;
- }
- if (loop->latch)
- {
- if (!find_edge (loop->latch, loop->header))
- {
- error ("loop %d%'s latch does not have an edge to its header", i);
- err = 1;
- }
- if (!dominated_by_p (CDI_DOMINATORS, loop->latch, loop->header))
- {
- error ("loop %d%'s latch is not dominated by its header", i);
- err = 1;
- }
- }
- if (loops_state_satisfies_p (LOOPS_HAVE_SIMPLE_LATCHES))
- {
- if (!single_succ_p (loop->latch))
- {
- error ("loop %d%'s latch does not have exactly 1 successor", i);
- err = 1;
- }
- if (single_succ (loop->latch) != loop->header)
- {
- error ("loop %d%'s latch does not have header as successor", i);
- err = 1;
- }
- if (loop->latch->loop_father != loop)
- {
- error ("loop %d%'s latch does not belong directly to it", i);
- err = 1;
- }
- }
- if (loop->header->loop_father != loop)
- {
- error ("loop %d%'s header does not belong directly to it", i);
- err = 1;
- }
- if (loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS))
- {
- edge_iterator ei;
- FOR_EACH_EDGE (e, ei, loop->header->preds)
- if (dominated_by_p (CDI_DOMINATORS, e->src, loop->header)
- && e->flags & EDGE_IRREDUCIBLE_LOOP)
- {
- error ("loop %d%'s latch is marked as part of irreducible"
- " region", i);
- err = 1;
- }
- }
- }
-
- /* Check irreducible loops. */
- if (loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS))
- {
- auto_edge_flag saved_edge_irr (cfun);
- auto_bb_flag saved_bb_irr (cfun);
- /* Save old info. */
- FOR_EACH_BB_FN (bb, cfun)
- {
- edge_iterator ei;
- if (bb->flags & BB_IRREDUCIBLE_LOOP)
- bb->flags |= saved_bb_irr;
- FOR_EACH_EDGE (e, ei, bb->succs)
- if (e->flags & EDGE_IRREDUCIBLE_LOOP)
- e->flags |= saved_edge_irr;
- }
-
- /* Recount it. */
- mark_irreducible_loops ();
-
- /* Compare. */
- FOR_EACH_BB_FN (bb, cfun)
- {
- edge_iterator ei;
-
- if ((bb->flags & BB_IRREDUCIBLE_LOOP)
- && !(bb->flags & saved_bb_irr))
- {
- error ("basic block %d should be marked irreducible", bb->index);
- err = 1;
- }
- else if (!(bb->flags & BB_IRREDUCIBLE_LOOP)
- && (bb->flags & saved_bb_irr))
- {
- error ("basic block %d should not be marked irreducible", bb->index);
- err = 1;
- }
- bb->flags &= ~saved_bb_irr;
- FOR_EACH_EDGE (e, ei, bb->succs)
- {
- if ((e->flags & EDGE_IRREDUCIBLE_LOOP)
- && !(e->flags & saved_edge_irr))
- {
- error ("edge from %d to %d should be marked irreducible",
- e->src->index, e->dest->index);
- err = 1;
- }
- else if (!(e->flags & EDGE_IRREDUCIBLE_LOOP)
- && (e->flags & saved_edge_irr))
- {
- error ("edge from %d to %d should not be marked irreducible",
- e->src->index, e->dest->index);
- err = 1;
- }
- e->flags &= ~saved_edge_irr;
- }
- }
- }
-
- /* Check the recorded loop exits. */
- for (auto loop : loops_list (cfun, 0))
- {
- if (!loop->exits || loop->exits->e != NULL)
- {
- error ("corrupted head of the exits list of loop %d",
- loop->num);
- err = 1;
- }
- else
- {
- /* Check that the list forms a cycle, and all elements except
- for the head are nonnull. */
- for (mexit = loop->exits, exit = mexit->next, i = 0;
- exit->e && exit != mexit;
- exit = exit->next)
- {
- if (i++ & 1)
- mexit = mexit->next;
- }
-
- if (exit != loop->exits)
- {
- error ("corrupted exits list of loop %d", loop->num);
- err = 1;
- }
- }
-
- if (!loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
- {
- if (loop->exits->next != loop->exits)
- {
- error ("nonempty exits list of loop %d, but exits are not recorded",
- loop->num);
- err = 1;
- }
- }
- }
-
- if (loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
- {
- unsigned n_exits = 0, eloops;
-
- sizes = XCNEWVEC (unsigned, num);
- memset (sizes, 0, sizeof (unsigned) * num);
- FOR_EACH_BB_FN (bb, cfun)
- {
- edge_iterator ei;
- if (bb->loop_father == current_loops->tree_root)
- continue;
- FOR_EACH_EDGE (e, ei, bb->succs)
- {
- if (flow_bb_inside_loop_p (bb->loop_father, e->dest))
- continue;
-
- n_exits++;
- exit = get_exit_descriptions (e);
- if (!exit)
- {
- error ("exit %d->%d not recorded",
- e->src->index, e->dest->index);
- err = 1;
- }
- eloops = 0;
- for (; exit; exit = exit->next_e)
- eloops++;
-
- for (class loop *loop = bb->loop_father;
- loop != e->dest->loop_father
- /* When a loop exit is also an entry edge which
- can happen when avoiding CFG manipulations
- then the last loop exited is the outer loop
- of the loop entered. */
- && loop != loop_outer (e->dest->loop_father);
- loop = loop_outer (loop))
- {
- eloops--;
- sizes[loop->num]++;
- }
-
- if (eloops != 0)
- {
- error ("wrong list of exited loops for edge %d->%d",
- e->src->index, e->dest->index);
- err = 1;
- }
- }
- }
-
- if (n_exits != current_loops->exits->elements ())
- {
- error ("too many loop exits recorded");
- err = 1;
- }
-
- for (auto loop : loops_list (cfun, 0))
- {
- eloops = 0;
- for (exit = loop->exits->next; exit->e; exit = exit->next)
- eloops++;
- if (eloops != sizes[loop->num])
- {
- error ("%d exits recorded for loop %d (having %d exits)",
- eloops, loop->num, sizes[loop->num]);
- err = 1;
- }
- }
-
- free (sizes);
- }
-
- gcc_assert (!err);
-
- if (!dom_available)
- free_dominance_info (CDI_DOMINATORS);
-}
-
-#if __GNUC__ >= 10
-# pragma GCC diagnostic pop
-#endif
-
-/* Returns latch edge of LOOP. */
-edge
-loop_latch_edge (const class loop *loop)
-{
- return find_edge (loop->latch, loop->header);
-}
-
-/* Returns preheader edge of LOOP. */
-edge
-loop_preheader_edge (const class loop *loop)
-{
- edge e;
- edge_iterator ei;
-
- gcc_assert (loops_state_satisfies_p (LOOPS_HAVE_PREHEADERS)
- && ! loops_state_satisfies_p (LOOPS_MAY_HAVE_MULTIPLE_LATCHES));
-
- FOR_EACH_EDGE (e, ei, loop->header->preds)
- if (e->src != loop->latch)
- break;
-
- if (! e)
- {
- gcc_assert (! loop_outer (loop));
- return single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun));
- }
-
- return e;
-}
-
-/* Returns true if E is an exit of LOOP. */
-
-bool
-loop_exit_edge_p (const class loop *loop, const_edge e)
-{
- return (flow_bb_inside_loop_p (loop, e->src)
- && !flow_bb_inside_loop_p (loop, e->dest));
-}
-
-/* Returns the single exit edge of LOOP, or NULL if LOOP has either no exit
- or more than one exit. If loops do not have the exits recorded, NULL
- is returned always. */
-
-edge
-single_exit (const class loop *loop)
-{
- struct loop_exit *exit = loop->exits->next;
-
- if (!loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
- return NULL;
-
- if (exit->e && exit->next == loop->exits)
- return exit->e;
- else
- return NULL;
-}
-
-/* Returns true when BB has an incoming edge exiting LOOP. */
-
-bool
-loop_exits_to_bb_p (class loop *loop, basic_block bb)
-{
- edge e;
- edge_iterator ei;
-
- FOR_EACH_EDGE (e, ei, bb->preds)
- if (loop_exit_edge_p (loop, e))
- return true;
-
- return false;
-}
-
-/* Returns true when BB has an outgoing edge exiting LOOP. */
-
-bool
-loop_exits_from_bb_p (class loop *loop, basic_block bb)
-{
- edge e;
- edge_iterator ei;
-
- FOR_EACH_EDGE (e, ei, bb->succs)
- if (loop_exit_edge_p (loop, e))
- return true;
-
- return false;
-}
-
-/* Return location corresponding to the loop control condition if possible. */
-
-dump_user_location_t
-get_loop_location (class loop *loop)
-{
- rtx_insn *insn = NULL;
- class niter_desc *desc = NULL;
- edge exit;
-
- /* For a for or while loop, we would like to return the location
- of the for or while statement, if possible. To do this, look
- for the branch guarding the loop back-edge. */
-
- /* If this is a simple loop with an in_edge, then the loop control
- branch is typically at the end of its source. */
- desc = get_simple_loop_desc (loop);
- if (desc->in_edge)
- {
- FOR_BB_INSNS_REVERSE (desc->in_edge->src, insn)
- {
- if (INSN_P (insn) && INSN_HAS_LOCATION (insn))
- return insn;
- }
- }
- /* If loop has a single exit, then the loop control branch
- must be at the end of its source. */
- if ((exit = single_exit (loop)))
- {
- FOR_BB_INSNS_REVERSE (exit->src, insn)
- {
- if (INSN_P (insn) && INSN_HAS_LOCATION (insn))
- return insn;
- }
- }
- /* Next check the latch, to see if it is non-empty. */
- FOR_BB_INSNS_REVERSE (loop->latch, insn)
- {
- if (INSN_P (insn) && INSN_HAS_LOCATION (insn))
- return insn;
- }
- /* Finally, if none of the above identifies the loop control branch,
- return the first location in the loop header. */
- FOR_BB_INSNS (loop->header, insn)
- {
- if (INSN_P (insn) && INSN_HAS_LOCATION (insn))
- return insn;
- }
- /* If all else fails, simply return the current function location. */
- return dump_user_location_t::from_function_decl (current_function_decl);
-}
-
-/* Records that every statement in LOOP is executed I_BOUND times.
- REALISTIC is true if I_BOUND is expected to be close to the real number
- of iterations. UPPER is true if we are sure the loop iterates at most
- I_BOUND times. */
-
-void
-record_niter_bound (class loop *loop, const widest_int &i_bound,
- bool realistic, bool upper)
-{
- /* Update the bounds only when there is no previous estimation, or when the
- current estimation is smaller. */
- if (upper
- && (!loop->any_upper_bound
- || wi::ltu_p (i_bound, loop->nb_iterations_upper_bound)))
- {
- loop->any_upper_bound = true;
- loop->nb_iterations_upper_bound = i_bound;
- if (!loop->any_likely_upper_bound)
- {
- loop->any_likely_upper_bound = true;
- loop->nb_iterations_likely_upper_bound = i_bound;
- }
- }
- if (realistic
- && (!loop->any_estimate
- || wi::ltu_p (i_bound, loop->nb_iterations_estimate)))
- {
- loop->any_estimate = true;
- loop->nb_iterations_estimate = i_bound;
- }
- if (!realistic
- && (!loop->any_likely_upper_bound
- || wi::ltu_p (i_bound, loop->nb_iterations_likely_upper_bound)))
- {
- loop->any_likely_upper_bound = true;
- loop->nb_iterations_likely_upper_bound = i_bound;
- }
-
- /* If an upper bound is smaller than the realistic estimate of the
- number of iterations, use the upper bound instead. */
- if (loop->any_upper_bound
- && loop->any_estimate
- && wi::ltu_p (loop->nb_iterations_upper_bound,
- loop->nb_iterations_estimate))
- loop->nb_iterations_estimate = loop->nb_iterations_upper_bound;
- if (loop->any_upper_bound
- && loop->any_likely_upper_bound
- && wi::ltu_p (loop->nb_iterations_upper_bound,
- loop->nb_iterations_likely_upper_bound))
- loop->nb_iterations_likely_upper_bound = loop->nb_iterations_upper_bound;
-}
-
-/* Similar to get_estimated_loop_iterations, but returns the estimate only
- if it fits to HOST_WIDE_INT. If this is not the case, or the estimate
- on the number of iterations of LOOP could not be derived, returns -1. */
-
-HOST_WIDE_INT
-get_estimated_loop_iterations_int (class loop *loop)
-{
- widest_int nit;
- HOST_WIDE_INT hwi_nit;
-
- if (!get_estimated_loop_iterations (loop, &nit))
- return -1;
-
- if (!wi::fits_shwi_p (nit))
- return -1;
- hwi_nit = nit.to_shwi ();
-
- return hwi_nit < 0 ? -1 : hwi_nit;
-}
-
-/* Returns an upper bound on the number of executions of statements
- in the LOOP. For statements before the loop exit, this exceeds
- the number of execution of the latch by one. */
-
-HOST_WIDE_INT
-max_stmt_executions_int (class loop *loop)
-{
- HOST_WIDE_INT nit = get_max_loop_iterations_int (loop);
- HOST_WIDE_INT snit;
-
- if (nit == -1)
- return -1;
-
- snit = (HOST_WIDE_INT) ((unsigned HOST_WIDE_INT) nit + 1);
-
- /* If the computation overflows, return -1. */
- return snit < 0 ? -1 : snit;
-}
-
-/* Returns an likely upper bound on the number of executions of statements
- in the LOOP. For statements before the loop exit, this exceeds
- the number of execution of the latch by one. */
-
-HOST_WIDE_INT
-likely_max_stmt_executions_int (class loop *loop)
-{
- HOST_WIDE_INT nit = get_likely_max_loop_iterations_int (loop);
- HOST_WIDE_INT snit;
-
- if (nit == -1)
- return -1;
-
- snit = (HOST_WIDE_INT) ((unsigned HOST_WIDE_INT) nit + 1);
-
- /* If the computation overflows, return -1. */
- return snit < 0 ? -1 : snit;
-}
-
-/* Sets NIT to the estimated number of executions of the latch of the
- LOOP. If we have no reliable estimate, the function returns false, otherwise
- returns true. */
-
-bool
-get_estimated_loop_iterations (class loop *loop, widest_int *nit)
-{
- /* Even if the bound is not recorded, possibly we can derrive one from
- profile. */
- if (!loop->any_estimate)
- {
- if (loop->header->count.reliable_p ())
- {
- *nit = gcov_type_to_wide_int
- (expected_loop_iterations_unbounded (loop) + 1);
- return true;
- }
- return false;
- }
-
- *nit = loop->nb_iterations_estimate;
- return true;
-}
-
-/* Sets NIT to an upper bound for the maximum number of executions of the
- latch of the LOOP. If we have no reliable estimate, the function returns
- false, otherwise returns true. */
-
-bool
-get_max_loop_iterations (const class loop *loop, widest_int *nit)
-{
- if (!loop->any_upper_bound)
- return false;
-
- *nit = loop->nb_iterations_upper_bound;
- return true;
-}
-
-/* Similar to get_max_loop_iterations, but returns the estimate only
- if it fits to HOST_WIDE_INT. If this is not the case, or the estimate
- on the number of iterations of LOOP could not be derived, returns -1. */
-
-HOST_WIDE_INT
-get_max_loop_iterations_int (const class loop *loop)
-{
- widest_int nit;
- HOST_WIDE_INT hwi_nit;
-
- if (!get_max_loop_iterations (loop, &nit))
- return -1;
-
- if (!wi::fits_shwi_p (nit))
- return -1;
- hwi_nit = nit.to_shwi ();
-
- return hwi_nit < 0 ? -1 : hwi_nit;
-}
-
-/* Sets NIT to an upper bound for the maximum number of executions of the
- latch of the LOOP. If we have no reliable estimate, the function returns
- false, otherwise returns true. */
-
-bool
-get_likely_max_loop_iterations (class loop *loop, widest_int *nit)
-{
- if (!loop->any_likely_upper_bound)
- return false;
-
- *nit = loop->nb_iterations_likely_upper_bound;
- return true;
-}
-
-/* Similar to get_max_loop_iterations, but returns the estimate only
- if it fits to HOST_WIDE_INT. If this is not the case, or the estimate
- on the number of iterations of LOOP could not be derived, returns -1. */
-
-HOST_WIDE_INT
-get_likely_max_loop_iterations_int (class loop *loop)
-{
- widest_int nit;
- HOST_WIDE_INT hwi_nit;
-
- if (!get_likely_max_loop_iterations (loop, &nit))
- return -1;
-
- if (!wi::fits_shwi_p (nit))
- return -1;
- hwi_nit = nit.to_shwi ();
-
- return hwi_nit < 0 ? -1 : hwi_nit;
-}
-
-/* Returns the loop depth of the loop BB belongs to. */
-
-int
-bb_loop_depth (const_basic_block bb)
-{
- return bb->loop_father ? loop_depth (bb->loop_father) : 0;
-}
-
-/* Marks LOOP for removal and sets LOOPS_NEED_FIXUP. */
-
-void
-mark_loop_for_removal (loop_p loop)
-{
- if (loop->header == NULL)
- return;
- loop->former_header = loop->header;
- loop->header = NULL;
- loop->latch = NULL;
- loops_state_set (LOOPS_NEED_FIXUP);
-}
-
-/* Starting from loop tree ROOT, walk loop tree as the visiting
- order specified by FLAGS. The supported visiting orders
- are:
- - LI_ONLY_INNERMOST
- - LI_FROM_INNERMOST
- - Preorder (if neither of above is specified) */
-
-void
-loops_list::walk_loop_tree (class loop *root, unsigned flags)
-{
- bool only_innermost_p = flags & LI_ONLY_INNERMOST;
- bool from_innermost_p = flags & LI_FROM_INNERMOST;
- bool preorder_p = !(only_innermost_p || from_innermost_p);
-
- /* Early handle root without any inner loops, make later
- processing simpler, that is all loops processed in the
- following while loop are impossible to be root. */
- if (!root->inner)
- {
- if (flags & LI_INCLUDE_ROOT)
- this->to_visit.quick_push (root->num);
- return;
- }
- else if (preorder_p && flags & LI_INCLUDE_ROOT)
- this->to_visit.quick_push (root->num);
-
- class loop *aloop;
- for (aloop = root->inner;
- aloop->inner != NULL;
- aloop = aloop->inner)
- {
- if (preorder_p)
- this->to_visit.quick_push (aloop->num);
- continue;
- }
-
- while (1)
- {
- gcc_assert (aloop != root);
- if (from_innermost_p || aloop->inner == NULL)
- this->to_visit.quick_push (aloop->num);
-
- if (aloop->next)
- {
- for (aloop = aloop->next;
- aloop->inner != NULL;
- aloop = aloop->inner)
- {
- if (preorder_p)
- this->to_visit.quick_push (aloop->num);
- continue;
- }
- }
- else if (loop_outer (aloop) == root)
- break;
- else
- aloop = loop_outer (aloop);
- }
-
- /* When visiting from innermost, we need to consider root here
- since the previous while loop doesn't handle it. */
- if (from_innermost_p && flags & LI_INCLUDE_ROOT)
- this->to_visit.quick_push (root->num);
-}
-
generated by cgit v1.1 at 2025-08-19 15:10:00 +0000