aboutsummaryrefslogtreecommitdiff
path: root/gcc/reg-stack.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/reg-stack.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/reg-stack.c')
-rw-r--r--gcc/reg-stack.c3484
1 files changed, 0 insertions, 3484 deletions
diff --git a/gcc/reg-stack.c b/gcc/reg-stack.c
deleted file mode 100644
index 27b3271..0000000
--- a/gcc/reg-stack.c
+++ /dev/null
@@ -1,3484 +0,0 @@
-/* Register to Stack convert for GNU compiler.
- Copyright (C) 1992-2022 Free Software Foundation, Inc.
-
- This file is part of GCC.
-
- GCC is free software; you can redistribute it and/or modify it
- under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 3, or (at your option)
- any later version.
-
- GCC is distributed in the hope that it will be useful, but WITHOUT
- ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
- License for more details.
-
- You should have received a copy of the GNU General Public License
- along with GCC; see the file COPYING3. If not see
- <http://www.gnu.org/licenses/>. */
-
-/* This pass converts stack-like registers from the "flat register
- file" model that gcc uses, to a stack convention that the 387 uses.
-
- * The form of the input:
-
- On input, the function consists of insn that have had their
- registers fully allocated to a set of "virtual" registers. Note that
- the word "virtual" is used differently here than elsewhere in gcc: for
- each virtual stack reg, there is a hard reg, but the mapping between
- them is not known until this pass is run. On output, hard register
- numbers have been substituted, and various pop and exchange insns have
- been emitted. The hard register numbers and the virtual register
- numbers completely overlap - before this pass, all stack register
- numbers are virtual, and afterward they are all hard.
-
- The virtual registers can be manipulated normally by gcc, and their
- semantics are the same as for normal registers. After the hard
- register numbers are substituted, the semantics of an insn containing
- stack-like regs are not the same as for an insn with normal regs: for
- instance, it is not safe to delete an insn that appears to be a no-op
- move. In general, no insn containing hard regs should be changed
- after this pass is done.
-
- * The form of the output:
-
- After this pass, hard register numbers represent the distance from
- the current top of stack to the desired register. A reference to
- FIRST_STACK_REG references the top of stack, FIRST_STACK_REG + 1,
- represents the register just below that, and so forth. Also, REG_DEAD
- notes indicate whether or not a stack register should be popped.
-
- A "swap" insn looks like a parallel of two patterns, where each
- pattern is a SET: one sets A to B, the other B to A.
-
- A "push" or "load" insn is a SET whose SET_DEST is FIRST_STACK_REG
- and whose SET_DEST is REG or MEM. Any other SET_DEST, such as PLUS,
- will replace the existing stack top, not push a new value.
-
- A store insn is a SET whose SET_DEST is FIRST_STACK_REG, and whose
- SET_SRC is REG or MEM.
-
- The case where the SET_SRC and SET_DEST are both FIRST_STACK_REG
- appears ambiguous. As a special case, the presence of a REG_DEAD note
- for FIRST_STACK_REG differentiates between a load insn and a pop.
-
- If a REG_DEAD is present, the insn represents a "pop" that discards
- the top of the register stack. If there is no REG_DEAD note, then the
- insn represents a "dup" or a push of the current top of stack onto the
- stack.
-
- * Methodology:
-
- Existing REG_DEAD and REG_UNUSED notes for stack registers are
- deleted and recreated from scratch. REG_DEAD is never created for a
- SET_DEST, only REG_UNUSED.
-
- * asm_operands:
-
- There are several rules on the usage of stack-like regs in
- asm_operands insns. These rules apply only to the operands that are
- stack-like regs:
-
- 1. Given a set of input regs that die in an asm_operands, it is
- necessary to know which are implicitly popped by the asm, and
- which must be explicitly popped by gcc.
-
- An input reg that is implicitly popped by the asm must be
- explicitly clobbered, unless it is constrained to match an
- output operand.
-
- 2. For any input reg that is implicitly popped by an asm, it is
- necessary to know how to adjust the stack to compensate for the pop.
- If any non-popped input is closer to the top of the reg-stack than
- the implicitly popped reg, it would not be possible to know what the
- stack looked like - it's not clear how the rest of the stack "slides
- up".
-
- All implicitly popped input regs must be closer to the top of
- the reg-stack than any input that is not implicitly popped.
-
- All explicitly referenced input operands may not "skip" a reg.
- Otherwise we can have holes in the stack.
-
- 3. It is possible that if an input dies in an insn, reload might
- use the input reg for an output reload. Consider this example:
-
- asm ("foo" : "=t" (a) : "f" (b));
-
- This asm says that input B is not popped by the asm, and that
- the asm pushes a result onto the reg-stack, i.e., the stack is one
- deeper after the asm than it was before. But, it is possible that
- reload will think that it can use the same reg for both the input and
- the output, if input B dies in this insn.
-
- If any input operand uses the "f" constraint, all output reg
- constraints must use the "&" earlyclobber.
-
- The asm above would be written as
-
- asm ("foo" : "=&t" (a) : "f" (b));
-
- 4. Some operands need to be in particular places on the stack. All
- output operands fall in this category - there is no other way to
- know which regs the outputs appear in unless the user indicates
- this in the constraints.
-
- Output operands must specifically indicate which reg an output
- appears in after an asm. "=f" is not allowed: the operand
- constraints must select a class with a single reg.
-
- 5. Output operands may not be "inserted" between existing stack regs.
- Since no 387 opcode uses a read/write operand, all output operands
- are dead before the asm_operands, and are pushed by the asm_operands.
- It makes no sense to push anywhere but the top of the reg-stack.
-
- Output operands must start at the top of the reg-stack: output
- operands may not "skip" a reg.
-
- 6. Some asm statements may need extra stack space for internal
- calculations. This can be guaranteed by clobbering stack registers
- unrelated to the inputs and outputs.
-
- Here are a couple of reasonable asms to want to write. This asm
- takes one input, which is internally popped, and produces two outputs.
-
- asm ("fsincos" : "=t" (cos), "=u" (sin) : "0" (inp));
-
- This asm takes two inputs, which are popped by the fyl2xp1 opcode,
- and replaces them with one output. The user must code the "st(1)"
- clobber for reg-stack.c to know that fyl2xp1 pops both inputs.
-
- asm ("fyl2xp1" : "=t" (result) : "0" (x), "u" (y) : "st(1)");
-
-*/
-
-#include "config.h"
-#include "system.h"
-#include "coretypes.h"
-#include "backend.h"
-#include "target.h"
-#include "rtl.h"
-#include "tree.h"
-#include "df.h"
-#include "insn-config.h"
-#include "memmodel.h"
-#include "regs.h"
-#include "emit-rtl.h" /* FIXME: Can go away once crtl is moved to rtl.h. */
-#include "recog.h"
-#include "varasm.h"
-#include "rtl-error.h"
-#include "cfgrtl.h"
-#include "cfganal.h"
-#include "cfgbuild.h"
-#include "cfgcleanup.h"
-#include "reload.h"
-#include "tree-pass.h"
-#include "rtl-iter.h"
-#include "function-abi.h"
-
-#ifdef STACK_REGS
-
-/* We use this array to cache info about insns, because otherwise we
- spend too much time in stack_regs_mentioned_p.
-
- Indexed by insn UIDs. A value of zero is uninitialized, one indicates
- the insn uses stack registers, two indicates the insn does not use
- stack registers. */
-static vec<char> stack_regs_mentioned_data;
-
-#define REG_STACK_SIZE (LAST_STACK_REG - FIRST_STACK_REG + 1)
-
-int regstack_completed = 0;
-
-/* This is the basic stack record. TOP is an index into REG[] such
- that REG[TOP] is the top of stack. If TOP is -1 the stack is empty.
-
- If TOP is -2, REG[] is not yet initialized. Stack initialization
- consists of placing each live reg in array `reg' and setting `top'
- appropriately.
-
- REG_SET indicates which registers are live. */
-
-typedef struct stack_def
-{
- int top; /* index to top stack element */
- HARD_REG_SET reg_set; /* set of live registers */
- unsigned char reg[REG_STACK_SIZE];/* register - stack mapping */
-} *stack_ptr;
-
-/* This is used to carry information about basic blocks. It is
- attached to the AUX field of the standard CFG block. */
-
-typedef struct block_info_def
-{
- struct stack_def stack_in; /* Input stack configuration. */
- struct stack_def stack_out; /* Output stack configuration. */
- HARD_REG_SET out_reg_set; /* Stack regs live on output. */
- int done; /* True if block already converted. */
- int predecessors; /* Number of predecessors that need
- to be visited. */
-} *block_info;
-
-#define BLOCK_INFO(B) ((block_info) (B)->aux)
-
-/* Passed to change_stack to indicate where to emit insns. */
-enum emit_where
-{
- EMIT_AFTER,
- EMIT_BEFORE
-};
-
-/* The block we're currently working on. */
-static basic_block current_block;
-
-/* In the current_block, whether we're processing the first register
- stack or call instruction, i.e. the regstack is currently the
- same as BLOCK_INFO(current_block)->stack_in. */
-static bool starting_stack_p;
-
-/* This is the register file for all register after conversion. */
-static rtx
- FP_mode_reg[LAST_STACK_REG+1-FIRST_STACK_REG][(int) MAX_MACHINE_MODE];
-
-#define FP_MODE_REG(regno,mode) \
- (FP_mode_reg[(regno)-FIRST_STACK_REG][(int) (mode)])
-
-/* Used to initialize uninitialized registers. */
-static rtx not_a_num;
-
-/* Forward declarations */
-
-static int stack_regs_mentioned_p (const_rtx pat);
-static void pop_stack (stack_ptr, int);
-static rtx *get_true_reg (rtx *);
-
-static int check_asm_stack_operands (rtx_insn *);
-static void get_asm_operands_in_out (rtx, int *, int *);
-static rtx stack_result (tree);
-static void replace_reg (rtx *, int);
-static void remove_regno_note (rtx_insn *, enum reg_note, unsigned int);
-static int get_hard_regnum (stack_ptr, rtx);
-static rtx_insn *emit_pop_insn (rtx_insn *, stack_ptr, rtx, enum emit_where);
-static void swap_to_top (rtx_insn *, stack_ptr, rtx, rtx);
-static bool move_for_stack_reg (rtx_insn *, stack_ptr, rtx);
-static bool move_nan_for_stack_reg (rtx_insn *, stack_ptr, rtx);
-static int swap_rtx_condition_1 (rtx);
-static int swap_rtx_condition (rtx_insn *);
-static void compare_for_stack_reg (rtx_insn *, stack_ptr, rtx, bool);
-static bool subst_stack_regs_pat (rtx_insn *, stack_ptr, rtx);
-static void subst_asm_stack_regs (rtx_insn *, stack_ptr);
-static bool subst_stack_regs (rtx_insn *, stack_ptr);
-static void change_stack (rtx_insn *, stack_ptr, stack_ptr, enum emit_where);
-static void print_stack (FILE *, stack_ptr);
-static rtx_insn *next_flags_user (rtx_insn *);
-
-/* Return nonzero if any stack register is mentioned somewhere within PAT. */
-
-static int
-stack_regs_mentioned_p (const_rtx pat)
-{
- const char *fmt;
- int i;
-
- if (STACK_REG_P (pat))
- return 1;
-
- fmt = GET_RTX_FORMAT (GET_CODE (pat));
- for (i = GET_RTX_LENGTH (GET_CODE (pat)) - 1; i >= 0; i--)
- {
- if (fmt[i] == 'E')
- {
- int j;
-
- for (j = XVECLEN (pat, i) - 1; j >= 0; j--)
- if (stack_regs_mentioned_p (XVECEXP (pat, i, j)))
- return 1;
- }
- else if (fmt[i] == 'e' && stack_regs_mentioned_p (XEXP (pat, i)))
- return 1;
- }
-
- return 0;
-}
-
-/* Return nonzero if INSN mentions stacked registers, else return zero. */
-
-int
-stack_regs_mentioned (const_rtx insn)
-{
- unsigned int uid, max;
- int test;
-
- if (! INSN_P (insn) || !stack_regs_mentioned_data.exists ())
- return 0;
-
- uid = INSN_UID (insn);
- max = stack_regs_mentioned_data.length ();
- if (uid >= max)
- {
- /* Allocate some extra size to avoid too many reallocs, but
- do not grow too quickly. */
- max = uid + uid / 20 + 1;
- stack_regs_mentioned_data.safe_grow_cleared (max, true);
- }
-
- test = stack_regs_mentioned_data[uid];
- if (test == 0)
- {
- /* This insn has yet to be examined. Do so now. */
- test = stack_regs_mentioned_p (PATTERN (insn)) ? 1 : 2;
- stack_regs_mentioned_data[uid] = test;
- }
-
- return test == 1;
-}
-
-static rtx ix86_flags_rtx;
-
-static rtx_insn *
-next_flags_user (rtx_insn *insn)
-{
- /* Search forward looking for the first use of this value.
- Stop at block boundaries. */
-
- while (insn != BB_END (current_block))
- {
- insn = NEXT_INSN (insn);
-
- if (INSN_P (insn) && reg_mentioned_p (ix86_flags_rtx, PATTERN (insn)))
- return insn;
-
- if (CALL_P (insn))
- return NULL;
- }
- return NULL;
-}
-
-/* Reorganize the stack into ascending numbers, before this insn. */
-
-static void
-straighten_stack (rtx_insn *insn, stack_ptr regstack)
-{
- struct stack_def temp_stack;
- int top;
-
- /* If there is only a single register on the stack, then the stack is
- already in increasing order and no reorganization is needed.
-
- Similarly if the stack is empty. */
- if (regstack->top <= 0)
- return;
-
- temp_stack.reg_set = regstack->reg_set;
-
- for (top = temp_stack.top = regstack->top; top >= 0; top--)
- temp_stack.reg[top] = FIRST_STACK_REG + temp_stack.top - top;
-
- change_stack (insn, regstack, &temp_stack, EMIT_BEFORE);
-}
-
-/* Pop a register from the stack. */
-
-static void
-pop_stack (stack_ptr regstack, int regno)
-{
- int top = regstack->top;
-
- CLEAR_HARD_REG_BIT (regstack->reg_set, regno);
- regstack->top--;
- /* If regno was not at the top of stack then adjust stack. */
- if (regstack->reg [top] != regno)
- {
- int i;
- for (i = regstack->top; i >= 0; i--)
- if (regstack->reg [i] == regno)
- {
- int j;
- for (j = i; j < top; j++)
- regstack->reg [j] = regstack->reg [j + 1];
- break;
- }
- }
-}
-
-/* Return a pointer to the REG expression within PAT. If PAT is not a
- REG, possible enclosed by a conversion rtx, return the inner part of
- PAT that stopped the search. */
-
-static rtx *
-get_true_reg (rtx *pat)
-{
- for (;;)
- switch (GET_CODE (*pat))
- {
- case SUBREG:
- /* Eliminate FP subregister accesses in favor of the
- actual FP register in use. */
- {
- rtx subreg = SUBREG_REG (*pat);
-
- if (STACK_REG_P (subreg))
- {
- int regno_off = subreg_regno_offset (REGNO (subreg),
- GET_MODE (subreg),
- SUBREG_BYTE (*pat),
- GET_MODE (*pat));
- *pat = FP_MODE_REG (REGNO (subreg) + regno_off,
- GET_MODE (subreg));
- return pat;
- }
- pat = &XEXP (*pat, 0);
- break;
- }
-
- case FLOAT_TRUNCATE:
- if (!flag_unsafe_math_optimizations)
- return pat;
- /* FALLTHRU */
-
- case FLOAT:
- case FIX:
- case FLOAT_EXTEND:
- pat = &XEXP (*pat, 0);
- break;
-
- case UNSPEC:
- if (XINT (*pat, 1) == UNSPEC_TRUNC_NOOP
- || XINT (*pat, 1) == UNSPEC_FILD_ATOMIC)
- pat = &XVECEXP (*pat, 0, 0);
- return pat;
-
- default:
- return pat;
- }
-}
-
-/* Set if we find any malformed asms in a function. */
-static bool any_malformed_asm;
-
-/* There are many rules that an asm statement for stack-like regs must
- follow. Those rules are explained at the top of this file: the rule
- numbers below refer to that explanation. */
-
-static int
-check_asm_stack_operands (rtx_insn *insn)
-{
- int i;
- int n_clobbers;
- int malformed_asm = 0;
- rtx body = PATTERN (insn);
-
- char reg_used_as_output[FIRST_PSEUDO_REGISTER];
- char implicitly_dies[FIRST_PSEUDO_REGISTER];
- char explicitly_used[FIRST_PSEUDO_REGISTER];
-
- rtx *clobber_reg = 0;
- int n_inputs, n_outputs;
-
- /* Find out what the constraints require. If no constraint
- alternative matches, this asm is malformed. */
- extract_constrain_insn (insn);
-
- preprocess_constraints (insn);
-
- get_asm_operands_in_out (body, &n_outputs, &n_inputs);
-
- if (which_alternative < 0)
- {
- /* Avoid further trouble with this insn. */
- PATTERN (insn) = gen_rtx_USE (VOIDmode, const0_rtx);
- return 0;
- }
- const operand_alternative *op_alt = which_op_alt ();
-
- /* Strip SUBREGs here to make the following code simpler. */
- for (i = 0; i < recog_data.n_operands; i++)
- if (GET_CODE (recog_data.operand[i]) == SUBREG
- && REG_P (SUBREG_REG (recog_data.operand[i])))
- recog_data.operand[i] = SUBREG_REG (recog_data.operand[i]);
-
- /* Set up CLOBBER_REG. */
-
- n_clobbers = 0;
-
- if (GET_CODE (body) == PARALLEL)
- {
- clobber_reg = XALLOCAVEC (rtx, XVECLEN (body, 0));
-
- for (i = 0; i < XVECLEN (body, 0); i++)
- if (GET_CODE (XVECEXP (body, 0, i)) == CLOBBER)
- {
- rtx clobber = XVECEXP (body, 0, i);
- rtx reg = XEXP (clobber, 0);
-
- if (GET_CODE (reg) == SUBREG && REG_P (SUBREG_REG (reg)))
- reg = SUBREG_REG (reg);
-
- if (STACK_REG_P (reg))
- {
- clobber_reg[n_clobbers] = reg;
- n_clobbers++;
- }
- }
- }
-
- /* Enforce rule #4: Output operands must specifically indicate which
- reg an output appears in after an asm. "=f" is not allowed: the
- operand constraints must select a class with a single reg.
-
- Also enforce rule #5: Output operands must start at the top of
- the reg-stack: output operands may not "skip" a reg. */
-
- memset (reg_used_as_output, 0, sizeof (reg_used_as_output));
- for (i = 0; i < n_outputs; i++)
- if (STACK_REG_P (recog_data.operand[i]))
- {
- if (reg_class_size[(int) op_alt[i].cl] != 1)
- {
- error_for_asm (insn, "output constraint %d must specify a single register", i);
- malformed_asm = 1;
- }
- else
- {
- int j;
-
- for (j = 0; j < n_clobbers; j++)
- if (REGNO (recog_data.operand[i]) == REGNO (clobber_reg[j]))
- {
- error_for_asm (insn, "output constraint %d cannot be "
- "specified together with %qs clobber",
- i, reg_names [REGNO (clobber_reg[j])]);
- malformed_asm = 1;
- break;
- }
- if (j == n_clobbers)
- reg_used_as_output[REGNO (recog_data.operand[i])] = 1;
- }
- }
-
-
- /* Search for first non-popped reg. */
- for (i = FIRST_STACK_REG; i < LAST_STACK_REG + 1; i++)
- if (! reg_used_as_output[i])
- break;
-
- /* If there are any other popped regs, that's an error. */
- for (; i < LAST_STACK_REG + 1; i++)
- if (reg_used_as_output[i])
- break;
-
- if (i != LAST_STACK_REG + 1)
- {
- error_for_asm (insn, "output registers must be grouped at top of stack");
- malformed_asm = 1;
- }
-
- /* Enforce rule #2: All implicitly popped input regs must be closer
- to the top of the reg-stack than any input that is not implicitly
- popped. */
-
- memset (implicitly_dies, 0, sizeof (implicitly_dies));
- memset (explicitly_used, 0, sizeof (explicitly_used));
- for (i = n_outputs; i < n_outputs + n_inputs; i++)
- if (STACK_REG_P (recog_data.operand[i]))
- {
- /* An input reg is implicitly popped if it is tied to an
- output, or if there is a CLOBBER for it. */
- int j;
-
- for (j = 0; j < n_clobbers; j++)
- if (operands_match_p (clobber_reg[j], recog_data.operand[i]))
- break;
-
- if (j < n_clobbers || op_alt[i].matches >= 0)
- implicitly_dies[REGNO (recog_data.operand[i])] = 1;
- else if (reg_class_size[(int) op_alt[i].cl] == 1)
- explicitly_used[REGNO (recog_data.operand[i])] = 1;
- }
-
- /* Search for first non-popped reg. */
- for (i = FIRST_STACK_REG; i < LAST_STACK_REG + 1; i++)
- if (! implicitly_dies[i])
- break;
-
- /* If there are any other popped regs, that's an error. */
- for (; i < LAST_STACK_REG + 1; i++)
- if (implicitly_dies[i])
- break;
-
- if (i != LAST_STACK_REG + 1)
- {
- error_for_asm (insn,
- "implicitly popped registers must be grouped "
- "at top of stack");
- malformed_asm = 1;
- }
-
- /* Search for first not-explicitly used reg. */
- for (i = FIRST_STACK_REG; i < LAST_STACK_REG + 1; i++)
- if (! implicitly_dies[i] && ! explicitly_used[i])
- break;
-
- /* If there are any other explicitly used regs, that's an error. */
- for (; i < LAST_STACK_REG + 1; i++)
- if (explicitly_used[i])
- break;
-
- if (i != LAST_STACK_REG + 1)
- {
- error_for_asm (insn,
- "explicitly used registers must be grouped "
- "at top of stack");
- malformed_asm = 1;
- }
-
- /* Enforce rule #3: If any input operand uses the "f" constraint, all
- output constraints must use the "&" earlyclobber.
-
- ??? Detect this more deterministically by having constrain_asm_operands
- record any earlyclobber. */
-
- for (i = n_outputs; i < n_outputs + n_inputs; i++)
- if (STACK_REG_P (recog_data.operand[i]) && op_alt[i].matches == -1)
- {
- int j;
-
- for (j = 0; j < n_outputs; j++)
- if (operands_match_p (recog_data.operand[j], recog_data.operand[i]))
- {
- error_for_asm (insn,
- "output operand %d must use %<&%> constraint", j);
- malformed_asm = 1;
- }
- }
-
- if (malformed_asm)
- {
- /* Avoid further trouble with this insn. */
- PATTERN (insn) = gen_rtx_USE (VOIDmode, const0_rtx);
- any_malformed_asm = true;
- return 0;
- }
-
- return 1;
-}
-
-/* Calculate the number of inputs and outputs in BODY, an
- asm_operands. N_OPERANDS is the total number of operands, and
- N_INPUTS and N_OUTPUTS are pointers to ints into which the results are
- placed. */
-
-static void
-get_asm_operands_in_out (rtx body, int *pout, int *pin)
-{
- rtx asmop = extract_asm_operands (body);
-
- *pin = ASM_OPERANDS_INPUT_LENGTH (asmop);
- *pout = (recog_data.n_operands
- - ASM_OPERANDS_INPUT_LENGTH (asmop)
- - ASM_OPERANDS_LABEL_LENGTH (asmop));
-}
-
-/* If current function returns its result in an fp stack register,
- return the REG. Otherwise, return 0. */
-
-static rtx
-stack_result (tree decl)
-{
- rtx result;
-
- /* If the value is supposed to be returned in memory, then clearly
- it is not returned in a stack register. */
- if (aggregate_value_p (DECL_RESULT (decl), decl))
- return 0;
-
- result = DECL_RTL_IF_SET (DECL_RESULT (decl));
- if (result != 0)
- result = targetm.calls.function_value (TREE_TYPE (DECL_RESULT (decl)),
- decl, true);
-
- return result != 0 && STACK_REG_P (result) ? result : 0;
-}
-
-
-/*
- * This section deals with stack register substitution, and forms the second
- * pass over the RTL.
- */
-
-/* Replace REG, which is a pointer to a stack reg RTX, with an RTX for
- the desired hard REGNO. */
-
-static void
-replace_reg (rtx *reg, int regno)
-{
- gcc_assert (IN_RANGE (regno, FIRST_STACK_REG, LAST_STACK_REG));
- gcc_assert (STACK_REG_P (*reg));
-
- gcc_assert (GET_MODE_CLASS (GET_MODE (*reg)) == MODE_FLOAT
- || GET_MODE_CLASS (GET_MODE (*reg)) == MODE_COMPLEX_FLOAT);
-
- *reg = FP_MODE_REG (regno, GET_MODE (*reg));
-}
-
-/* Remove a note of type NOTE, which must be found, for register
- number REGNO from INSN. Remove only one such note. */
-
-static void
-remove_regno_note (rtx_insn *insn, enum reg_note note, unsigned int regno)
-{
- rtx *note_link, this_rtx;
-
- note_link = &REG_NOTES (insn);
- for (this_rtx = *note_link; this_rtx; this_rtx = XEXP (this_rtx, 1))
- if (REG_NOTE_KIND (this_rtx) == note
- && REG_P (XEXP (this_rtx, 0)) && REGNO (XEXP (this_rtx, 0)) == regno)
- {
- *note_link = XEXP (this_rtx, 1);
- return;
- }
- else
- note_link = &XEXP (this_rtx, 1);
-
- gcc_unreachable ();
-}
-
-/* Find the hard register number of virtual register REG in REGSTACK.
- The hard register number is relative to the top of the stack. -1 is
- returned if the register is not found. */
-
-static int
-get_hard_regnum (stack_ptr regstack, rtx reg)
-{
- int i;
-
- gcc_assert (STACK_REG_P (reg));
-
- for (i = regstack->top; i >= 0; i--)
- if (regstack->reg[i] == REGNO (reg))
- break;
-
- return i >= 0 ? (FIRST_STACK_REG + regstack->top - i) : -1;
-}
-
-/* Emit an insn to pop virtual register REG before or after INSN.
- REGSTACK is the stack state after INSN and is updated to reflect this
- pop. WHEN is either emit_insn_before or emit_insn_after. A pop insn
- is represented as a SET whose destination is the register to be popped
- and source is the top of stack. A death note for the top of stack
- cases the movdf pattern to pop. */
-
-static rtx_insn *
-emit_pop_insn (rtx_insn *insn, stack_ptr regstack, rtx reg,
- enum emit_where where)
-{
- machine_mode raw_mode = reg_raw_mode[FIRST_STACK_REG];
- rtx_insn *pop_insn;
- rtx pop_rtx;
- int hard_regno;
-
- /* For complex types take care to pop both halves. These may survive in
- CLOBBER and USE expressions. */
- if (COMPLEX_MODE_P (GET_MODE (reg)))
- {
- rtx reg1 = FP_MODE_REG (REGNO (reg), raw_mode);
- rtx reg2 = FP_MODE_REG (REGNO (reg) + 1, raw_mode);
-
- pop_insn = NULL;
- if (get_hard_regnum (regstack, reg1) >= 0)
- pop_insn = emit_pop_insn (insn, regstack, reg1, where);
- if (get_hard_regnum (regstack, reg2) >= 0)
- pop_insn = emit_pop_insn (insn, regstack, reg2, where);
- gcc_assert (pop_insn);
- return pop_insn;
- }
-
- hard_regno = get_hard_regnum (regstack, reg);
-
- gcc_assert (hard_regno >= FIRST_STACK_REG);
-
- pop_rtx = gen_rtx_SET (FP_MODE_REG (hard_regno, raw_mode),
- FP_MODE_REG (FIRST_STACK_REG, raw_mode));
-
- if (where == EMIT_AFTER)
- pop_insn = emit_insn_after (pop_rtx, insn);
- else
- pop_insn = emit_insn_before (pop_rtx, insn);
-
- add_reg_note (pop_insn, REG_DEAD, FP_MODE_REG (FIRST_STACK_REG, raw_mode));
-
- regstack->reg[regstack->top - (hard_regno - FIRST_STACK_REG)]
- = regstack->reg[regstack->top];
- regstack->top -= 1;
- CLEAR_HARD_REG_BIT (regstack->reg_set, REGNO (reg));
-
- return pop_insn;
-}
-
-/* Emit an insn before or after INSN to swap virtual register REG with
- the top of stack. REGSTACK is the stack state before the swap, and
- is updated to reflect the swap. A swap insn is represented as a
- PARALLEL of two patterns: each pattern moves one reg to the other.
-
- If REG is already at the top of the stack, no insn is emitted. */
-
-static void
-emit_swap_insn (rtx_insn *insn, stack_ptr regstack, rtx reg)
-{
- int hard_regno;
- int other_reg; /* swap regno temps */
- rtx_insn *i1; /* the stack-reg insn prior to INSN */
- rtx i1set = NULL_RTX; /* the SET rtx within I1 */
-
- hard_regno = get_hard_regnum (regstack, reg);
-
- if (hard_regno == FIRST_STACK_REG)
- return;
- if (hard_regno == -1)
- {
- /* Something failed if the register wasn't on the stack. If we had
- malformed asms, we zapped the instruction itself, but that didn't
- produce the same pattern of register sets as before. To prevent
- further failure, adjust REGSTACK to include REG at TOP. */
- gcc_assert (any_malformed_asm);
- regstack->reg[++regstack->top] = REGNO (reg);
- return;
- }
- gcc_assert (hard_regno >= FIRST_STACK_REG);
-
- other_reg = regstack->top - (hard_regno - FIRST_STACK_REG);
- std::swap (regstack->reg[regstack->top], regstack->reg[other_reg]);
-
- /* Find the previous insn involving stack regs, but don't pass a
- block boundary. */
- i1 = NULL;
- if (current_block && insn != BB_HEAD (current_block))
- {
- rtx_insn *tmp = PREV_INSN (insn);
- rtx_insn *limit = PREV_INSN (BB_HEAD (current_block));
- while (tmp != limit)
- {
- if (LABEL_P (tmp)
- || CALL_P (tmp)
- || NOTE_INSN_BASIC_BLOCK_P (tmp)
- || (NONJUMP_INSN_P (tmp)
- && stack_regs_mentioned (tmp)))
- {
- i1 = tmp;
- break;
- }
- tmp = PREV_INSN (tmp);
- }
- }
-
- if (i1 != NULL_RTX
- && (i1set = single_set (i1)) != NULL_RTX)
- {
- rtx i1src = *get_true_reg (&SET_SRC (i1set));
- rtx i1dest = *get_true_reg (&SET_DEST (i1set));
-
- /* If the previous register stack push was from the reg we are to
- swap with, omit the swap. */
-
- if (REG_P (i1dest) && REGNO (i1dest) == FIRST_STACK_REG
- && REG_P (i1src)
- && REGNO (i1src) == (unsigned) hard_regno - 1
- && find_regno_note (i1, REG_DEAD, FIRST_STACK_REG) == NULL_RTX)
- return;
-
- /* If the previous insn wrote to the reg we are to swap with,
- omit the swap. */
-
- if (REG_P (i1dest) && REGNO (i1dest) == (unsigned) hard_regno
- && REG_P (i1src) && REGNO (i1src) == FIRST_STACK_REG
- && find_regno_note (i1, REG_DEAD, FIRST_STACK_REG) == NULL_RTX)
- return;
-
- /* Instead of
- fld a
- fld b
- fxch %st(1)
- just use
- fld b
- fld a
- if possible. Similarly for fld1, fldz, fldpi etc. instead of any
- of the loads or for float extension from memory. */
-
- i1src = SET_SRC (i1set);
- if (GET_CODE (i1src) == FLOAT_EXTEND)
- i1src = XEXP (i1src, 0);
- if (REG_P (i1dest)
- && REGNO (i1dest) == FIRST_STACK_REG
- && (MEM_P (i1src) || GET_CODE (i1src) == CONST_DOUBLE)
- && !side_effects_p (i1src)
- && hard_regno == FIRST_STACK_REG + 1
- && i1 != BB_HEAD (current_block))
- {
- /* i1 is the last insn that involves stack regs before insn, and
- is known to be a load without other side-effects, i.e. fld b
- in the above comment. */
- rtx_insn *i2 = NULL;
- rtx i2set;
- rtx_insn *tmp = PREV_INSN (i1);
- rtx_insn *limit = PREV_INSN (BB_HEAD (current_block));
- /* Find the previous insn involving stack regs, but don't pass a
- block boundary. */
- while (tmp != limit)
- {
- if (LABEL_P (tmp)
- || CALL_P (tmp)
- || NOTE_INSN_BASIC_BLOCK_P (tmp)
- || (NONJUMP_INSN_P (tmp)
- && stack_regs_mentioned (tmp)))
- {
- i2 = tmp;
- break;
- }
- tmp = PREV_INSN (tmp);
- }
- if (i2 != NULL_RTX
- && (i2set = single_set (i2)) != NULL_RTX)
- {
- rtx i2dest = *get_true_reg (&SET_DEST (i2set));
- rtx i2src = SET_SRC (i2set);
- if (GET_CODE (i2src) == FLOAT_EXTEND)
- i2src = XEXP (i2src, 0);
- /* If the last two insns before insn that involve
- stack regs are loads, where the latter (i1)
- pushes onto the register stack and thus
- moves the value from the first load (i2) from
- %st to %st(1), consider swapping them. */
- if (REG_P (i2dest)
- && REGNO (i2dest) == FIRST_STACK_REG
- && (MEM_P (i2src) || GET_CODE (i2src) == CONST_DOUBLE)
- /* Ensure i2 doesn't have other side-effects. */
- && !side_effects_p (i2src)
- /* And that the two instructions can actually be
- swapped, i.e. there shouldn't be any stores
- in between i2 and i1 that might alias with
- the i1 memory, and the memory address can't
- use registers set in between i2 and i1. */
- && !modified_between_p (SET_SRC (i1set), i2, i1))
- {
- /* Move i1 (fld b above) right before i2 (fld a
- above. */
- remove_insn (i1);
- SET_PREV_INSN (i1) = NULL_RTX;
- SET_NEXT_INSN (i1) = NULL_RTX;
- set_block_for_insn (i1, NULL);
- emit_insn_before (i1, i2);
- return;
- }
- }
- }
- }
-
- /* Avoid emitting the swap if this is the first register stack insn
- of the current_block. Instead update the current_block's stack_in
- and let compensate edges take care of this for us. */
- if (current_block && starting_stack_p)
- {
- BLOCK_INFO (current_block)->stack_in = *regstack;
- starting_stack_p = false;
- return;
- }
-
- machine_mode raw_mode = reg_raw_mode[FIRST_STACK_REG];
- rtx op1 = FP_MODE_REG (hard_regno, raw_mode);
- rtx op2 = FP_MODE_REG (FIRST_STACK_REG, raw_mode);
- rtx swap_rtx
- = gen_rtx_PARALLEL (VOIDmode,
- gen_rtvec (2, gen_rtx_SET (op1, op2),
- gen_rtx_SET (op2, op1)));
- if (i1)
- emit_insn_after (swap_rtx, i1);
- else if (current_block)
- emit_insn_before (swap_rtx, BB_HEAD (current_block));
- else
- emit_insn_before (swap_rtx, insn);
-}
-
-/* Emit an insns before INSN to swap virtual register SRC1 with
- the top of stack and virtual register SRC2 with second stack
- slot. REGSTACK is the stack state before the swaps, and
- is updated to reflect the swaps. A swap insn is represented as a
- PARALLEL of two patterns: each pattern moves one reg to the other.
-
- If SRC1 and/or SRC2 are already at the right place, no swap insn
- is emitted. */
-
-static void
-swap_to_top (rtx_insn *insn, stack_ptr regstack, rtx src1, rtx src2)
-{
- struct stack_def temp_stack;
- int regno, j, k;
-
- temp_stack = *regstack;
-
- /* Place operand 1 at the top of stack. */
- regno = get_hard_regnum (&temp_stack, src1);
- gcc_assert (regno >= 0);
- if (regno != FIRST_STACK_REG)
- {
- k = temp_stack.top - (regno - FIRST_STACK_REG);
- j = temp_stack.top;
-
- std::swap (temp_stack.reg[j], temp_stack.reg[k]);
- }
-
- /* Place operand 2 next on the stack. */
- regno = get_hard_regnum (&temp_stack, src2);
- gcc_assert (regno >= 0);
- if (regno != FIRST_STACK_REG + 1)
- {
- k = temp_stack.top - (regno - FIRST_STACK_REG);
- j = temp_stack.top - 1;
-
- std::swap (temp_stack.reg[j], temp_stack.reg[k]);
- }
-
- change_stack (insn, regstack, &temp_stack, EMIT_BEFORE);
-}
-
-/* Handle a move to or from a stack register in PAT, which is in INSN.
- REGSTACK is the current stack. Return whether a control flow insn
- was deleted in the process. */
-
-static bool
-move_for_stack_reg (rtx_insn *insn, stack_ptr regstack, rtx pat)
-{
- rtx *psrc = get_true_reg (&SET_SRC (pat));
- rtx *pdest = get_true_reg (&SET_DEST (pat));
- rtx src, dest;
- rtx note;
- bool control_flow_insn_deleted = false;
-
- src = *psrc; dest = *pdest;
-
- if (STACK_REG_P (src) && STACK_REG_P (dest))
- {
- /* Write from one stack reg to another. If SRC dies here, then
- just change the register mapping and delete the insn. */
-
- note = find_regno_note (insn, REG_DEAD, REGNO (src));
- if (note)
- {
- int i;
-
- /* If this is a no-op move, there must not be a REG_DEAD note. */
- gcc_assert (REGNO (src) != REGNO (dest));
-
- for (i = regstack->top; i >= 0; i--)
- if (regstack->reg[i] == REGNO (src))
- break;
-
- /* The destination must be dead, or life analysis is borked. */
- gcc_assert (get_hard_regnum (regstack, dest) < FIRST_STACK_REG);
-
- /* If the source is not live, this is yet another case of
- uninitialized variables. Load up a NaN instead. */
- if (i < 0)
- return move_nan_for_stack_reg (insn, regstack, dest);
-
- /* It is possible that the dest is unused after this insn.
- If so, just pop the src. */
-
- if (find_regno_note (insn, REG_UNUSED, REGNO (dest)))
- emit_pop_insn (insn, regstack, src, EMIT_AFTER);
- else
- {
- regstack->reg[i] = REGNO (dest);
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (dest));
- CLEAR_HARD_REG_BIT (regstack->reg_set, REGNO (src));
- }
-
- control_flow_insn_deleted |= control_flow_insn_p (insn);
- delete_insn (insn);
- return control_flow_insn_deleted;
- }
-
- /* The source reg does not die. */
-
- /* If this appears to be a no-op move, delete it, or else it
- will confuse the machine description output patterns. But if
- it is REG_UNUSED, we must pop the reg now, as per-insn processing
- for REG_UNUSED will not work for deleted insns. */
-
- if (REGNO (src) == REGNO (dest))
- {
- if (find_regno_note (insn, REG_UNUSED, REGNO (dest)))
- emit_pop_insn (insn, regstack, dest, EMIT_AFTER);
-
- control_flow_insn_deleted |= control_flow_insn_p (insn);
- delete_insn (insn);
- return control_flow_insn_deleted;
- }
-
- /* The destination ought to be dead. */
- if (get_hard_regnum (regstack, dest) >= FIRST_STACK_REG)
- gcc_assert (any_malformed_asm);
- else
- {
- replace_reg (psrc, get_hard_regnum (regstack, src));
-
- regstack->reg[++regstack->top] = REGNO (dest);
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (dest));
- replace_reg (pdest, FIRST_STACK_REG);
- }
- }
- else if (STACK_REG_P (src))
- {
- /* Save from a stack reg to MEM, or possibly integer reg. Since
- only top of stack may be saved, emit an exchange first if
- needs be. */
-
- emit_swap_insn (insn, regstack, src);
-
- note = find_regno_note (insn, REG_DEAD, REGNO (src));
- if (note)
- {
- replace_reg (&XEXP (note, 0), FIRST_STACK_REG);
- regstack->top--;
- CLEAR_HARD_REG_BIT (regstack->reg_set, REGNO (src));
- }
- else if ((GET_MODE (src) == XFmode)
- && regstack->top < REG_STACK_SIZE - 1)
- {
- /* A 387 cannot write an XFmode value to a MEM without
- clobbering the source reg. The output code can handle
- this by reading back the value from the MEM.
- But it is more efficient to use a temp register if one is
- available. Push the source value here if the register
- stack is not full, and then write the value to memory via
- a pop. */
- rtx push_rtx;
- rtx top_stack_reg = FP_MODE_REG (FIRST_STACK_REG, GET_MODE (src));
-
- push_rtx = gen_movxf (top_stack_reg, top_stack_reg);
- emit_insn_before (push_rtx, insn);
- add_reg_note (insn, REG_DEAD, top_stack_reg);
- }
-
- replace_reg (psrc, FIRST_STACK_REG);
- }
- else
- {
- rtx pat = PATTERN (insn);
-
- gcc_assert (STACK_REG_P (dest));
-
- /* Load from MEM, or possibly integer REG or constant, into the
- stack regs. The actual target is always the top of the
- stack. The stack mapping is changed to reflect that DEST is
- now at top of stack. */
-
- /* The destination ought to be dead. However, there is a
- special case with i387 UNSPEC_TAN, where destination is live
- (an argument to fptan) but inherent load of 1.0 is modelled
- as a load from a constant. */
- if (GET_CODE (pat) == PARALLEL
- && XVECLEN (pat, 0) == 2
- && GET_CODE (XVECEXP (pat, 0, 1)) == SET
- && GET_CODE (SET_SRC (XVECEXP (pat, 0, 1))) == UNSPEC
- && XINT (SET_SRC (XVECEXP (pat, 0, 1)), 1) == UNSPEC_TAN)
- emit_swap_insn (insn, regstack, dest);
- else
- gcc_assert (get_hard_regnum (regstack, dest) < FIRST_STACK_REG
- || any_malformed_asm);
-
- gcc_assert (regstack->top < REG_STACK_SIZE);
-
- regstack->reg[++regstack->top] = REGNO (dest);
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (dest));
- replace_reg (pdest, FIRST_STACK_REG);
- }
-
- return control_flow_insn_deleted;
-}
-
-/* A helper function which replaces INSN with a pattern that loads up
- a NaN into DEST, then invokes move_for_stack_reg. */
-
-static bool
-move_nan_for_stack_reg (rtx_insn *insn, stack_ptr regstack, rtx dest)
-{
- rtx pat;
-
- dest = FP_MODE_REG (REGNO (dest), SFmode);
- pat = gen_rtx_SET (dest, not_a_num);
- PATTERN (insn) = pat;
- INSN_CODE (insn) = -1;
-
- return move_for_stack_reg (insn, regstack, pat);
-}
-
-/* Swap the condition on a branch, if there is one. Return true if we
- found a condition to swap. False if the condition was not used as
- such. */
-
-static int
-swap_rtx_condition_1 (rtx pat)
-{
- const char *fmt;
- int i, r = 0;
-
- if (COMPARISON_P (pat))
- {
- PUT_CODE (pat, swap_condition (GET_CODE (pat)));
- r = 1;
- }
- else
- {
- fmt = GET_RTX_FORMAT (GET_CODE (pat));
- for (i = GET_RTX_LENGTH (GET_CODE (pat)) - 1; i >= 0; i--)
- {
- if (fmt[i] == 'E')
- {
- int j;
-
- for (j = XVECLEN (pat, i) - 1; j >= 0; j--)
- r |= swap_rtx_condition_1 (XVECEXP (pat, i, j));
- }
- else if (fmt[i] == 'e')
- r |= swap_rtx_condition_1 (XEXP (pat, i));
- }
- }
-
- return r;
-}
-
-static int
-swap_rtx_condition (rtx_insn *insn)
-{
- rtx pat = PATTERN (insn);
-
- /* We're looking for a single set to an HImode temporary. */
-
- if (GET_CODE (pat) == SET
- && REG_P (SET_DEST (pat))
- && REGNO (SET_DEST (pat)) == FLAGS_REG)
- {
- insn = next_flags_user (insn);
- if (insn == NULL_RTX)
- return 0;
- pat = PATTERN (insn);
- }
-
- /* See if this is, or ends in, a fnstsw. If so, we're not doing anything
- with the cc value right now. We may be able to search for one
- though. */
-
- if (GET_CODE (pat) == SET
- && GET_CODE (SET_SRC (pat)) == UNSPEC
- && XINT (SET_SRC (pat), 1) == UNSPEC_FNSTSW)
- {
- rtx dest = SET_DEST (pat);
-
- /* Search forward looking for the first use of this value.
- Stop at block boundaries. */
- while (insn != BB_END (current_block))
- {
- insn = NEXT_INSN (insn);
- if (INSN_P (insn) && reg_mentioned_p (dest, insn))
- break;
- if (CALL_P (insn))
- return 0;
- }
-
- /* We haven't found it. */
- if (insn == BB_END (current_block))
- return 0;
-
- /* So we've found the insn using this value. If it is anything
- other than sahf or the value does not die (meaning we'd have
- to search further), then we must give up. */
- pat = PATTERN (insn);
- if (GET_CODE (pat) != SET
- || GET_CODE (SET_SRC (pat)) != UNSPEC
- || XINT (SET_SRC (pat), 1) != UNSPEC_SAHF
- || ! dead_or_set_p (insn, dest))
- return 0;
-
- /* Now we are prepared to handle this. */
- insn = next_flags_user (insn);
- if (insn == NULL_RTX)
- return 0;
- pat = PATTERN (insn);
- }
-
- if (swap_rtx_condition_1 (pat))
- {
- int fail = 0;
- INSN_CODE (insn) = -1;
- if (recog_memoized (insn) == -1)
- fail = 1;
- /* In case the flags don't die here, recurse to try fix
- following user too. */
- else if (! dead_or_set_p (insn, ix86_flags_rtx))
- {
- insn = next_flags_user (insn);
- if (!insn || !swap_rtx_condition (insn))
- fail = 1;
- }
- if (fail)
- {
- swap_rtx_condition_1 (pat);
- return 0;
- }
- return 1;
- }
- return 0;
-}
-
-/* Handle a comparison. Special care needs to be taken to avoid
- causing comparisons that a 387 cannot do correctly, such as EQ.
-
- Also, a pop insn may need to be emitted. The 387 does have an
- `fcompp' insn that can pop two regs, but it is sometimes too expensive
- to do this - a `fcomp' followed by a `fstpl %st(0)' may be easier to
- set up. */
-
-static void
-compare_for_stack_reg (rtx_insn *insn, stack_ptr regstack,
- rtx pat_src, bool can_pop_second_op)
-{
- rtx *src1, *src2;
- rtx src1_note, src2_note;
-
- src1 = get_true_reg (&XEXP (pat_src, 0));
- src2 = get_true_reg (&XEXP (pat_src, 1));
-
- /* ??? If fxch turns out to be cheaper than fstp, give priority to
- registers that die in this insn - move those to stack top first. */
- if ((! STACK_REG_P (*src1)
- || (STACK_REG_P (*src2)
- && get_hard_regnum (regstack, *src2) == FIRST_STACK_REG))
- && swap_rtx_condition (insn))
- {
- std::swap (XEXP (pat_src, 0), XEXP (pat_src, 1));
-
- src1 = get_true_reg (&XEXP (pat_src, 0));
- src2 = get_true_reg (&XEXP (pat_src, 1));
-
- INSN_CODE (insn) = -1;
- }
-
- /* We will fix any death note later. */
-
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
-
- if (STACK_REG_P (*src2))
- src2_note = find_regno_note (insn, REG_DEAD, REGNO (*src2));
- else
- src2_note = NULL_RTX;
-
- emit_swap_insn (insn, regstack, *src1);
-
- replace_reg (src1, FIRST_STACK_REG);
-
- if (STACK_REG_P (*src2))
- replace_reg (src2, get_hard_regnum (regstack, *src2));
-
- if (src1_note)
- {
- if (*src2 == CONST0_RTX (GET_MODE (*src2)))
- {
- /* This is `ftst' insn that can't pop register. */
- remove_regno_note (insn, REG_DEAD, REGNO (XEXP (src1_note, 0)));
- emit_pop_insn (insn, regstack, XEXP (src1_note, 0),
- EMIT_AFTER);
- }
- else
- {
- pop_stack (regstack, REGNO (XEXP (src1_note, 0)));
- replace_reg (&XEXP (src1_note, 0), FIRST_STACK_REG);
- }
- }
-
- /* If the second operand dies, handle that. But if the operands are
- the same stack register, don't bother, because only one death is
- needed, and it was just handled. */
-
- if (src2_note
- && ! (STACK_REG_P (*src1) && STACK_REG_P (*src2)
- && REGNO (*src1) == REGNO (*src2)))
- {
- /* As a special case, two regs may die in this insn if src2 is
- next to top of stack and the top of stack also dies. Since
- we have already popped src1, "next to top of stack" is really
- at top (FIRST_STACK_REG) now. */
-
- if (get_hard_regnum (regstack, XEXP (src2_note, 0)) == FIRST_STACK_REG
- && src1_note && can_pop_second_op)
- {
- pop_stack (regstack, REGNO (XEXP (src2_note, 0)));
- replace_reg (&XEXP (src2_note, 0), FIRST_STACK_REG + 1);
- }
- else
- {
- /* The 386 can only represent death of the first operand in
- the case handled above. In all other cases, emit a separate
- pop and remove the death note from here. */
- remove_regno_note (insn, REG_DEAD, REGNO (XEXP (src2_note, 0)));
- emit_pop_insn (insn, regstack, XEXP (src2_note, 0),
- EMIT_AFTER);
- }
- }
-}
-
-/* Substitute hardware stack regs in debug insn INSN, using stack
- layout REGSTACK. If we can't find a hardware stack reg for any of
- the REGs in it, reset the debug insn. */
-
-static void
-subst_all_stack_regs_in_debug_insn (rtx_insn *insn, struct stack_def *regstack)
-{
- subrtx_ptr_iterator::array_type array;
- FOR_EACH_SUBRTX_PTR (iter, array, &INSN_VAR_LOCATION_LOC (insn), NONCONST)
- {
- rtx *loc = *iter;
- rtx x = *loc;
- if (STACK_REG_P (x))
- {
- int hard_regno = get_hard_regnum (regstack, x);
-
- /* If we can't find an active register, reset this debug insn. */
- if (hard_regno == -1)
- {
- INSN_VAR_LOCATION_LOC (insn) = gen_rtx_UNKNOWN_VAR_LOC ();
- return;
- }
-
- gcc_assert (hard_regno >= FIRST_STACK_REG);
- replace_reg (loc, hard_regno);
- iter.skip_subrtxes ();
- }
- }
-}
-
-/* Substitute new registers in PAT, which is part of INSN. REGSTACK
- is the current register layout. Return whether a control flow insn
- was deleted in the process. */
-
-static bool
-subst_stack_regs_pat (rtx_insn *insn, stack_ptr regstack, rtx pat)
-{
- rtx *dest, *src;
- bool control_flow_insn_deleted = false;
-
- switch (GET_CODE (pat))
- {
- case USE:
- /* Deaths in USE insns can happen in non optimizing compilation.
- Handle them by popping the dying register. */
- src = get_true_reg (&XEXP (pat, 0));
- if (STACK_REG_P (*src)
- && find_regno_note (insn, REG_DEAD, REGNO (*src)))
- {
- /* USEs are ignored for liveness information so USEs of dead
- register might happen. */
- if (TEST_HARD_REG_BIT (regstack->reg_set, REGNO (*src)))
- emit_pop_insn (insn, regstack, *src, EMIT_AFTER);
- return control_flow_insn_deleted;
- }
- /* Uninitialized USE might happen for functions returning uninitialized
- value. We will properly initialize the USE on the edge to EXIT_BLOCK,
- so it is safe to ignore the use here. This is consistent with behavior
- of dataflow analyzer that ignores USE too. (This also imply that
- forcibly initializing the register to NaN here would lead to ICE later,
- since the REG_DEAD notes are not issued.) */
- break;
-
- case VAR_LOCATION:
- gcc_unreachable ();
-
- case CLOBBER:
- {
- rtx note;
-
- dest = get_true_reg (&XEXP (pat, 0));
- if (STACK_REG_P (*dest))
- {
- note = find_reg_note (insn, REG_DEAD, *dest);
-
- if (pat != PATTERN (insn))
- {
- /* The fix_truncdi_1 pattern wants to be able to
- allocate its own scratch register. It does this by
- clobbering an fp reg so that it is assured of an
- empty reg-stack register. If the register is live,
- kill it now. Remove the DEAD/UNUSED note so we
- don't try to kill it later too.
-
- In reality the UNUSED note can be absent in some
- complicated cases when the register is reused for
- partially set variable. */
-
- if (note)
- emit_pop_insn (insn, regstack, *dest, EMIT_BEFORE);
- else
- note = find_reg_note (insn, REG_UNUSED, *dest);
- if (note)
- remove_note (insn, note);
- replace_reg (dest, FIRST_STACK_REG + 1);
- }
- else
- {
- /* A top-level clobber with no REG_DEAD, and no hard-regnum
- indicates an uninitialized value. Because reload removed
- all other clobbers, this must be due to a function
- returning without a value. Load up a NaN. */
-
- if (!note)
- {
- rtx t = *dest;
- if (COMPLEX_MODE_P (GET_MODE (t)))
- {
- rtx u = FP_MODE_REG (REGNO (t) + 1, SFmode);
- if (get_hard_regnum (regstack, u) == -1)
- {
- rtx pat2 = gen_rtx_CLOBBER (VOIDmode, u);
- rtx_insn *insn2 = emit_insn_before (pat2, insn);
- control_flow_insn_deleted
- |= move_nan_for_stack_reg (insn2, regstack, u);
- }
- }
- if (get_hard_regnum (regstack, t) == -1)
- control_flow_insn_deleted
- |= move_nan_for_stack_reg (insn, regstack, t);
- }
- }
- }
- break;
- }
-
- case SET:
- {
- rtx *src1 = (rtx *) 0, *src2;
- rtx src1_note, src2_note;
- rtx pat_src;
-
- dest = get_true_reg (&SET_DEST (pat));
- src = get_true_reg (&SET_SRC (pat));
- pat_src = SET_SRC (pat);
-
- /* See if this is a `movM' pattern, and handle elsewhere if so. */
- if (STACK_REG_P (*src)
- || (STACK_REG_P (*dest)
- && (REG_P (*src) || MEM_P (*src)
- || CONST_DOUBLE_P (*src))))
- {
- control_flow_insn_deleted |= move_for_stack_reg (insn, regstack, pat);
- break;
- }
-
- switch (GET_CODE (pat_src))
- {
- case CALL:
- {
- int count;
- for (count = REG_NREGS (*dest); --count >= 0;)
- {
- regstack->reg[++regstack->top] = REGNO (*dest) + count;
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest) + count);
- }
- }
- replace_reg (dest, FIRST_STACK_REG);
- break;
-
- case REG:
- gcc_unreachable ();
-
- /* Fall through. */
-
- case FLOAT_TRUNCATE:
- case SQRT:
- case ABS:
- case NEG:
- /* These insns only operate on the top of the stack. It's
- possible that the tstM case results in a REG_DEAD note on the
- source. */
-
- if (src1 == 0)
- src1 = get_true_reg (&XEXP (pat_src, 0));
-
- emit_swap_insn (insn, regstack, *src1);
-
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
-
- if (STACK_REG_P (*dest))
- replace_reg (dest, FIRST_STACK_REG);
-
- if (src1_note)
- {
- replace_reg (&XEXP (src1_note, 0), FIRST_STACK_REG);
- regstack->top--;
- CLEAR_HARD_REG_BIT (regstack->reg_set, REGNO (*src1));
- }
-
- replace_reg (src1, FIRST_STACK_REG);
- break;
-
- case MINUS:
- case DIV:
- /* On i386, reversed forms of subM3 and divM3 exist for
- MODE_FLOAT, so the same code that works for addM3 and mulM3
- can be used. */
- case MULT:
- case PLUS:
- /* These insns can accept the top of stack as a destination
- from a stack reg or mem, or can use the top of stack as a
- source and some other stack register (possibly top of stack)
- as a destination. */
-
- src1 = get_true_reg (&XEXP (pat_src, 0));
- src2 = get_true_reg (&XEXP (pat_src, 1));
-
- /* We will fix any death note later. */
-
- if (STACK_REG_P (*src1))
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
- else
- src1_note = NULL_RTX;
- if (STACK_REG_P (*src2))
- src2_note = find_regno_note (insn, REG_DEAD, REGNO (*src2));
- else
- src2_note = NULL_RTX;
-
- /* If either operand is not a stack register, then the dest
- must be top of stack. */
-
- if (! STACK_REG_P (*src1) || ! STACK_REG_P (*src2))
- emit_swap_insn (insn, regstack, *dest);
- else
- {
- /* Both operands are REG. If neither operand is already
- at the top of stack, choose to make the one that is the
- dest the new top of stack. */
-
- int src1_hard_regnum, src2_hard_regnum;
-
- src1_hard_regnum = get_hard_regnum (regstack, *src1);
- src2_hard_regnum = get_hard_regnum (regstack, *src2);
-
- /* If the source is not live, this is yet another case of
- uninitialized variables. Load up a NaN instead. */
- if (src1_hard_regnum == -1)
- {
- rtx pat2 = gen_rtx_CLOBBER (VOIDmode, *src1);
- rtx_insn *insn2 = emit_insn_before (pat2, insn);
- control_flow_insn_deleted
- |= move_nan_for_stack_reg (insn2, regstack, *src1);
- }
- if (src2_hard_regnum == -1)
- {
- rtx pat2 = gen_rtx_CLOBBER (VOIDmode, *src2);
- rtx_insn *insn2 = emit_insn_before (pat2, insn);
- control_flow_insn_deleted
- |= move_nan_for_stack_reg (insn2, regstack, *src2);
- }
-
- if (src1_hard_regnum != FIRST_STACK_REG
- && src2_hard_regnum != FIRST_STACK_REG)
- emit_swap_insn (insn, regstack, *dest);
- }
-
- if (STACK_REG_P (*src1))
- replace_reg (src1, get_hard_regnum (regstack, *src1));
- if (STACK_REG_P (*src2))
- replace_reg (src2, get_hard_regnum (regstack, *src2));
-
- if (src1_note)
- {
- rtx src1_reg = XEXP (src1_note, 0);
-
- /* If the register that dies is at the top of stack, then
- the destination is somewhere else - merely substitute it.
- But if the reg that dies is not at top of stack, then
- move the top of stack to the dead reg, as though we had
- done the insn and then a store-with-pop. */
-
- if (REGNO (src1_reg) == regstack->reg[regstack->top])
- {
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, get_hard_regnum (regstack, *dest));
- }
- else
- {
- int regno = get_hard_regnum (regstack, src1_reg);
-
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, regno);
-
- regstack->reg[regstack->top - (regno - FIRST_STACK_REG)]
- = regstack->reg[regstack->top];
- }
-
- CLEAR_HARD_REG_BIT (regstack->reg_set,
- REGNO (XEXP (src1_note, 0)));
- replace_reg (&XEXP (src1_note, 0), FIRST_STACK_REG);
- regstack->top--;
- }
- else if (src2_note)
- {
- rtx src2_reg = XEXP (src2_note, 0);
- if (REGNO (src2_reg) == regstack->reg[regstack->top])
- {
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, get_hard_regnum (regstack, *dest));
- }
- else
- {
- int regno = get_hard_regnum (regstack, src2_reg);
-
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, regno);
-
- regstack->reg[regstack->top - (regno - FIRST_STACK_REG)]
- = regstack->reg[regstack->top];
- }
-
- CLEAR_HARD_REG_BIT (regstack->reg_set,
- REGNO (XEXP (src2_note, 0)));
- replace_reg (&XEXP (src2_note, 0), FIRST_STACK_REG);
- regstack->top--;
- }
- else
- {
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, get_hard_regnum (regstack, *dest));
- }
-
- /* Keep operand 1 matching with destination. */
- if (COMMUTATIVE_ARITH_P (pat_src)
- && REG_P (*src1) && REG_P (*src2)
- && REGNO (*src1) != REGNO (*dest))
- {
- int tmp = REGNO (*src1);
- replace_reg (src1, REGNO (*src2));
- replace_reg (src2, tmp);
- }
- break;
-
- case UNSPEC:
- switch (XINT (pat_src, 1))
- {
- case UNSPEC_FIST:
- case UNSPEC_FIST_ATOMIC:
-
- case UNSPEC_FIST_FLOOR:
- case UNSPEC_FIST_CEIL:
-
- /* These insns only operate on the top of the stack. */
-
- src1 = get_true_reg (&XVECEXP (pat_src, 0, 0));
- emit_swap_insn (insn, regstack, *src1);
-
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
-
- if (STACK_REG_P (*dest))
- replace_reg (dest, FIRST_STACK_REG);
-
- if (src1_note)
- {
- replace_reg (&XEXP (src1_note, 0), FIRST_STACK_REG);
- regstack->top--;
- CLEAR_HARD_REG_BIT (regstack->reg_set, REGNO (*src1));
- }
-
- replace_reg (src1, FIRST_STACK_REG);
- break;
-
- case UNSPEC_FXAM:
-
- /* This insn only operate on the top of the stack. */
-
- src1 = get_true_reg (&XVECEXP (pat_src, 0, 0));
- emit_swap_insn (insn, regstack, *src1);
-
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
-
- replace_reg (src1, FIRST_STACK_REG);
-
- if (src1_note)
- {
- remove_regno_note (insn, REG_DEAD,
- REGNO (XEXP (src1_note, 0)));
- emit_pop_insn (insn, regstack, XEXP (src1_note, 0),
- EMIT_AFTER);
- }
-
- break;
-
- case UNSPEC_SIN:
- case UNSPEC_COS:
- case UNSPEC_FRNDINT:
- case UNSPEC_F2XM1:
-
- case UNSPEC_FRNDINT_ROUNDEVEN:
- case UNSPEC_FRNDINT_FLOOR:
- case UNSPEC_FRNDINT_CEIL:
- case UNSPEC_FRNDINT_TRUNC:
-
- /* Above insns operate on the top of the stack. */
-
- case UNSPEC_SINCOS_COS:
- case UNSPEC_XTRACT_FRACT:
-
- /* Above insns operate on the top two stack slots,
- first part of one input, double output insn. */
-
- src1 = get_true_reg (&XVECEXP (pat_src, 0, 0));
-
- emit_swap_insn (insn, regstack, *src1);
-
- /* Input should never die, it is replaced with output. */
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
- gcc_assert (!src1_note);
-
- if (STACK_REG_P (*dest))
- replace_reg (dest, FIRST_STACK_REG);
-
- replace_reg (src1, FIRST_STACK_REG);
- break;
-
- case UNSPEC_SINCOS_SIN:
- case UNSPEC_XTRACT_EXP:
-
- /* These insns operate on the top two stack slots,
- second part of one input, double output insn. */
-
- regstack->top++;
- /* FALLTHRU */
-
- case UNSPEC_TAN:
-
- /* For UNSPEC_TAN, regstack->top is already increased
- by inherent load of constant 1.0. */
-
- /* Output value is generated in the second stack slot.
- Move current value from second slot to the top. */
- regstack->reg[regstack->top]
- = regstack->reg[regstack->top - 1];
-
- gcc_assert (STACK_REG_P (*dest));
-
- regstack->reg[regstack->top - 1] = REGNO (*dest);
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, FIRST_STACK_REG + 1);
-
- src1 = get_true_reg (&XVECEXP (pat_src, 0, 0));
-
- replace_reg (src1, FIRST_STACK_REG);
- break;
-
- case UNSPEC_FPATAN:
- case UNSPEC_FYL2X:
- case UNSPEC_FYL2XP1:
- /* These insns operate on the top two stack slots. */
-
- src1 = get_true_reg (&XVECEXP (pat_src, 0, 0));
- src2 = get_true_reg (&XVECEXP (pat_src, 0, 1));
-
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
- src2_note = find_regno_note (insn, REG_DEAD, REGNO (*src2));
-
- swap_to_top (insn, regstack, *src1, *src2);
-
- replace_reg (src1, FIRST_STACK_REG);
- replace_reg (src2, FIRST_STACK_REG + 1);
-
- if (src1_note)
- replace_reg (&XEXP (src1_note, 0), FIRST_STACK_REG);
- if (src2_note)
- replace_reg (&XEXP (src2_note, 0), FIRST_STACK_REG + 1);
-
- /* Pop both input operands from the stack. */
- CLEAR_HARD_REG_BIT (regstack->reg_set,
- regstack->reg[regstack->top]);
- CLEAR_HARD_REG_BIT (regstack->reg_set,
- regstack->reg[regstack->top - 1]);
- regstack->top -= 2;
-
- /* Push the result back onto the stack. */
- regstack->reg[++regstack->top] = REGNO (*dest);
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, FIRST_STACK_REG);
- break;
-
- case UNSPEC_FSCALE_FRACT:
- case UNSPEC_FPREM_F:
- case UNSPEC_FPREM1_F:
- /* These insns operate on the top two stack slots,
- first part of double input, double output insn. */
-
- src1 = get_true_reg (&XVECEXP (pat_src, 0, 0));
- src2 = get_true_reg (&XVECEXP (pat_src, 0, 1));
-
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
- src2_note = find_regno_note (insn, REG_DEAD, REGNO (*src2));
-
- /* Inputs should never die, they are
- replaced with outputs. */
- gcc_assert (!src1_note);
- gcc_assert (!src2_note);
-
- swap_to_top (insn, regstack, *src1, *src2);
-
- /* Push the result back onto stack. Empty stack slot
- will be filled in second part of insn. */
- if (STACK_REG_P (*dest))
- {
- regstack->reg[regstack->top] = REGNO (*dest);
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, FIRST_STACK_REG);
- }
-
- replace_reg (src1, FIRST_STACK_REG);
- replace_reg (src2, FIRST_STACK_REG + 1);
- break;
-
- case UNSPEC_FSCALE_EXP:
- case UNSPEC_FPREM_U:
- case UNSPEC_FPREM1_U:
- /* These insns operate on the top two stack slots,
- second part of double input, double output insn. */
-
- src1 = get_true_reg (&XVECEXP (pat_src, 0, 0));
- src2 = get_true_reg (&XVECEXP (pat_src, 0, 1));
-
- /* Push the result back onto stack. Fill empty slot from
- first part of insn and fix top of stack pointer. */
- if (STACK_REG_P (*dest))
- {
- regstack->reg[regstack->top - 1] = REGNO (*dest);
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, FIRST_STACK_REG + 1);
- }
-
- replace_reg (src1, FIRST_STACK_REG);
- replace_reg (src2, FIRST_STACK_REG + 1);
- break;
-
- case UNSPEC_C2_FLAG:
- /* This insn operates on the top two stack slots,
- third part of C2 setting double input insn. */
-
- src1 = get_true_reg (&XVECEXP (pat_src, 0, 0));
- src2 = get_true_reg (&XVECEXP (pat_src, 0, 1));
-
- replace_reg (src1, FIRST_STACK_REG);
- replace_reg (src2, FIRST_STACK_REG + 1);
- break;
-
- case UNSPEC_FNSTSW:
- /* Combined fcomp+fnstsw generated for doing well with
- CSE. When optimizing this would have been broken
- up before now. */
-
- pat_src = XVECEXP (pat_src, 0, 0);
- if (GET_CODE (pat_src) == COMPARE)
- goto do_compare;
-
- /* Fall through. */
-
- case UNSPEC_NOTRAP:
-
- pat_src = XVECEXP (pat_src, 0, 0);
- gcc_assert (GET_CODE (pat_src) == COMPARE);
- goto do_compare;
-
- default:
- gcc_unreachable ();
- }
- break;
-
- case COMPARE:
- do_compare:
- /* `fcomi' insn can't pop two regs. */
- compare_for_stack_reg (insn, regstack, pat_src,
- REGNO (*dest) != FLAGS_REG);
- break;
-
- case IF_THEN_ELSE:
- /* This insn requires the top of stack to be the destination. */
-
- src1 = get_true_reg (&XEXP (pat_src, 1));
- src2 = get_true_reg (&XEXP (pat_src, 2));
-
- src1_note = find_regno_note (insn, REG_DEAD, REGNO (*src1));
- src2_note = find_regno_note (insn, REG_DEAD, REGNO (*src2));
-
- /* If the comparison operator is an FP comparison operator,
- it is handled correctly by compare_for_stack_reg () who
- will move the destination to the top of stack. But if the
- comparison operator is not an FP comparison operator, we
- have to handle it here. */
- if (get_hard_regnum (regstack, *dest) >= FIRST_STACK_REG
- && REGNO (*dest) != regstack->reg[regstack->top])
- {
- /* In case one of operands is the top of stack and the operands
- dies, it is safe to make it the destination operand by
- reversing the direction of cmove and avoid fxch. */
- if ((REGNO (*src1) == regstack->reg[regstack->top]
- && src1_note)
- || (REGNO (*src2) == regstack->reg[regstack->top]
- && src2_note))
- {
- int idx1 = (get_hard_regnum (regstack, *src1)
- - FIRST_STACK_REG);
- int idx2 = (get_hard_regnum (regstack, *src2)
- - FIRST_STACK_REG);
-
- /* Make reg-stack believe that the operands are already
- swapped on the stack */
- regstack->reg[regstack->top - idx1] = REGNO (*src2);
- regstack->reg[regstack->top - idx2] = REGNO (*src1);
-
- /* Reverse condition to compensate the operand swap.
- i386 do have comparison always reversible. */
- PUT_CODE (XEXP (pat_src, 0),
- reversed_comparison_code (XEXP (pat_src, 0), insn));
- }
- else
- emit_swap_insn (insn, regstack, *dest);
- }
-
- {
- rtx src_note [3];
- int i;
-
- src_note[0] = 0;
- src_note[1] = src1_note;
- src_note[2] = src2_note;
-
- if (STACK_REG_P (*src1))
- replace_reg (src1, get_hard_regnum (regstack, *src1));
- if (STACK_REG_P (*src2))
- replace_reg (src2, get_hard_regnum (regstack, *src2));
-
- for (i = 1; i <= 2; i++)
- if (src_note [i])
- {
- int regno = REGNO (XEXP (src_note[i], 0));
-
- /* If the register that dies is not at the top of
- stack, then move the top of stack to the dead reg.
- Top of stack should never die, as it is the
- destination. */
- gcc_assert (regno != regstack->reg[regstack->top]);
- remove_regno_note (insn, REG_DEAD, regno);
- emit_pop_insn (insn, regstack, XEXP (src_note[i], 0),
- EMIT_AFTER);
- }
- }
-
- /* Make dest the top of stack. Add dest to regstack if
- not present. */
- if (get_hard_regnum (regstack, *dest) < FIRST_STACK_REG)
- regstack->reg[++regstack->top] = REGNO (*dest);
- SET_HARD_REG_BIT (regstack->reg_set, REGNO (*dest));
- replace_reg (dest, FIRST_STACK_REG);
- break;
-
- default:
- gcc_unreachable ();
- }
- break;
- }
-
- default:
- break;
- }
-
- return control_flow_insn_deleted;
-}
-
-/* Substitute hard regnums for any stack regs in INSN, which has
- N_INPUTS inputs and N_OUTPUTS outputs. REGSTACK is the stack info
- before the insn, and is updated with changes made here.
-
- There are several requirements and assumptions about the use of
- stack-like regs in asm statements. These rules are enforced by
- record_asm_stack_regs; see comments there for details. Any
- asm_operands left in the RTL at this point may be assume to meet the
- requirements, since record_asm_stack_regs removes any problem asm. */
-
-static void
-subst_asm_stack_regs (rtx_insn *insn, stack_ptr regstack)
-{
- rtx body = PATTERN (insn);
-
- rtx *note_reg; /* Array of note contents */
- rtx **note_loc; /* Address of REG field of each note */
- enum reg_note *note_kind; /* The type of each note */
-
- rtx *clobber_reg = 0;
- rtx **clobber_loc = 0;
-
- struct stack_def temp_stack;
- int n_notes;
- int n_clobbers;
- rtx note;
- int i;
- int n_inputs, n_outputs;
-
- if (! check_asm_stack_operands (insn))
- return;
-
- /* Find out what the constraints required. If no constraint
- alternative matches, that is a compiler bug: we should have caught
- such an insn in check_asm_stack_operands. */
- extract_constrain_insn (insn);
-
- preprocess_constraints (insn);
- const operand_alternative *op_alt = which_op_alt ();
-
- get_asm_operands_in_out (body, &n_outputs, &n_inputs);
-
- /* Strip SUBREGs here to make the following code simpler. */
- for (i = 0; i < recog_data.n_operands; i++)
- if (GET_CODE (recog_data.operand[i]) == SUBREG
- && REG_P (SUBREG_REG (recog_data.operand[i])))
- {
- recog_data.operand_loc[i] = & SUBREG_REG (recog_data.operand[i]);
- recog_data.operand[i] = SUBREG_REG (recog_data.operand[i]);
- }
-
- /* Set up NOTE_REG, NOTE_LOC and NOTE_KIND. */
-
- for (i = 0, note = REG_NOTES (insn); note; note = XEXP (note, 1))
- i++;
-
- note_reg = XALLOCAVEC (rtx, i);
- note_loc = XALLOCAVEC (rtx *, i);
- note_kind = XALLOCAVEC (enum reg_note, i);
-
- n_notes = 0;
- for (note = REG_NOTES (insn); note; note = XEXP (note, 1))
- {
- if (GET_CODE (note) != EXPR_LIST)
- continue;
- rtx reg = XEXP (note, 0);
- rtx *loc = & XEXP (note, 0);
-
- if (GET_CODE (reg) == SUBREG && REG_P (SUBREG_REG (reg)))
- {
- loc = & SUBREG_REG (reg);
- reg = SUBREG_REG (reg);
- }
-
- if (STACK_REG_P (reg)
- && (REG_NOTE_KIND (note) == REG_DEAD
- || REG_NOTE_KIND (note) == REG_UNUSED))
- {
- note_reg[n_notes] = reg;
- note_loc[n_notes] = loc;
- note_kind[n_notes] = REG_NOTE_KIND (note);
- n_notes++;
- }
- }
-
- /* Set up CLOBBER_REG and CLOBBER_LOC. */
-
- n_clobbers = 0;
-
- if (GET_CODE (body) == PARALLEL)
- {
- clobber_reg = XALLOCAVEC (rtx, XVECLEN (body, 0));
- clobber_loc = XALLOCAVEC (rtx *, XVECLEN (body, 0));
-
- for (i = 0; i < XVECLEN (body, 0); i++)
- if (GET_CODE (XVECEXP (body, 0, i)) == CLOBBER)
- {
- rtx clobber = XVECEXP (body, 0, i);
- rtx reg = XEXP (clobber, 0);
- rtx *loc = & XEXP (clobber, 0);
-
- if (GET_CODE (reg) == SUBREG && REG_P (SUBREG_REG (reg)))
- {
- loc = & SUBREG_REG (reg);
- reg = SUBREG_REG (reg);
- }
-
- if (STACK_REG_P (reg))
- {
- clobber_reg[n_clobbers] = reg;
- clobber_loc[n_clobbers] = loc;
- n_clobbers++;
- }
- }
- }
-
- temp_stack = *regstack;
-
- /* Put the input regs into the desired place in TEMP_STACK. */
-
- for (i = n_outputs; i < n_outputs + n_inputs; i++)
- if (STACK_REG_P (recog_data.operand[i])
- && reg_class_subset_p (op_alt[i].cl, FLOAT_REGS)
- && op_alt[i].cl != FLOAT_REGS)
- {
- /* If an operand needs to be in a particular reg in
- FLOAT_REGS, the constraint was either 't' or 'u'. Since
- these constraints are for single register classes, and
- reload guaranteed that operand[i] is already in that class,
- we can just use REGNO (recog_data.operand[i]) to know which
- actual reg this operand needs to be in. */
-
- int regno = get_hard_regnum (&temp_stack, recog_data.operand[i]);
-
- gcc_assert (regno >= 0);
-
- if ((unsigned int) regno != REGNO (recog_data.operand[i]))
- {
- /* recog_data.operand[i] is not in the right place. Find
- it and swap it with whatever is already in I's place.
- K is where recog_data.operand[i] is now. J is where it
- should be. */
- int j, k;
-
- k = temp_stack.top - (regno - FIRST_STACK_REG);
- j = (temp_stack.top
- - (REGNO (recog_data.operand[i]) - FIRST_STACK_REG));
-
- std::swap (temp_stack.reg[j], temp_stack.reg[k]);
- }
- }
-
- /* Emit insns before INSN to make sure the reg-stack is in the right
- order. */
-
- change_stack (insn, regstack, &temp_stack, EMIT_BEFORE);
-
- /* Make the needed input register substitutions. Do death notes and
- clobbers too, because these are for inputs, not outputs. */
-
- for (i = n_outputs; i < n_outputs + n_inputs; i++)
- if (STACK_REG_P (recog_data.operand[i]))
- {
- int regnum = get_hard_regnum (regstack, recog_data.operand[i]);
-
- gcc_assert (regnum >= 0);
-
- replace_reg (recog_data.operand_loc[i], regnum);
- }
-
- for (i = 0; i < n_notes; i++)
- if (note_kind[i] == REG_DEAD)
- {
- int regnum = get_hard_regnum (regstack, note_reg[i]);
-
- gcc_assert (regnum >= 0);
-
- replace_reg (note_loc[i], regnum);
- }
-
- for (i = 0; i < n_clobbers; i++)
- {
- /* It's OK for a CLOBBER to reference a reg that is not live.
- Don't try to replace it in that case. */
- int regnum = get_hard_regnum (regstack, clobber_reg[i]);
-
- if (regnum >= 0)
- replace_reg (clobber_loc[i], regnum);
- }
-
- /* Now remove from REGSTACK any inputs that the asm implicitly popped. */
-
- for (i = n_outputs; i < n_outputs + n_inputs; i++)
- if (STACK_REG_P (recog_data.operand[i]))
- {
- /* An input reg is implicitly popped if it is tied to an
- output, or if there is a CLOBBER for it. */
- int j;
-
- for (j = 0; j < n_clobbers; j++)
- if (operands_match_p (clobber_reg[j], recog_data.operand[i]))
- break;
-
- if (j < n_clobbers || op_alt[i].matches >= 0)
- {
- /* recog_data.operand[i] might not be at the top of stack.
- But that's OK, because all we need to do is pop the
- right number of regs off of the top of the reg-stack.
- record_asm_stack_regs guaranteed that all implicitly
- popped regs were grouped at the top of the reg-stack. */
-
- CLEAR_HARD_REG_BIT (regstack->reg_set,
- regstack->reg[regstack->top]);
- regstack->top--;
- }
- }
-
- /* Now add to REGSTACK any outputs that the asm implicitly pushed.
- Note that there isn't any need to substitute register numbers.
- ??? Explain why this is true. */
-
- for (i = LAST_STACK_REG; i >= FIRST_STACK_REG; i--)
- {
- /* See if there is an output for this hard reg. */
- int j;
-
- for (j = 0; j < n_outputs; j++)
- if (STACK_REG_P (recog_data.operand[j])
- && REGNO (recog_data.operand[j]) == (unsigned) i)
- {
- regstack->reg[++regstack->top] = i;
- SET_HARD_REG_BIT (regstack->reg_set, i);
- break;
- }
- }
-
- /* Now emit a pop insn for any REG_UNUSED output, or any REG_DEAD
- input that the asm didn't implicitly pop. If the asm didn't
- implicitly pop an input reg, that reg will still be live.
-
- Note that we can't use find_regno_note here: the register numbers
- in the death notes have already been substituted. */
-
- for (i = 0; i < n_outputs; i++)
- if (STACK_REG_P (recog_data.operand[i]))
- {
- int j;
-
- for (j = 0; j < n_notes; j++)
- if (REGNO (recog_data.operand[i]) == REGNO (note_reg[j])
- && note_kind[j] == REG_UNUSED)
- {
- insn = emit_pop_insn (insn, regstack, recog_data.operand[i],
- EMIT_AFTER);
- break;
- }
- }
-
- for (i = n_outputs; i < n_outputs + n_inputs; i++)
- if (STACK_REG_P (recog_data.operand[i]))
- {
- int j;
-
- for (j = 0; j < n_notes; j++)
- if (REGNO (recog_data.operand[i]) == REGNO (note_reg[j])
- && note_kind[j] == REG_DEAD
- && TEST_HARD_REG_BIT (regstack->reg_set,
- REGNO (recog_data.operand[i])))
- {
- insn = emit_pop_insn (insn, regstack, recog_data.operand[i],
- EMIT_AFTER);
- break;
- }
- }
-}
-
-/* Return true if a function call is allowed to alter some or all bits
- of any stack reg. */
-static bool
-callee_clobbers_any_stack_reg (const function_abi & callee_abi)
-{
- for (unsigned regno = FIRST_STACK_REG; regno <= LAST_STACK_REG; regno++)
- if (callee_abi.clobbers_at_least_part_of_reg_p (regno))
- return true;
- return false;
-}
-
-
-/* Substitute stack hard reg numbers for stack virtual registers in
- INSN. Non-stack register numbers are not changed. REGSTACK is the
- current stack content. Insns may be emitted as needed to arrange the
- stack for the 387 based on the contents of the insn. Return whether
- a control flow insn was deleted in the process. */
-
-static bool
-subst_stack_regs (rtx_insn *insn, stack_ptr regstack)
-{
- rtx *note_link, note;
- bool control_flow_insn_deleted = false;
- int i;
-
- /* If the target of the call doesn't clobber any stack registers,
- Don't clear the arguments. */
- if (CALL_P (insn)
- && callee_clobbers_any_stack_reg (insn_callee_abi (insn)))
- {
- int top = regstack->top;
-
- /* If there are any floating point parameters to be passed in
- registers for this call, make sure they are in the right
- order. */
-
- if (top >= 0)
- {
- straighten_stack (insn, regstack);
-
- /* Now mark the arguments as dead after the call. */
-
- while (regstack->top >= 0)
- {
- CLEAR_HARD_REG_BIT (regstack->reg_set, FIRST_STACK_REG + regstack->top);
- regstack->top--;
- }
- }
- }
-
- /* Do the actual substitution if any stack regs are mentioned.
- Since we only record whether entire insn mentions stack regs, and
- subst_stack_regs_pat only works for patterns that contain stack regs,
- we must check each pattern in a parallel here. A call_value_pop could
- fail otherwise. */
-
- if (stack_regs_mentioned (insn))
- {
- int n_operands = asm_noperands (PATTERN (insn));
- if (n_operands >= 0)
- {
- /* This insn is an `asm' with operands. Decode the operands,
- decide how many are inputs, and do register substitution.
- Any REG_UNUSED notes will be handled by subst_asm_stack_regs. */
-
- subst_asm_stack_regs (insn, regstack);
- return control_flow_insn_deleted;
- }
-
- if (GET_CODE (PATTERN (insn)) == PARALLEL)
- for (i = 0; i < XVECLEN (PATTERN (insn), 0); i++)
- {
- if (stack_regs_mentioned_p (XVECEXP (PATTERN (insn), 0, i)))
- {
- if (GET_CODE (XVECEXP (PATTERN (insn), 0, i)) == CLOBBER)
- XVECEXP (PATTERN (insn), 0, i)
- = shallow_copy_rtx (XVECEXP (PATTERN (insn), 0, i));
- control_flow_insn_deleted
- |= subst_stack_regs_pat (insn, regstack,
- XVECEXP (PATTERN (insn), 0, i));
- }
- }
- else
- control_flow_insn_deleted
- |= subst_stack_regs_pat (insn, regstack, PATTERN (insn));
- }
-
- /* subst_stack_regs_pat may have deleted a no-op insn. If so, any
- REG_UNUSED will already have been dealt with, so just return. */
-
- if (NOTE_P (insn) || insn->deleted ())
- return control_flow_insn_deleted;
-
- /* If this a noreturn call, we can't insert pop insns after it.
- Instead, reset the stack state to empty. */
- if (CALL_P (insn)
- && find_reg_note (insn, REG_NORETURN, NULL))
- {
- regstack->top = -1;
- CLEAR_HARD_REG_SET (regstack->reg_set);
- return control_flow_insn_deleted;
- }
-
- /* If there is a REG_UNUSED note on a stack register on this insn,
- the indicated reg must be popped. The REG_UNUSED note is removed,
- since the form of the newly emitted pop insn references the reg,
- making it no longer `unset'. */
-
- note_link = &REG_NOTES (insn);
- for (note = *note_link; note; note = XEXP (note, 1))
- if (REG_NOTE_KIND (note) == REG_UNUSED && STACK_REG_P (XEXP (note, 0)))
- {
- *note_link = XEXP (note, 1);
- insn = emit_pop_insn (insn, regstack, XEXP (note, 0), EMIT_AFTER);
- }
- else
- note_link = &XEXP (note, 1);
-
- return control_flow_insn_deleted;
-}
-
-/* Change the organization of the stack so that it fits a new basic
- block. Some registers might have to be popped, but there can never be
- a register live in the new block that is not now live.
-
- Insert any needed insns before or after INSN, as indicated by
- WHERE. OLD is the original stack layout, and NEW is the desired
- form. OLD is updated to reflect the code emitted, i.e., it will be
- the same as NEW upon return.
-
- This function will not preserve block_end[]. But that information
- is no longer needed once this has executed. */
-
-static void
-change_stack (rtx_insn *insn, stack_ptr old, stack_ptr new_stack,
- enum emit_where where)
-{
- int reg;
- machine_mode raw_mode = reg_raw_mode[FIRST_STACK_REG];
- rtx_insn *update_end = NULL;
- int i;
-
- /* Stack adjustments for the first insn in a block update the
- current_block's stack_in instead of inserting insns directly.
- compensate_edges will add the necessary code later. */
- if (current_block
- && starting_stack_p
- && where == EMIT_BEFORE)
- {
- BLOCK_INFO (current_block)->stack_in = *new_stack;
- starting_stack_p = false;
- *old = *new_stack;
- return;
- }
-
- /* We will be inserting new insns "backwards". If we are to insert
- after INSN, find the next insn, and insert before it. */
-
- if (where == EMIT_AFTER)
- {
- if (current_block && BB_END (current_block) == insn)
- update_end = insn;
- insn = NEXT_INSN (insn);
- }
-
- /* Initialize partially dead variables. */
- for (i = FIRST_STACK_REG; i < LAST_STACK_REG + 1; i++)
- if (TEST_HARD_REG_BIT (new_stack->reg_set, i)
- && !TEST_HARD_REG_BIT (old->reg_set, i))
- {
- old->reg[++old->top] = i;
- SET_HARD_REG_BIT (old->reg_set, i);
- emit_insn_before (gen_rtx_SET (FP_MODE_REG (i, SFmode), not_a_num),
- insn);
- }
-
- /* Pop any registers that are not needed in the new block. */
-
- /* If the destination block's stack already has a specified layout
- and contains two or more registers, use a more intelligent algorithm
- to pop registers that minimizes the number of fxchs below. */
- if (new_stack->top > 0)
- {
- bool slots[REG_STACK_SIZE];
- int pops[REG_STACK_SIZE];
- int next, dest, topsrc;
-
- /* First pass to determine the free slots. */
- for (reg = 0; reg <= new_stack->top; reg++)
- slots[reg] = TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[reg]);
-
- /* Second pass to allocate preferred slots. */
- topsrc = -1;
- for (reg = old->top; reg > new_stack->top; reg--)
- if (TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[reg]))
- {
- dest = -1;
- for (next = 0; next <= new_stack->top; next++)
- if (!slots[next] && new_stack->reg[next] == old->reg[reg])
- {
- /* If this is a preference for the new top of stack, record
- the fact by remembering it's old->reg in topsrc. */
- if (next == new_stack->top)
- topsrc = reg;
- slots[next] = true;
- dest = next;
- break;
- }
- pops[reg] = dest;
- }
- else
- pops[reg] = reg;
-
- /* Intentionally, avoid placing the top of stack in it's correct
- location, if we still need to permute the stack below and we
- can usefully place it somewhere else. This is the case if any
- slot is still unallocated, in which case we should place the
- top of stack there. */
- if (topsrc != -1)
- for (reg = 0; reg < new_stack->top; reg++)
- if (!slots[reg])
- {
- pops[topsrc] = reg;
- slots[new_stack->top] = false;
- slots[reg] = true;
- break;
- }
-
- /* Third pass allocates remaining slots and emits pop insns. */
- next = new_stack->top;
- for (reg = old->top; reg > new_stack->top; reg--)
- {
- dest = pops[reg];
- if (dest == -1)
- {
- /* Find next free slot. */
- while (slots[next])
- next--;
- dest = next--;
- }
- emit_pop_insn (insn, old, FP_MODE_REG (old->reg[dest], raw_mode),
- EMIT_BEFORE);
- }
- }
- else
- {
- /* The following loop attempts to maximize the number of times we
- pop the top of the stack, as this permits the use of the faster
- ffreep instruction on platforms that support it. */
- int live, next;
-
- live = 0;
- for (reg = 0; reg <= old->top; reg++)
- if (TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[reg]))
- live++;
-
- next = live;
- while (old->top >= live)
- if (TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[old->top]))
- {
- while (TEST_HARD_REG_BIT (new_stack->reg_set, old->reg[next]))
- next--;
- emit_pop_insn (insn, old, FP_MODE_REG (old->reg[next], raw_mode),
- EMIT_BEFORE);
- }
- else
- emit_pop_insn (insn, old, FP_MODE_REG (old->reg[old->top], raw_mode),
- EMIT_BEFORE);
- }
-
- if (new_stack->top == -2)
- {
- /* If the new block has never been processed, then it can inherit
- the old stack order. */
-
- new_stack->top = old->top;
- memcpy (new_stack->reg, old->reg, sizeof (new_stack->reg));
- }
- else
- {
- /* This block has been entered before, and we must match the
- previously selected stack order. */
-
- /* By now, the only difference should be the order of the stack,
- not their depth or liveliness. */
-
- gcc_assert (old->reg_set == new_stack->reg_set);
- gcc_assert (old->top == new_stack->top);
-
- /* If the stack is not empty (new_stack->top != -1), loop here emitting
- swaps until the stack is correct.
-
- The worst case number of swaps emitted is N + 2, where N is the
- depth of the stack. In some cases, the reg at the top of
- stack may be correct, but swapped anyway in order to fix
- other regs. But since we never swap any other reg away from
- its correct slot, this algorithm will converge. */
-
- if (new_stack->top != -1)
- do
- {
- /* Swap the reg at top of stack into the position it is
- supposed to be in, until the correct top of stack appears. */
-
- while (old->reg[old->top] != new_stack->reg[new_stack->top])
- {
- for (reg = new_stack->top; reg >= 0; reg--)
- if (new_stack->reg[reg] == old->reg[old->top])
- break;
-
- gcc_assert (reg != -1);
-
- emit_swap_insn (insn, old,
- FP_MODE_REG (old->reg[reg], raw_mode));
- }
-
- /* See if any regs remain incorrect. If so, bring an
- incorrect reg to the top of stack, and let the while loop
- above fix it. */
-
- for (reg = new_stack->top; reg >= 0; reg--)
- if (new_stack->reg[reg] != old->reg[reg])
- {
- emit_swap_insn (insn, old,
- FP_MODE_REG (old->reg[reg], raw_mode));
- break;
- }
- } while (reg >= 0);
-
- /* At this point there must be no differences. */
-
- for (reg = old->top; reg >= 0; reg--)
- gcc_assert (old->reg[reg] == new_stack->reg[reg]);
- }
-
- if (update_end)
- {
- for (update_end = NEXT_INSN (update_end); update_end != insn;
- update_end = NEXT_INSN (update_end))
- {
- set_block_for_insn (update_end, current_block);
- if (INSN_P (update_end))
- df_insn_rescan (update_end);
- }
- BB_END (current_block) = PREV_INSN (insn);
- }
-}
-
-/* Print stack configuration. */
-
-static void
-print_stack (FILE *file, stack_ptr s)
-{
- if (! file)
- return;
-
- if (s->top == -2)
- fprintf (file, "uninitialized\n");
- else if (s->top == -1)
- fprintf (file, "empty\n");
- else
- {
- int i;
- fputs ("[ ", file);
- for (i = 0; i <= s->top; ++i)
- fprintf (file, "%d ", s->reg[i]);
- fputs ("]\n", file);
- }
-}
-
-/* This function was doing life analysis. We now let the regular live
- code do it's job, so we only need to check some extra invariants
- that reg-stack expects. Primary among these being that all registers
- are initialized before use.
-
- The function returns true when code was emitted to CFG edges and
- commit_edge_insertions needs to be called. */
-
-static int
-convert_regs_entry (void)
-{
- int inserted = 0;
- edge e;
- edge_iterator ei;
-
- /* Load something into each stack register live at function entry.
- Such live registers can be caused by uninitialized variables or
- functions not returning values on all paths. In order to keep
- the push/pop code happy, and to not scrog the register stack, we
- must put something in these registers. Use a QNaN.
-
- Note that we are inserting converted code here. This code is
- never seen by the convert_regs pass. */
-
- FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)
- {
- basic_block block = e->dest;
- block_info bi = BLOCK_INFO (block);
- int reg, top = -1;
-
- for (reg = LAST_STACK_REG; reg >= FIRST_STACK_REG; --reg)
- if (TEST_HARD_REG_BIT (bi->stack_in.reg_set, reg))
- {
- rtx init;
-
- bi->stack_in.reg[++top] = reg;
-
- init = gen_rtx_SET (FP_MODE_REG (FIRST_STACK_REG, SFmode),
- not_a_num);
- insert_insn_on_edge (init, e);
- inserted = 1;
- }
-
- bi->stack_in.top = top;
- }
-
- return inserted;
-}
-
-/* Construct the desired stack for function exit. This will either
- be `empty', or the function return value at top-of-stack. */
-
-static void
-convert_regs_exit (void)
-{
- int value_reg_low, value_reg_high;
- stack_ptr output_stack;
- rtx retvalue;
-
- retvalue = stack_result (current_function_decl);
- value_reg_low = value_reg_high = -1;
- if (retvalue)
- {
- value_reg_low = REGNO (retvalue);
- value_reg_high = END_REGNO (retvalue) - 1;
- }
-
- output_stack = &BLOCK_INFO (EXIT_BLOCK_PTR_FOR_FN (cfun))->stack_in;
- if (value_reg_low == -1)
- output_stack->top = -1;
- else
- {
- int reg;
-
- output_stack->top = value_reg_high - value_reg_low;
- for (reg = value_reg_low; reg <= value_reg_high; ++reg)
- {
- output_stack->reg[value_reg_high - reg] = reg;
- SET_HARD_REG_BIT (output_stack->reg_set, reg);
- }
- }
-}
-
-/* Copy the stack info from the end of edge E's source block to the
- start of E's destination block. */
-
-static void
-propagate_stack (edge e)
-{
- stack_ptr src_stack = &BLOCK_INFO (e->src)->stack_out;
- stack_ptr dest_stack = &BLOCK_INFO (e->dest)->stack_in;
- int reg;
-
- /* Preserve the order of the original stack, but check whether
- any pops are needed. */
- dest_stack->top = -1;
- for (reg = 0; reg <= src_stack->top; ++reg)
- if (TEST_HARD_REG_BIT (dest_stack->reg_set, src_stack->reg[reg]))
- dest_stack->reg[++dest_stack->top] = src_stack->reg[reg];
-
- /* Push in any partially dead values. */
- for (reg = FIRST_STACK_REG; reg < LAST_STACK_REG + 1; reg++)
- if (TEST_HARD_REG_BIT (dest_stack->reg_set, reg)
- && !TEST_HARD_REG_BIT (src_stack->reg_set, reg))
- dest_stack->reg[++dest_stack->top] = reg;
-}
-
-
-/* Adjust the stack of edge E's source block on exit to match the stack
- of it's target block upon input. The stack layouts of both blocks
- should have been defined by now. */
-
-static bool
-compensate_edge (edge e)
-{
- basic_block source = e->src, target = e->dest;
- stack_ptr target_stack = &BLOCK_INFO (target)->stack_in;
- stack_ptr source_stack = &BLOCK_INFO (source)->stack_out;
- struct stack_def regstack;
- int reg;
-
- if (dump_file)
- fprintf (dump_file, "Edge %d->%d: ", source->index, target->index);
-
- gcc_assert (target_stack->top != -2);
-
- /* Check whether stacks are identical. */
- if (target_stack->top == source_stack->top)
- {
- for (reg = target_stack->top; reg >= 0; --reg)
- if (target_stack->reg[reg] != source_stack->reg[reg])
- break;
-
- if (reg == -1)
- {
- if (dump_file)
- fprintf (dump_file, "no changes needed\n");
- return false;
- }
- }
-
- if (dump_file)
- {
- fprintf (dump_file, "correcting stack to ");
- print_stack (dump_file, target_stack);
- }
-
- /* Abnormal calls may appear to have values live in st(0), but the
- abnormal return path will not have actually loaded the values. */
- if (e->flags & EDGE_ABNORMAL_CALL)
- {
- /* Assert that the lifetimes are as we expect -- one value
- live at st(0) on the end of the source block, and no
- values live at the beginning of the destination block.
- For complex return values, we may have st(1) live as well. */
- gcc_assert (source_stack->top == 0 || source_stack->top == 1);
- gcc_assert (target_stack->top == -1);
- return false;
- }
-
- /* Handle non-call EH edges specially. The normal return path have
- values in registers. These will be popped en masse by the unwind
- library. */
- if (e->flags & EDGE_EH)
- {
- gcc_assert (target_stack->top == -1);
- return false;
- }
-
- /* We don't support abnormal edges. Global takes care to
- avoid any live register across them, so we should never
- have to insert instructions on such edges. */
- gcc_assert (! (e->flags & EDGE_ABNORMAL));
-
- /* Make a copy of source_stack as change_stack is destructive. */
- regstack = *source_stack;
-
- /* It is better to output directly to the end of the block
- instead of to the edge, because emit_swap can do minimal
- insn scheduling. We can do this when there is only one
- edge out, and it is not abnormal. */
- if (EDGE_COUNT (source->succs) == 1)
- {
- current_block = source;
- change_stack (BB_END (source), &regstack, target_stack,
- (JUMP_P (BB_END (source)) ? EMIT_BEFORE : EMIT_AFTER));
- }
- else
- {
- rtx_insn *seq;
- rtx_note *after;
-
- current_block = NULL;
- start_sequence ();
-
- /* ??? change_stack needs some point to emit insns after. */
- after = emit_note (NOTE_INSN_DELETED);
-
- change_stack (after, &regstack, target_stack, EMIT_BEFORE);
-
- seq = get_insns ();
- end_sequence ();
-
- set_insn_locations (seq, e->goto_locus);
- insert_insn_on_edge (seq, e);
- return true;
- }
- return false;
-}
-
-/* Traverse all non-entry edges in the CFG, and emit the necessary
- edge compensation code to change the stack from stack_out of the
- source block to the stack_in of the destination block. */
-
-static bool
-compensate_edges (void)
-{
- bool inserted = false;
- basic_block bb;
-
- starting_stack_p = false;
-
- FOR_EACH_BB_FN (bb, cfun)
- if (bb != ENTRY_BLOCK_PTR_FOR_FN (cfun))
- {
- edge e;
- edge_iterator ei;
-
- FOR_EACH_EDGE (e, ei, bb->succs)
- inserted |= compensate_edge (e);
- }
- return inserted;
-}
-
-/* Select the better of two edges E1 and E2 to use to determine the
- stack layout for their shared destination basic block. This is
- typically the more frequently executed. The edge E1 may be NULL
- (in which case E2 is returned), but E2 is always non-NULL. */
-
-static edge
-better_edge (edge e1, edge e2)
-{
- if (!e1)
- return e2;
-
- if (e1->count () > e2->count ())
- return e1;
- if (e1->count () < e2->count ())
- return e2;
-
- /* Prefer critical edges to minimize inserting compensation code on
- critical edges. */
-
- if (EDGE_CRITICAL_P (e1) != EDGE_CRITICAL_P (e2))
- return EDGE_CRITICAL_P (e1) ? e1 : e2;
-
- /* Avoid non-deterministic behavior. */
- return (e1->src->index < e2->src->index) ? e1 : e2;
-}
-
-/* Convert stack register references in one block. Return true if the CFG
- has been modified in the process. */
-
-static bool
-convert_regs_1 (basic_block block)
-{
- struct stack_def regstack;
- block_info bi = BLOCK_INFO (block);
- int reg;
- rtx_insn *insn, *next;
- bool control_flow_insn_deleted = false;
- bool cfg_altered = false;
- int debug_insns_with_starting_stack = 0;
-
- /* Choose an initial stack layout, if one hasn't already been chosen. */
- if (bi->stack_in.top == -2)
- {
- edge e, beste = NULL;
- edge_iterator ei;
-
- /* Select the best incoming edge (typically the most frequent) to
- use as a template for this basic block. */
- FOR_EACH_EDGE (e, ei, block->preds)
- if (BLOCK_INFO (e->src)->done)
- beste = better_edge (beste, e);
-
- if (beste)
- propagate_stack (beste);
- else
- {
- /* No predecessors. Create an arbitrary input stack. */
- bi->stack_in.top = -1;
- for (reg = LAST_STACK_REG; reg >= FIRST_STACK_REG; --reg)
- if (TEST_HARD_REG_BIT (bi->stack_in.reg_set, reg))
- bi->stack_in.reg[++bi->stack_in.top] = reg;
- }
- }
-
- if (dump_file)
- {
- fprintf (dump_file, "\nBasic block %d\nInput stack: ", block->index);
- print_stack (dump_file, &bi->stack_in);
- }
-
- /* Process all insns in this block. Keep track of NEXT so that we
- don't process insns emitted while substituting in INSN. */
- current_block = block;
- next = BB_HEAD (block);
- regstack = bi->stack_in;
- starting_stack_p = true;
-
- do
- {
- insn = next;
- next = NEXT_INSN (insn);
-
- /* Ensure we have not missed a block boundary. */
- gcc_assert (next);
- if (insn == BB_END (block))
- next = NULL;
-
- /* Don't bother processing unless there is a stack reg
- mentioned or if it's a CALL_INSN. */
- if (DEBUG_BIND_INSN_P (insn))
- {
- if (starting_stack_p)
- debug_insns_with_starting_stack++;
- else
- {
- subst_all_stack_regs_in_debug_insn (insn, &regstack);
-
- /* Nothing must ever die at a debug insn. If something
- is referenced in it that becomes dead, it should have
- died before and the reference in the debug insn
- should have been removed so as to avoid changing code
- generation. */
- gcc_assert (!find_reg_note (insn, REG_DEAD, NULL));
- }
- }
- else if (stack_regs_mentioned (insn)
- || CALL_P (insn))
- {
- if (dump_file)
- {
- fprintf (dump_file, " insn %d input stack: ",
- INSN_UID (insn));
- print_stack (dump_file, &regstack);
- }
- control_flow_insn_deleted |= subst_stack_regs (insn, &regstack);
- starting_stack_p = false;
- }
- }
- while (next);
-
- if (debug_insns_with_starting_stack)
- {
- /* Since it's the first non-debug instruction that determines
- the stack requirements of the current basic block, we refrain
- from updating debug insns before it in the loop above, and
- fix them up here. */
- for (insn = BB_HEAD (block); debug_insns_with_starting_stack;
- insn = NEXT_INSN (insn))
- {
- if (!DEBUG_BIND_INSN_P (insn))
- continue;
-
- debug_insns_with_starting_stack--;
- subst_all_stack_regs_in_debug_insn (insn, &bi->stack_in);
- }
- }
-
- if (dump_file)
- {
- fprintf (dump_file, "Expected live registers [");
- for (reg = FIRST_STACK_REG; reg <= LAST_STACK_REG; ++reg)
- if (TEST_HARD_REG_BIT (bi->out_reg_set, reg))
- fprintf (dump_file, " %d", reg);
- fprintf (dump_file, " ]\nOutput stack: ");
- print_stack (dump_file, &regstack);
- }
-
- insn = BB_END (block);
- if (JUMP_P (insn))
- insn = PREV_INSN (insn);
-
- /* If the function is declared to return a value, but it returns one
- in only some cases, some registers might come live here. Emit
- necessary moves for them. */
-
- for (reg = FIRST_STACK_REG; reg <= LAST_STACK_REG; ++reg)
- {
- if (TEST_HARD_REG_BIT (bi->out_reg_set, reg)
- && ! TEST_HARD_REG_BIT (regstack.reg_set, reg))
- {
- rtx set;
-
- if (dump_file)
- fprintf (dump_file, "Emitting insn initializing reg %d\n", reg);
-
- set = gen_rtx_SET (FP_MODE_REG (reg, SFmode), not_a_num);
- insn = emit_insn_after (set, insn);
- control_flow_insn_deleted |= subst_stack_regs (insn, &regstack);
- }
- }
-
- /* Amongst the insns possibly deleted during the substitution process above,
- might have been the only trapping insn in the block. We purge the now
- possibly dead EH edges here to avoid an ICE from fixup_abnormal_edges,
- called at the end of convert_regs. The order in which we process the
- blocks ensures that we never delete an already processed edge.
-
- Note that, at this point, the CFG may have been damaged by the emission
- of instructions after an abnormal call, which moves the basic block end
- (and is the reason why we call fixup_abnormal_edges later). So we must
- be sure that the trapping insn has been deleted before trying to purge
- dead edges, otherwise we risk purging valid edges.
-
- ??? We are normally supposed not to delete trapping insns, so we pretend
- that the insns deleted above don't actually trap. It would have been
- better to detect this earlier and avoid creating the EH edge in the first
- place, still, but we don't have enough information at that time. */
-
- if (control_flow_insn_deleted)
- cfg_altered |= purge_dead_edges (block);
-
- /* Something failed if the stack lives don't match. If we had malformed
- asms, we zapped the instruction itself, but that didn't produce the
- same pattern of register kills as before. */
-
- gcc_assert (regstack.reg_set == bi->out_reg_set || any_malformed_asm);
- bi->stack_out = regstack;
- bi->done = true;
-
- return cfg_altered;
-}
-
-/* Convert registers in all blocks reachable from BLOCK. Return true if the
- CFG has been modified in the process. */
-
-static bool
-convert_regs_2 (basic_block block)
-{
- basic_block *stack, *sp;
- bool cfg_altered = false;
-
- /* We process the blocks in a top-down manner, in a way such that one block
- is only processed after all its predecessors. The number of predecessors
- of every block has already been computed. */
-
- stack = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun));
- sp = stack;
-
- *sp++ = block;
-
- do
- {
- edge e;
- edge_iterator ei;
-
- block = *--sp;
-
- /* Processing BLOCK is achieved by convert_regs_1, which may purge
- some dead EH outgoing edge after the deletion of the trapping
- insn inside the block. Since the number of predecessors of
- BLOCK's successors was computed based on the initial edge set,
- we check the necessity to process some of these successors
- before such an edge deletion may happen. However, there is
- a pitfall: if BLOCK is the only predecessor of a successor and
- the edge between them happens to be deleted, the successor
- becomes unreachable and should not be processed. The problem
- is that there is no way to preventively detect this case so we
- stack the successor in all cases and hand over the task of
- fixing up the discrepancy to convert_regs_1. */
-
- FOR_EACH_EDGE (e, ei, block->succs)
- if (! (e->flags & EDGE_DFS_BACK))
- {
- BLOCK_INFO (e->dest)->predecessors--;
- if (!BLOCK_INFO (e->dest)->predecessors)
- *sp++ = e->dest;
- }
-
- cfg_altered |= convert_regs_1 (block);
- }
- while (sp != stack);
-
- free (stack);
-
- return cfg_altered;
-}
-
-/* Traverse all basic blocks in a function, converting the register
- references in each insn from the "flat" register file that gcc uses,
- to the stack-like registers the 387 uses. */
-
-static void
-convert_regs (void)
-{
- bool cfg_altered = false;
- int inserted;
- basic_block b;
- edge e;
- edge_iterator ei;
-
- /* Initialize uninitialized registers on function entry. */
- inserted = convert_regs_entry ();
-
- /* Construct the desired stack for function exit. */
- convert_regs_exit ();
- BLOCK_INFO (EXIT_BLOCK_PTR_FOR_FN (cfun))->done = 1;
-
- /* ??? Future: process inner loops first, and give them arbitrary
- initial stacks which emit_swap_insn can modify. This ought to
- prevent double fxch that often appears at the head of a loop. */
-
- /* Process all blocks reachable from all entry points. */
- FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)
- cfg_altered |= convert_regs_2 (e->dest);
-
- /* ??? Process all unreachable blocks. Though there's no excuse
- for keeping these even when not optimizing. */
- FOR_EACH_BB_FN (b, cfun)
- {
- block_info bi = BLOCK_INFO (b);
-
- if (! bi->done)
- cfg_altered |= convert_regs_2 (b);
- }
-
- /* We must fix up abnormal edges before inserting compensation code
- because both mechanisms insert insns on edges. */
- inserted |= fixup_abnormal_edges ();
-
- inserted |= compensate_edges ();
-
- clear_aux_for_blocks ();
-
- if (inserted)
- commit_edge_insertions ();
-
- if (cfg_altered)
- cleanup_cfg (0);
-
- if (dump_file)
- fputc ('\n', dump_file);
-}
-
-/* Convert register usage from "flat" register file usage to a "stack
- register file. FILE is the dump file, if used.
-
- Construct a CFG and run life analysis. Then convert each insn one
- by one. Run a last cleanup_cfg pass, if optimizing, to eliminate
- code duplication created when the converter inserts pop insns on
- the edges. */
-
-static bool
-reg_to_stack (void)
-{
- basic_block bb;
- int i;
- int max_uid;
-
- /* Clean up previous run. */
- stack_regs_mentioned_data.release ();
-
- /* See if there is something to do. Flow analysis is quite
- expensive so we might save some compilation time. */
- for (i = FIRST_STACK_REG; i <= LAST_STACK_REG; i++)
- if (df_regs_ever_live_p (i))
- break;
- if (i > LAST_STACK_REG)
- return false;
-
- df_note_add_problem ();
- df_analyze ();
-
- mark_dfs_back_edges ();
-
- /* Set up block info for each basic block. */
- alloc_aux_for_blocks (sizeof (struct block_info_def));
- FOR_EACH_BB_FN (bb, cfun)
- {
- block_info bi = BLOCK_INFO (bb);
- edge_iterator ei;
- edge e;
- int reg;
-
- FOR_EACH_EDGE (e, ei, bb->preds)
- if (!(e->flags & EDGE_DFS_BACK)
- && e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun))
- bi->predecessors++;
-
- /* Set current register status at last instruction `uninitialized'. */
- bi->stack_in.top = -2;
-
- /* Copy live_at_end and live_at_start into temporaries. */
- for (reg = FIRST_STACK_REG; reg <= LAST_STACK_REG; reg++)
- {
- if (REGNO_REG_SET_P (DF_LR_OUT (bb), reg))
- SET_HARD_REG_BIT (bi->out_reg_set, reg);
- if (REGNO_REG_SET_P (DF_LR_IN (bb), reg))
- SET_HARD_REG_BIT (bi->stack_in.reg_set, reg);
- }
- }
-
- /* Create the replacement registers up front. */
- for (i = FIRST_STACK_REG; i <= LAST_STACK_REG; i++)
- {
- machine_mode mode;
- FOR_EACH_MODE_IN_CLASS (mode, MODE_FLOAT)
- FP_MODE_REG (i, mode) = gen_rtx_REG (mode, i);
- FOR_EACH_MODE_IN_CLASS (mode, MODE_COMPLEX_FLOAT)
- FP_MODE_REG (i, mode) = gen_rtx_REG (mode, i);
- }
-
- ix86_flags_rtx = gen_rtx_REG (CCmode, FLAGS_REG);
-
- /* A QNaN for initializing uninitialized variables.
-
- ??? We can't load from constant memory in PIC mode, because
- we're inserting these instructions before the prologue and
- the PIC register hasn't been set up. In that case, fall back
- on zero, which we can get from `fldz'. */
-
- if ((flag_pic && !TARGET_64BIT)
- || ix86_cmodel == CM_LARGE || ix86_cmodel == CM_LARGE_PIC)
- not_a_num = CONST0_RTX (SFmode);
- else
- {
- REAL_VALUE_TYPE r;
-
- real_nan (&r, "", 1, SFmode);
- not_a_num = const_double_from_real_value (r, SFmode);
- not_a_num = force_const_mem (SFmode, not_a_num);
- }
-
- /* Allocate a cache for stack_regs_mentioned. */
- max_uid = get_max_uid ();
- stack_regs_mentioned_data.create (max_uid + 1);
- memset (stack_regs_mentioned_data.address (),
- 0, sizeof (char) * (max_uid + 1));
-
- convert_regs ();
- any_malformed_asm = false;
-
- free_aux_for_blocks ();
- return true;
-}
-#endif /* STACK_REGS */
-
-namespace {
-
-const pass_data pass_data_stack_regs =
-{
- RTL_PASS, /* type */
- "*stack_regs", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_REG_STACK, /* tv_id */
- 0, /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_stack_regs : public rtl_opt_pass
-{
-public:
- pass_stack_regs (gcc::context *ctxt)
- : rtl_opt_pass (pass_data_stack_regs, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual bool gate (function *)
- {
-#ifdef STACK_REGS
- return true;
-#else
- return false;
-#endif
- }
-
-}; // class pass_stack_regs
-
-} // anon namespace
-
-rtl_opt_pass *
-make_pass_stack_regs (gcc::context *ctxt)
-{
- return new pass_stack_regs (ctxt);
-}
-
-/* Convert register usage from flat register file usage to a stack
- register file. */
-static unsigned int
-rest_of_handle_stack_regs (void)
-{
-#ifdef STACK_REGS
- if (reg_to_stack ())
- df_insn_rescan_all ();
- regstack_completed = 1;
-#endif
- return 0;
-}
-
-namespace {
-
-const pass_data pass_data_stack_regs_run =
-{
- RTL_PASS, /* type */
- "stack", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_REG_STACK, /* tv_id */
- 0, /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- TODO_df_finish, /* todo_flags_finish */
-};
-
-class pass_stack_regs_run : public rtl_opt_pass
-{
-public:
- pass_stack_regs_run (gcc::context *ctxt)
- : rtl_opt_pass (pass_data_stack_regs_run, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual unsigned int execute (function *)
- {
- return rest_of_handle_stack_regs ();
- }
-
-}; // class pass_stack_regs_run
-
-} // anon namespace
-
-rtl_opt_pass *
-make_pass_stack_regs_run (gcc::context *ctxt)
-{
- return new pass_stack_regs_run (ctxt);
-}
generated by cgit v1.1 at 2025-08-11 04:47:43 +0000