aboutsummaryrefslogtreecommitdiff
path: root/gcc/function.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/function.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/function.c')
-rw-r--r--gcc/function.c6964
1 files changed, 0 insertions, 6964 deletions
diff --git a/gcc/function.c b/gcc/function.c
deleted file mode 100644
index 210418e..0000000
--- a/gcc/function.c
+++ /dev/null
@@ -1,6964 +0,0 @@
-/* Expands front end tree to back end RTL for GCC.
- Copyright (C) 1987-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 file handles the generation of rtl code from tree structure
- at the level of the function as a whole.
- It creates the rtl expressions for parameters and auto variables
- and has full responsibility for allocating stack slots.
-
- `expand_function_start' is called at the beginning of a function,
- before the function body is parsed, and `expand_function_end' is
- called after parsing the body.
-
- Call `assign_stack_local' to allocate a stack slot for a local variable.
- This is usually done during the RTL generation for the function body,
- but it can also be done in the reload pass when a pseudo-register does
- not get a hard register. */
-
-#include "config.h"
-#include "system.h"
-#include "coretypes.h"
-#include "backend.h"
-#include "target.h"
-#include "rtl.h"
-#include "tree.h"
-#include "gimple-expr.h"
-#include "cfghooks.h"
-#include "df.h"
-#include "memmodel.h"
-#include "tm_p.h"
-#include "stringpool.h"
-#include "expmed.h"
-#include "optabs.h"
-#include "opts.h"
-#include "regs.h"
-#include "emit-rtl.h"
-#include "recog.h"
-#include "rtl-error.h"
-#include "hard-reg-set.h"
-#include "alias.h"
-#include "fold-const.h"
-#include "stor-layout.h"
-#include "varasm.h"
-#include "except.h"
-#include "dojump.h"
-#include "explow.h"
-#include "calls.h"
-#include "expr.h"
-#include "optabs-tree.h"
-#include "output.h"
-#include "langhooks.h"
-#include "common/common-target.h"
-#include "gimplify.h"
-#include "tree-pass.h"
-#include "cfgrtl.h"
-#include "cfganal.h"
-#include "cfgbuild.h"
-#include "cfgcleanup.h"
-#include "cfgexpand.h"
-#include "shrink-wrap.h"
-#include "toplev.h"
-#include "rtl-iter.h"
-#include "tree-dfa.h"
-#include "tree-ssa.h"
-#include "stringpool.h"
-#include "attribs.h"
-#include "gimple.h"
-#include "options.h"
-#include "function-abi.h"
-#include "value-range.h"
-#include "gimple-range.h"
-
-/* So we can assign to cfun in this file. */
-#undef cfun
-
-#ifndef STACK_ALIGNMENT_NEEDED
-#define STACK_ALIGNMENT_NEEDED 1
-#endif
-
-#define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
-
-/* Round a value to the lowest integer less than it that is a multiple of
- the required alignment. Avoid using division in case the value is
- negative. Assume the alignment is a power of two. */
-#define FLOOR_ROUND(VALUE,ALIGN) ((VALUE) & ~((ALIGN) - 1))
-
-/* Similar, but round to the next highest integer that meets the
- alignment. */
-#define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
-
-/* Nonzero once virtual register instantiation has been done.
- assign_stack_local uses frame_pointer_rtx when this is nonzero.
- calls.c:emit_library_call_value_1 uses it to set up
- post-instantiation libcalls. */
-int virtuals_instantiated;
-
-/* Assign unique numbers to labels generated for profiling, debugging, etc. */
-static GTY(()) int funcdef_no;
-
-/* These variables hold pointers to functions to create and destroy
- target specific, per-function data structures. */
-struct machine_function * (*init_machine_status) (void);
-
-/* The currently compiled function. */
-struct function *cfun = 0;
-
-/* These hashes record the prologue and epilogue insns. */
-
-struct insn_cache_hasher : ggc_cache_ptr_hash<rtx_def>
-{
- static hashval_t hash (rtx x) { return htab_hash_pointer (x); }
- static bool equal (rtx a, rtx b) { return a == b; }
-};
-
-static GTY((cache))
- hash_table<insn_cache_hasher> *prologue_insn_hash;
-static GTY((cache))
- hash_table<insn_cache_hasher> *epilogue_insn_hash;
-
-
-hash_table<used_type_hasher> *types_used_by_vars_hash = NULL;
-vec<tree, va_gc> *types_used_by_cur_var_decl;
-
-/* Forward declarations. */
-
-static class temp_slot *find_temp_slot_from_address (rtx);
-static void pad_to_arg_alignment (struct args_size *, int, struct args_size *);
-static void pad_below (struct args_size *, machine_mode, tree);
-static void reorder_blocks_1 (rtx_insn *, tree, vec<tree> *);
-static int all_blocks (tree, tree *);
-static tree *get_block_vector (tree, int *);
-extern tree debug_find_var_in_block_tree (tree, tree);
-/* We always define `record_insns' even if it's not used so that we
- can always export `prologue_epilogue_contains'. */
-static void record_insns (rtx_insn *, rtx, hash_table<insn_cache_hasher> **)
- ATTRIBUTE_UNUSED;
-static bool contains (const rtx_insn *, hash_table<insn_cache_hasher> *);
-static void prepare_function_start (void);
-static void do_clobber_return_reg (rtx, void *);
-static void do_use_return_reg (rtx, void *);
-
-
-/* Stack of nested functions. */
-/* Keep track of the cfun stack. */
-
-static vec<function *> function_context_stack;
-
-/* Save the current context for compilation of a nested function.
- This is called from language-specific code. */
-
-void
-push_function_context (void)
-{
- if (cfun == 0)
- allocate_struct_function (NULL, false);
-
- function_context_stack.safe_push (cfun);
- set_cfun (NULL);
-}
-
-/* Restore the last saved context, at the end of a nested function.
- This function is called from language-specific code. */
-
-void
-pop_function_context (void)
-{
- struct function *p = function_context_stack.pop ();
- set_cfun (p);
- current_function_decl = p->decl;
-
- /* Reset variables that have known state during rtx generation. */
- virtuals_instantiated = 0;
- generating_concat_p = 1;
-}
-
-/* Clear out all parts of the state in F that can safely be discarded
- after the function has been parsed, but not compiled, to let
- garbage collection reclaim the memory. */
-
-void
-free_after_parsing (struct function *f)
-{
- f->language = 0;
-}
-
-/* Clear out all parts of the state in F that can safely be discarded
- after the function has been compiled, to let garbage collection
- reclaim the memory. */
-
-void
-free_after_compilation (struct function *f)
-{
- prologue_insn_hash = NULL;
- epilogue_insn_hash = NULL;
-
- free (crtl->emit.regno_pointer_align);
-
- memset (crtl, 0, sizeof (struct rtl_data));
- f->eh = NULL;
- f->machine = NULL;
- f->cfg = NULL;
- f->curr_properties &= ~PROP_cfg;
-
- regno_reg_rtx = NULL;
-}
-
-/* Return size needed for stack frame based on slots so far allocated.
- This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
- the caller may have to do that. */
-
-poly_int64
-get_frame_size (void)
-{
- if (FRAME_GROWS_DOWNWARD)
- return -frame_offset;
- else
- return frame_offset;
-}
-
-/* Issue an error message and return TRUE if frame OFFSET overflows in
- the signed target pointer arithmetics for function FUNC. Otherwise
- return FALSE. */
-
-bool
-frame_offset_overflow (poly_int64 offset, tree func)
-{
- poly_uint64 size = FRAME_GROWS_DOWNWARD ? -offset : offset;
- unsigned HOST_WIDE_INT limit
- = ((HOST_WIDE_INT_1U << (GET_MODE_BITSIZE (Pmode) - 1))
- /* Leave room for the fixed part of the frame. */
- - 64 * UNITS_PER_WORD);
-
- if (!coeffs_in_range_p (size, 0U, limit))
- {
- unsigned HOST_WIDE_INT hwisize;
- if (size.is_constant (&hwisize))
- error_at (DECL_SOURCE_LOCATION (func),
- "total size of local objects %wu exceeds maximum %wu",
- hwisize, limit);
- else
- error_at (DECL_SOURCE_LOCATION (func),
- "total size of local objects exceeds maximum %wu",
- limit);
- return true;
- }
-
- return false;
-}
-
-/* Return the minimum spill slot alignment for a register of mode MODE. */
-
-unsigned int
-spill_slot_alignment (machine_mode mode ATTRIBUTE_UNUSED)
-{
- return STACK_SLOT_ALIGNMENT (NULL_TREE, mode, GET_MODE_ALIGNMENT (mode));
-}
-
-/* Return stack slot alignment in bits for TYPE and MODE. */
-
-static unsigned int
-get_stack_local_alignment (tree type, machine_mode mode)
-{
- unsigned int alignment;
-
- if (mode == BLKmode)
- alignment = BIGGEST_ALIGNMENT;
- else
- alignment = GET_MODE_ALIGNMENT (mode);
-
- /* Allow the frond-end to (possibly) increase the alignment of this
- stack slot. */
- if (! type)
- type = lang_hooks.types.type_for_mode (mode, 0);
-
- return STACK_SLOT_ALIGNMENT (type, mode, alignment);
-}
-
-/* Determine whether it is possible to fit a stack slot of size SIZE and
- alignment ALIGNMENT into an area in the stack frame that starts at
- frame offset START and has a length of LENGTH. If so, store the frame
- offset to be used for the stack slot in *POFFSET and return true;
- return false otherwise. This function will extend the frame size when
- given a start/length pair that lies at the end of the frame. */
-
-static bool
-try_fit_stack_local (poly_int64 start, poly_int64 length,
- poly_int64 size, unsigned int alignment,
- poly_int64_pod *poffset)
-{
- poly_int64 this_frame_offset;
- int frame_off, frame_alignment, frame_phase;
-
- /* Calculate how many bytes the start of local variables is off from
- stack alignment. */
- frame_alignment = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT;
- frame_off = targetm.starting_frame_offset () % frame_alignment;
- frame_phase = frame_off ? frame_alignment - frame_off : 0;
-
- /* Round the frame offset to the specified alignment. */
-
- if (FRAME_GROWS_DOWNWARD)
- this_frame_offset
- = (aligned_lower_bound (start + length - size - frame_phase, alignment)
- + frame_phase);
- else
- this_frame_offset
- = aligned_upper_bound (start - frame_phase, alignment) + frame_phase;
-
- /* See if it fits. If this space is at the edge of the frame,
- consider extending the frame to make it fit. Our caller relies on
- this when allocating a new slot. */
- if (maybe_lt (this_frame_offset, start))
- {
- if (known_eq (frame_offset, start))
- frame_offset = this_frame_offset;
- else
- return false;
- }
- else if (maybe_gt (this_frame_offset + size, start + length))
- {
- if (known_eq (frame_offset, start + length))
- frame_offset = this_frame_offset + size;
- else
- return false;
- }
-
- *poffset = this_frame_offset;
- return true;
-}
-
-/* Create a new frame_space structure describing free space in the stack
- frame beginning at START and ending at END, and chain it into the
- function's frame_space_list. */
-
-static void
-add_frame_space (poly_int64 start, poly_int64 end)
-{
- class frame_space *space = ggc_alloc<frame_space> ();
- space->next = crtl->frame_space_list;
- crtl->frame_space_list = space;
- space->start = start;
- space->length = end - start;
-}
-
-/* Allocate a stack slot of SIZE bytes and return a MEM rtx for it
- with machine mode MODE.
-
- ALIGN controls the amount of alignment for the address of the slot:
- 0 means according to MODE,
- -1 means use BIGGEST_ALIGNMENT and round size to multiple of that,
- -2 means use BITS_PER_UNIT,
- positive specifies alignment boundary in bits.
-
- KIND has ASLK_REDUCE_ALIGN bit set if it is OK to reduce
- alignment and ASLK_RECORD_PAD bit set if we should remember
- extra space we allocated for alignment purposes. When we are
- called from assign_stack_temp_for_type, it is not set so we don't
- track the same stack slot in two independent lists.
-
- We do not round to stack_boundary here. */
-
-rtx
-assign_stack_local_1 (machine_mode mode, poly_int64 size,
- int align, int kind)
-{
- rtx x, addr;
- poly_int64 bigend_correction = 0;
- poly_int64 slot_offset = 0, old_frame_offset;
- unsigned int alignment, alignment_in_bits;
-
- if (align == 0)
- {
- alignment = get_stack_local_alignment (NULL, mode);
- alignment /= BITS_PER_UNIT;
- }
- else if (align == -1)
- {
- alignment = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
- size = aligned_upper_bound (size, alignment);
- }
- else if (align == -2)
- alignment = 1; /* BITS_PER_UNIT / BITS_PER_UNIT */
- else
- alignment = align / BITS_PER_UNIT;
-
- alignment_in_bits = alignment * BITS_PER_UNIT;
-
- /* Ignore alignment if it exceeds MAX_SUPPORTED_STACK_ALIGNMENT. */
- if (alignment_in_bits > MAX_SUPPORTED_STACK_ALIGNMENT)
- {
- alignment_in_bits = MAX_SUPPORTED_STACK_ALIGNMENT;
- alignment = MAX_SUPPORTED_STACK_ALIGNMENT / BITS_PER_UNIT;
- }
-
- if (SUPPORTS_STACK_ALIGNMENT)
- {
- if (crtl->stack_alignment_estimated < alignment_in_bits)
- {
- if (!crtl->stack_realign_processed)
- crtl->stack_alignment_estimated = alignment_in_bits;
- else
- {
- /* If stack is realigned and stack alignment value
- hasn't been finalized, it is OK not to increase
- stack_alignment_estimated. The bigger alignment
- requirement is recorded in stack_alignment_needed
- below. */
- gcc_assert (!crtl->stack_realign_finalized);
- if (!crtl->stack_realign_needed)
- {
- /* It is OK to reduce the alignment as long as the
- requested size is 0 or the estimated stack
- alignment >= mode alignment. */
- gcc_assert ((kind & ASLK_REDUCE_ALIGN)
- || known_eq (size, 0)
- || (crtl->stack_alignment_estimated
- >= GET_MODE_ALIGNMENT (mode)));
- alignment_in_bits = crtl->stack_alignment_estimated;
- alignment = alignment_in_bits / BITS_PER_UNIT;
- }
- }
- }
- }
-
- if (crtl->stack_alignment_needed < alignment_in_bits)
- crtl->stack_alignment_needed = alignment_in_bits;
- if (crtl->max_used_stack_slot_alignment < alignment_in_bits)
- crtl->max_used_stack_slot_alignment = alignment_in_bits;
-
- if (mode != BLKmode || maybe_ne (size, 0))
- {
- if (kind & ASLK_RECORD_PAD)
- {
- class frame_space **psp;
-
- for (psp = &crtl->frame_space_list; *psp; psp = &(*psp)->next)
- {
- class frame_space *space = *psp;
- if (!try_fit_stack_local (space->start, space->length, size,
- alignment, &slot_offset))
- continue;
- *psp = space->next;
- if (known_gt (slot_offset, space->start))
- add_frame_space (space->start, slot_offset);
- if (known_lt (slot_offset + size, space->start + space->length))
- add_frame_space (slot_offset + size,
- space->start + space->length);
- goto found_space;
- }
- }
- }
- else if (!STACK_ALIGNMENT_NEEDED)
- {
- slot_offset = frame_offset;
- goto found_space;
- }
-
- old_frame_offset = frame_offset;
-
- if (FRAME_GROWS_DOWNWARD)
- {
- frame_offset -= size;
- try_fit_stack_local (frame_offset, size, size, alignment, &slot_offset);
-
- if (kind & ASLK_RECORD_PAD)
- {
- if (known_gt (slot_offset, frame_offset))
- add_frame_space (frame_offset, slot_offset);
- if (known_lt (slot_offset + size, old_frame_offset))
- add_frame_space (slot_offset + size, old_frame_offset);
- }
- }
- else
- {
- frame_offset += size;
- try_fit_stack_local (old_frame_offset, size, size, alignment, &slot_offset);
-
- if (kind & ASLK_RECORD_PAD)
- {
- if (known_gt (slot_offset, old_frame_offset))
- add_frame_space (old_frame_offset, slot_offset);
- if (known_lt (slot_offset + size, frame_offset))
- add_frame_space (slot_offset + size, frame_offset);
- }
- }
-
- found_space:
- /* On a big-endian machine, if we are allocating more space than we will use,
- use the least significant bytes of those that are allocated. */
- if (mode != BLKmode)
- {
- /* The slot size can sometimes be smaller than the mode size;
- e.g. the rs6000 port allocates slots with a vector mode
- that have the size of only one element. However, the slot
- size must always be ordered wrt to the mode size, in the
- same way as for a subreg. */
- gcc_checking_assert (ordered_p (GET_MODE_SIZE (mode), size));
- if (BYTES_BIG_ENDIAN && maybe_lt (GET_MODE_SIZE (mode), size))
- bigend_correction = size - GET_MODE_SIZE (mode);
- }
-
- /* If we have already instantiated virtual registers, return the actual
- address relative to the frame pointer. */
- if (virtuals_instantiated)
- addr = plus_constant (Pmode, frame_pointer_rtx,
- trunc_int_for_mode
- (slot_offset + bigend_correction
- + targetm.starting_frame_offset (), Pmode));
- else
- addr = plus_constant (Pmode, virtual_stack_vars_rtx,
- trunc_int_for_mode
- (slot_offset + bigend_correction,
- Pmode));
-
- x = gen_rtx_MEM (mode, addr);
- set_mem_align (x, alignment_in_bits);
- MEM_NOTRAP_P (x) = 1;
-
- vec_safe_push (stack_slot_list, x);
-
- if (frame_offset_overflow (frame_offset, current_function_decl))
- frame_offset = 0;
-
- return x;
-}
-
-/* Wrap up assign_stack_local_1 with last parameter as false. */
-
-rtx
-assign_stack_local (machine_mode mode, poly_int64 size, int align)
-{
- return assign_stack_local_1 (mode, size, align, ASLK_RECORD_PAD);
-}
-
-/* In order to evaluate some expressions, such as function calls returning
- structures in memory, we need to temporarily allocate stack locations.
- We record each allocated temporary in the following structure.
-
- Associated with each temporary slot is a nesting level. When we pop up
- one level, all temporaries associated with the previous level are freed.
- Normally, all temporaries are freed after the execution of the statement
- in which they were created. However, if we are inside a ({...}) grouping,
- the result may be in a temporary and hence must be preserved. If the
- result could be in a temporary, we preserve it if we can determine which
- one it is in. If we cannot determine which temporary may contain the
- result, all temporaries are preserved. A temporary is preserved by
- pretending it was allocated at the previous nesting level. */
-
-class GTY(()) temp_slot {
-public:
- /* Points to next temporary slot. */
- class temp_slot *next;
- /* Points to previous temporary slot. */
- class temp_slot *prev;
- /* The rtx to used to reference the slot. */
- rtx slot;
- /* The size, in units, of the slot. */
- poly_int64 size;
- /* The type of the object in the slot, or zero if it doesn't correspond
- to a type. We use this to determine whether a slot can be reused.
- It can be reused if objects of the type of the new slot will always
- conflict with objects of the type of the old slot. */
- tree type;
- /* The alignment (in bits) of the slot. */
- unsigned int align;
- /* Nonzero if this temporary is currently in use. */
- char in_use;
- /* Nesting level at which this slot is being used. */
- int level;
- /* The offset of the slot from the frame_pointer, including extra space
- for alignment. This info is for combine_temp_slots. */
- poly_int64 base_offset;
- /* The size of the slot, including extra space for alignment. This
- info is for combine_temp_slots. */
- poly_int64 full_size;
-};
-
-/* Entry for the below hash table. */
-struct GTY((for_user)) temp_slot_address_entry {
- hashval_t hash;
- rtx address;
- class temp_slot *temp_slot;
-};
-
-struct temp_address_hasher : ggc_ptr_hash<temp_slot_address_entry>
-{
- static hashval_t hash (temp_slot_address_entry *);
- static bool equal (temp_slot_address_entry *, temp_slot_address_entry *);
-};
-
-/* A table of addresses that represent a stack slot. The table is a mapping
- from address RTXen to a temp slot. */
-static GTY(()) hash_table<temp_address_hasher> *temp_slot_address_table;
-static size_t n_temp_slots_in_use;
-
-/* Removes temporary slot TEMP from LIST. */
-
-static void
-cut_slot_from_list (class temp_slot *temp, class temp_slot **list)
-{
- if (temp->next)
- temp->next->prev = temp->prev;
- if (temp->prev)
- temp->prev->next = temp->next;
- else
- *list = temp->next;
-
- temp->prev = temp->next = NULL;
-}
-
-/* Inserts temporary slot TEMP to LIST. */
-
-static void
-insert_slot_to_list (class temp_slot *temp, class temp_slot **list)
-{
- temp->next = *list;
- if (*list)
- (*list)->prev = temp;
- temp->prev = NULL;
- *list = temp;
-}
-
-/* Returns the list of used temp slots at LEVEL. */
-
-static class temp_slot **
-temp_slots_at_level (int level)
-{
- if (level >= (int) vec_safe_length (used_temp_slots))
- vec_safe_grow_cleared (used_temp_slots, level + 1, true);
-
- return &(*used_temp_slots)[level];
-}
-
-/* Returns the maximal temporary slot level. */
-
-static int
-max_slot_level (void)
-{
- if (!used_temp_slots)
- return -1;
-
- return used_temp_slots->length () - 1;
-}
-
-/* Moves temporary slot TEMP to LEVEL. */
-
-static void
-move_slot_to_level (class temp_slot *temp, int level)
-{
- cut_slot_from_list (temp, temp_slots_at_level (temp->level));
- insert_slot_to_list (temp, temp_slots_at_level (level));
- temp->level = level;
-}
-
-/* Make temporary slot TEMP available. */
-
-static void
-make_slot_available (class temp_slot *temp)
-{
- cut_slot_from_list (temp, temp_slots_at_level (temp->level));
- insert_slot_to_list (temp, &avail_temp_slots);
- temp->in_use = 0;
- temp->level = -1;
- n_temp_slots_in_use--;
-}
-
-/* Compute the hash value for an address -> temp slot mapping.
- The value is cached on the mapping entry. */
-static hashval_t
-temp_slot_address_compute_hash (struct temp_slot_address_entry *t)
-{
- int do_not_record = 0;
- return hash_rtx (t->address, GET_MODE (t->address),
- &do_not_record, NULL, false);
-}
-
-/* Return the hash value for an address -> temp slot mapping. */
-hashval_t
-temp_address_hasher::hash (temp_slot_address_entry *t)
-{
- return t->hash;
-}
-
-/* Compare two address -> temp slot mapping entries. */
-bool
-temp_address_hasher::equal (temp_slot_address_entry *t1,
- temp_slot_address_entry *t2)
-{
- return exp_equiv_p (t1->address, t2->address, 0, true);
-}
-
-/* Add ADDRESS as an alias of TEMP_SLOT to the addess -> temp slot mapping. */
-static void
-insert_temp_slot_address (rtx address, class temp_slot *temp_slot)
-{
- struct temp_slot_address_entry *t = ggc_alloc<temp_slot_address_entry> ();
- t->address = copy_rtx (address);
- t->temp_slot = temp_slot;
- t->hash = temp_slot_address_compute_hash (t);
- *temp_slot_address_table->find_slot_with_hash (t, t->hash, INSERT) = t;
-}
-
-/* Remove an address -> temp slot mapping entry if the temp slot is
- not in use anymore. Callback for remove_unused_temp_slot_addresses. */
-int
-remove_unused_temp_slot_addresses_1 (temp_slot_address_entry **slot, void *)
-{
- const struct temp_slot_address_entry *t = *slot;
- if (! t->temp_slot->in_use)
- temp_slot_address_table->clear_slot (slot);
- return 1;
-}
-
-/* Remove all mappings of addresses to unused temp slots. */
-static void
-remove_unused_temp_slot_addresses (void)
-{
- /* Use quicker clearing if there aren't any active temp slots. */
- if (n_temp_slots_in_use)
- temp_slot_address_table->traverse
- <void *, remove_unused_temp_slot_addresses_1> (NULL);
- else
- temp_slot_address_table->empty ();
-}
-
-/* Find the temp slot corresponding to the object at address X. */
-
-static class temp_slot *
-find_temp_slot_from_address (rtx x)
-{
- class temp_slot *p;
- struct temp_slot_address_entry tmp, *t;
-
- /* First try the easy way:
- See if X exists in the address -> temp slot mapping. */
- tmp.address = x;
- tmp.temp_slot = NULL;
- tmp.hash = temp_slot_address_compute_hash (&tmp);
- t = temp_slot_address_table->find_with_hash (&tmp, tmp.hash);
- if (t)
- return t->temp_slot;
-
- /* If we have a sum involving a register, see if it points to a temp
- slot. */
- if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 0))
- && (p = find_temp_slot_from_address (XEXP (x, 0))) != 0)
- return p;
- else if (GET_CODE (x) == PLUS && REG_P (XEXP (x, 1))
- && (p = find_temp_slot_from_address (XEXP (x, 1))) != 0)
- return p;
-
- /* Last resort: Address is a virtual stack var address. */
- poly_int64 offset;
- if (strip_offset (x, &offset) == virtual_stack_vars_rtx)
- {
- int i;
- for (i = max_slot_level (); i >= 0; i--)
- for (p = *temp_slots_at_level (i); p; p = p->next)
- if (known_in_range_p (offset, p->base_offset, p->full_size))
- return p;
- }
-
- return NULL;
-}
-
-/* Allocate a temporary stack slot and record it for possible later
- reuse.
-
- MODE is the machine mode to be given to the returned rtx.
-
- SIZE is the size in units of the space required. We do no rounding here
- since assign_stack_local will do any required rounding.
-
- TYPE is the type that will be used for the stack slot. */
-
-rtx
-assign_stack_temp_for_type (machine_mode mode, poly_int64 size, tree type)
-{
- unsigned int align;
- class temp_slot *p, *best_p = 0, *selected = NULL, **pp;
- rtx slot;
-
- gcc_assert (known_size_p (size));
-
- align = get_stack_local_alignment (type, mode);
-
- /* Try to find an available, already-allocated temporary of the proper
- mode which meets the size and alignment requirements. Choose the
- smallest one with the closest alignment.
-
- If assign_stack_temp is called outside of the tree->rtl expansion,
- we cannot reuse the stack slots (that may still refer to
- VIRTUAL_STACK_VARS_REGNUM). */
- if (!virtuals_instantiated)
- {
- for (p = avail_temp_slots; p; p = p->next)
- {
- if (p->align >= align
- && known_ge (p->size, size)
- && GET_MODE (p->slot) == mode
- && objects_must_conflict_p (p->type, type)
- && (best_p == 0
- || (known_eq (best_p->size, p->size)
- ? best_p->align > p->align
- : known_ge (best_p->size, p->size))))
- {
- if (p->align == align && known_eq (p->size, size))
- {
- selected = p;
- cut_slot_from_list (selected, &avail_temp_slots);
- best_p = 0;
- break;
- }
- best_p = p;
- }
- }
- }
-
- /* Make our best, if any, the one to use. */
- if (best_p)
- {
- selected = best_p;
- cut_slot_from_list (selected, &avail_temp_slots);
-
- /* If there are enough aligned bytes left over, make them into a new
- temp_slot so that the extra bytes don't get wasted. Do this only
- for BLKmode slots, so that we can be sure of the alignment. */
- if (GET_MODE (best_p->slot) == BLKmode)
- {
- int alignment = best_p->align / BITS_PER_UNIT;
- poly_int64 rounded_size = aligned_upper_bound (size, alignment);
-
- if (known_ge (best_p->size - rounded_size, alignment))
- {
- p = ggc_alloc<temp_slot> ();
- p->in_use = 0;
- p->size = best_p->size - rounded_size;
- p->base_offset = best_p->base_offset + rounded_size;
- p->full_size = best_p->full_size - rounded_size;
- p->slot = adjust_address_nv (best_p->slot, BLKmode, rounded_size);
- p->align = best_p->align;
- p->type = best_p->type;
- insert_slot_to_list (p, &avail_temp_slots);
-
- vec_safe_push (stack_slot_list, p->slot);
-
- best_p->size = rounded_size;
- best_p->full_size = rounded_size;
- }
- }
- }
-
- /* If we still didn't find one, make a new temporary. */
- if (selected == 0)
- {
- poly_int64 frame_offset_old = frame_offset;
-
- p = ggc_alloc<temp_slot> ();
-
- /* We are passing an explicit alignment request to assign_stack_local.
- One side effect of that is assign_stack_local will not round SIZE
- to ensure the frame offset remains suitably aligned.
-
- So for requests which depended on the rounding of SIZE, we go ahead
- and round it now. We also make sure ALIGNMENT is at least
- BIGGEST_ALIGNMENT. */
- gcc_assert (mode != BLKmode || align == BIGGEST_ALIGNMENT);
- p->slot = assign_stack_local_1 (mode,
- (mode == BLKmode
- ? aligned_upper_bound (size,
- (int) align
- / BITS_PER_UNIT)
- : size),
- align, 0);
-
- p->align = align;
-
- /* The following slot size computation is necessary because we don't
- know the actual size of the temporary slot until assign_stack_local
- has performed all the frame alignment and size rounding for the
- requested temporary. Note that extra space added for alignment
- can be either above or below this stack slot depending on which
- way the frame grows. We include the extra space if and only if it
- is above this slot. */
- if (FRAME_GROWS_DOWNWARD)
- p->size = frame_offset_old - frame_offset;
- else
- p->size = size;
-
- /* Now define the fields used by combine_temp_slots. */
- if (FRAME_GROWS_DOWNWARD)
- {
- p->base_offset = frame_offset;
- p->full_size = frame_offset_old - frame_offset;
- }
- else
- {
- p->base_offset = frame_offset_old;
- p->full_size = frame_offset - frame_offset_old;
- }
-
- selected = p;
- }
-
- p = selected;
- p->in_use = 1;
- p->type = type;
- p->level = temp_slot_level;
- n_temp_slots_in_use++;
-
- pp = temp_slots_at_level (p->level);
- insert_slot_to_list (p, pp);
- insert_temp_slot_address (XEXP (p->slot, 0), p);
-
- /* Create a new MEM rtx to avoid clobbering MEM flags of old slots. */
- slot = gen_rtx_MEM (mode, XEXP (p->slot, 0));
- vec_safe_push (stack_slot_list, slot);
-
- /* If we know the alias set for the memory that will be used, use
- it. If there's no TYPE, then we don't know anything about the
- alias set for the memory. */
- set_mem_alias_set (slot, type ? get_alias_set (type) : 0);
- set_mem_align (slot, align);
-
- /* If a type is specified, set the relevant flags. */
- if (type != 0)
- MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
- MEM_NOTRAP_P (slot) = 1;
-
- return slot;
-}
-
-/* Allocate a temporary stack slot and record it for possible later
- reuse. First two arguments are same as in preceding function. */
-
-rtx
-assign_stack_temp (machine_mode mode, poly_int64 size)
-{
- return assign_stack_temp_for_type (mode, size, NULL_TREE);
-}
-
-/* Assign a temporary.
- If TYPE_OR_DECL is a decl, then we are doing it on behalf of the decl
- and so that should be used in error messages. In either case, we
- allocate of the given type.
- MEMORY_REQUIRED is 1 if the result must be addressable stack memory;
- it is 0 if a register is OK.
- DONT_PROMOTE is 1 if we should not promote values in register
- to wider modes. */
-
-rtx
-assign_temp (tree type_or_decl, int memory_required,
- int dont_promote ATTRIBUTE_UNUSED)
-{
- tree type, decl;
- machine_mode mode;
-#ifdef PROMOTE_MODE
- int unsignedp;
-#endif
-
- if (DECL_P (type_or_decl))
- decl = type_or_decl, type = TREE_TYPE (decl);
- else
- decl = NULL, type = type_or_decl;
-
- mode = TYPE_MODE (type);
-#ifdef PROMOTE_MODE
- unsignedp = TYPE_UNSIGNED (type);
-#endif
-
- /* Allocating temporaries of TREE_ADDRESSABLE type must be done in the front
- end. See also create_tmp_var for the gimplification-time check. */
- gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
-
- if (mode == BLKmode || memory_required)
- {
- poly_int64 size;
- rtx tmp;
-
- /* Unfortunately, we don't yet know how to allocate variable-sized
- temporaries. However, sometimes we can find a fixed upper limit on
- the size, so try that instead. */
- if (!poly_int_tree_p (TYPE_SIZE_UNIT (type), &size))
- size = max_int_size_in_bytes (type);
-
- /* Zero sized arrays are a GNU C extension. Set size to 1 to avoid
- problems with allocating the stack space. */
- if (known_eq (size, 0))
- size = 1;
-
- /* The size of the temporary may be too large to fit into an integer. */
- /* ??? Not sure this should happen except for user silliness, so limit
- this to things that aren't compiler-generated temporaries. The
- rest of the time we'll die in assign_stack_temp_for_type. */
- if (decl
- && !known_size_p (size)
- && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
- {
- error ("size of variable %q+D is too large", decl);
- size = 1;
- }
-
- tmp = assign_stack_temp_for_type (mode, size, type);
- return tmp;
- }
-
-#ifdef PROMOTE_MODE
- if (! dont_promote)
- mode = promote_mode (type, mode, &unsignedp);
-#endif
-
- return gen_reg_rtx (mode);
-}
-
-/* Combine temporary stack slots which are adjacent on the stack.
-
- This allows for better use of already allocated stack space. This is only
- done for BLKmode slots because we can be sure that we won't have alignment
- problems in this case. */
-
-static void
-combine_temp_slots (void)
-{
- class temp_slot *p, *q, *next, *next_q;
- int num_slots;
-
- /* We can't combine slots, because the information about which slot
- is in which alias set will be lost. */
- if (flag_strict_aliasing)
- return;
-
- /* If there are a lot of temp slots, don't do anything unless
- high levels of optimization. */
- if (! flag_expensive_optimizations)
- for (p = avail_temp_slots, num_slots = 0; p; p = p->next, num_slots++)
- if (num_slots > 100 || (num_slots > 10 && optimize == 0))
- return;
-
- for (p = avail_temp_slots; p; p = next)
- {
- int delete_p = 0;
-
- next = p->next;
-
- if (GET_MODE (p->slot) != BLKmode)
- continue;
-
- for (q = p->next; q; q = next_q)
- {
- int delete_q = 0;
-
- next_q = q->next;
-
- if (GET_MODE (q->slot) != BLKmode)
- continue;
-
- if (known_eq (p->base_offset + p->full_size, q->base_offset))
- {
- /* Q comes after P; combine Q into P. */
- p->size += q->size;
- p->full_size += q->full_size;
- delete_q = 1;
- }
- else if (known_eq (q->base_offset + q->full_size, p->base_offset))
- {
- /* P comes after Q; combine P into Q. */
- q->size += p->size;
- q->full_size += p->full_size;
- delete_p = 1;
- break;
- }
- if (delete_q)
- cut_slot_from_list (q, &avail_temp_slots);
- }
-
- /* Either delete P or advance past it. */
- if (delete_p)
- cut_slot_from_list (p, &avail_temp_slots);
- }
-}
-
-/* Indicate that NEW_RTX is an alternate way of referring to the temp
- slot that previously was known by OLD_RTX. */
-
-void
-update_temp_slot_address (rtx old_rtx, rtx new_rtx)
-{
- class temp_slot *p;
-
- if (rtx_equal_p (old_rtx, new_rtx))
- return;
-
- p = find_temp_slot_from_address (old_rtx);
-
- /* If we didn't find one, see if both OLD_RTX is a PLUS. If so, and
- NEW_RTX is a register, see if one operand of the PLUS is a
- temporary location. If so, NEW_RTX points into it. Otherwise,
- if both OLD_RTX and NEW_RTX are a PLUS and if there is a register
- in common between them. If so, try a recursive call on those
- values. */
- if (p == 0)
- {
- if (GET_CODE (old_rtx) != PLUS)
- return;
-
- if (REG_P (new_rtx))
- {
- update_temp_slot_address (XEXP (old_rtx, 0), new_rtx);
- update_temp_slot_address (XEXP (old_rtx, 1), new_rtx);
- return;
- }
- else if (GET_CODE (new_rtx) != PLUS)
- return;
-
- if (rtx_equal_p (XEXP (old_rtx, 0), XEXP (new_rtx, 0)))
- update_temp_slot_address (XEXP (old_rtx, 1), XEXP (new_rtx, 1));
- else if (rtx_equal_p (XEXP (old_rtx, 1), XEXP (new_rtx, 0)))
- update_temp_slot_address (XEXP (old_rtx, 0), XEXP (new_rtx, 1));
- else if (rtx_equal_p (XEXP (old_rtx, 0), XEXP (new_rtx, 1)))
- update_temp_slot_address (XEXP (old_rtx, 1), XEXP (new_rtx, 0));
- else if (rtx_equal_p (XEXP (old_rtx, 1), XEXP (new_rtx, 1)))
- update_temp_slot_address (XEXP (old_rtx, 0), XEXP (new_rtx, 0));
-
- return;
- }
-
- /* Otherwise add an alias for the temp's address. */
- insert_temp_slot_address (new_rtx, p);
-}
-
-/* If X could be a reference to a temporary slot, mark that slot as
- belonging to the to one level higher than the current level. If X
- matched one of our slots, just mark that one. Otherwise, we can't
- easily predict which it is, so upgrade all of them.
-
- This is called when an ({...}) construct occurs and a statement
- returns a value in memory. */
-
-void
-preserve_temp_slots (rtx x)
-{
- class temp_slot *p = 0, *next;
-
- if (x == 0)
- return;
-
- /* If X is a register that is being used as a pointer, see if we have
- a temporary slot we know it points to. */
- if (REG_P (x) && REG_POINTER (x))
- p = find_temp_slot_from_address (x);
-
- /* If X is not in memory or is at a constant address, it cannot be in
- a temporary slot. */
- if (p == 0 && (!MEM_P (x) || CONSTANT_P (XEXP (x, 0))))
- return;
-
- /* First see if we can find a match. */
- if (p == 0)
- p = find_temp_slot_from_address (XEXP (x, 0));
-
- if (p != 0)
- {
- if (p->level == temp_slot_level)
- move_slot_to_level (p, temp_slot_level - 1);
- return;
- }
-
- /* Otherwise, preserve all non-kept slots at this level. */
- for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
- {
- next = p->next;
- move_slot_to_level (p, temp_slot_level - 1);
- }
-}
-
-/* Free all temporaries used so far. This is normally called at the
- end of generating code for a statement. */
-
-void
-free_temp_slots (void)
-{
- class temp_slot *p, *next;
- bool some_available = false;
-
- for (p = *temp_slots_at_level (temp_slot_level); p; p = next)
- {
- next = p->next;
- make_slot_available (p);
- some_available = true;
- }
-
- if (some_available)
- {
- remove_unused_temp_slot_addresses ();
- combine_temp_slots ();
- }
-}
-
-/* Push deeper into the nesting level for stack temporaries. */
-
-void
-push_temp_slots (void)
-{
- temp_slot_level++;
-}
-
-/* Pop a temporary nesting level. All slots in use in the current level
- are freed. */
-
-void
-pop_temp_slots (void)
-{
- free_temp_slots ();
- temp_slot_level--;
-}
-
-/* Initialize temporary slots. */
-
-void
-init_temp_slots (void)
-{
- /* We have not allocated any temporaries yet. */
- avail_temp_slots = 0;
- vec_alloc (used_temp_slots, 0);
- temp_slot_level = 0;
- n_temp_slots_in_use = 0;
-
- /* Set up the table to map addresses to temp slots. */
- if (! temp_slot_address_table)
- temp_slot_address_table = hash_table<temp_address_hasher>::create_ggc (32);
- else
- temp_slot_address_table->empty ();
-}
-
-/* Functions and data structures to keep track of the values hard regs
- had at the start of the function. */
-
-/* Private type used by get_hard_reg_initial_reg, get_hard_reg_initial_val,
- and has_hard_reg_initial_val.. */
-struct GTY(()) initial_value_pair {
- rtx hard_reg;
- rtx pseudo;
-};
-/* ??? This could be a VEC but there is currently no way to define an
- opaque VEC type. This could be worked around by defining struct
- initial_value_pair in function.h. */
-struct GTY(()) initial_value_struct {
- int num_entries;
- int max_entries;
- initial_value_pair * GTY ((length ("%h.num_entries"))) entries;
-};
-
-/* If a pseudo represents an initial hard reg (or expression), return
- it, else return NULL_RTX. */
-
-rtx
-get_hard_reg_initial_reg (rtx reg)
-{
- struct initial_value_struct *ivs = crtl->hard_reg_initial_vals;
- int i;
-
- if (ivs == 0)
- return NULL_RTX;
-
- for (i = 0; i < ivs->num_entries; i++)
- if (rtx_equal_p (ivs->entries[i].pseudo, reg))
- return ivs->entries[i].hard_reg;
-
- return NULL_RTX;
-}
-
-/* Make sure that there's a pseudo register of mode MODE that stores the
- initial value of hard register REGNO. Return an rtx for such a pseudo. */
-
-rtx
-get_hard_reg_initial_val (machine_mode mode, unsigned int regno)
-{
- struct initial_value_struct *ivs;
- rtx rv;
-
- rv = has_hard_reg_initial_val (mode, regno);
- if (rv)
- return rv;
-
- ivs = crtl->hard_reg_initial_vals;
- if (ivs == 0)
- {
- ivs = ggc_alloc<initial_value_struct> ();
- ivs->num_entries = 0;
- ivs->max_entries = 5;
- ivs->entries = ggc_vec_alloc<initial_value_pair> (5);
- crtl->hard_reg_initial_vals = ivs;
- }
-
- if (ivs->num_entries >= ivs->max_entries)
- {
- ivs->max_entries += 5;
- ivs->entries = GGC_RESIZEVEC (initial_value_pair, ivs->entries,
- ivs->max_entries);
- }
-
- ivs->entries[ivs->num_entries].hard_reg = gen_rtx_REG (mode, regno);
- ivs->entries[ivs->num_entries].pseudo = gen_reg_rtx (mode);
-
- return ivs->entries[ivs->num_entries++].pseudo;
-}
-
-/* See if get_hard_reg_initial_val has been used to create a pseudo
- for the initial value of hard register REGNO in mode MODE. Return
- the associated pseudo if so, otherwise return NULL. */
-
-rtx
-has_hard_reg_initial_val (machine_mode mode, unsigned int regno)
-{
- struct initial_value_struct *ivs;
- int i;
-
- ivs = crtl->hard_reg_initial_vals;
- if (ivs != 0)
- for (i = 0; i < ivs->num_entries; i++)
- if (GET_MODE (ivs->entries[i].hard_reg) == mode
- && REGNO (ivs->entries[i].hard_reg) == regno)
- return ivs->entries[i].pseudo;
-
- return NULL_RTX;
-}
-
-unsigned int
-emit_initial_value_sets (void)
-{
- struct initial_value_struct *ivs = crtl->hard_reg_initial_vals;
- int i;
- rtx_insn *seq;
-
- if (ivs == 0)
- return 0;
-
- start_sequence ();
- for (i = 0; i < ivs->num_entries; i++)
- emit_move_insn (ivs->entries[i].pseudo, ivs->entries[i].hard_reg);
- seq = get_insns ();
- end_sequence ();
-
- emit_insn_at_entry (seq);
- return 0;
-}
-
-/* Return the hardreg-pseudoreg initial values pair entry I and
- TRUE if I is a valid entry, or FALSE if I is not a valid entry. */
-bool
-initial_value_entry (int i, rtx *hreg, rtx *preg)
-{
- struct initial_value_struct *ivs = crtl->hard_reg_initial_vals;
- if (!ivs || i >= ivs->num_entries)
- return false;
-
- *hreg = ivs->entries[i].hard_reg;
- *preg = ivs->entries[i].pseudo;
- return true;
-}
-
-/* These routines are responsible for converting virtual register references
- to the actual hard register references once RTL generation is complete.
-
- The following four variables are used for communication between the
- routines. They contain the offsets of the virtual registers from their
- respective hard registers. */
-
-static poly_int64 in_arg_offset;
-static poly_int64 var_offset;
-static poly_int64 dynamic_offset;
-static poly_int64 out_arg_offset;
-static poly_int64 cfa_offset;
-
-/* In most machines, the stack pointer register is equivalent to the bottom
- of the stack. */
-
-#ifndef STACK_POINTER_OFFSET
-#define STACK_POINTER_OFFSET 0
-#endif
-
-#if defined (REG_PARM_STACK_SPACE) && !defined (INCOMING_REG_PARM_STACK_SPACE)
-#define INCOMING_REG_PARM_STACK_SPACE REG_PARM_STACK_SPACE
-#endif
-
-/* If not defined, pick an appropriate default for the offset of dynamically
- allocated memory depending on the value of ACCUMULATE_OUTGOING_ARGS,
- INCOMING_REG_PARM_STACK_SPACE, and OUTGOING_REG_PARM_STACK_SPACE. */
-
-#ifndef STACK_DYNAMIC_OFFSET
-
-/* The bottom of the stack points to the actual arguments. If
- REG_PARM_STACK_SPACE is defined, this includes the space for the register
- parameters. However, if OUTGOING_REG_PARM_STACK space is not defined,
- stack space for register parameters is not pushed by the caller, but
- rather part of the fixed stack areas and hence not included in
- `crtl->outgoing_args_size'. Nevertheless, we must allow
- for it when allocating stack dynamic objects. */
-
-#ifdef INCOMING_REG_PARM_STACK_SPACE
-#define STACK_DYNAMIC_OFFSET(FNDECL) \
-((ACCUMULATE_OUTGOING_ARGS \
- ? (crtl->outgoing_args_size \
- + (OUTGOING_REG_PARM_STACK_SPACE ((!(FNDECL) ? NULL_TREE : TREE_TYPE (FNDECL))) ? 0 \
- : INCOMING_REG_PARM_STACK_SPACE (FNDECL))) \
- : 0) + (STACK_POINTER_OFFSET))
-#else
-#define STACK_DYNAMIC_OFFSET(FNDECL) \
- ((ACCUMULATE_OUTGOING_ARGS ? crtl->outgoing_args_size : poly_int64 (0)) \
- + (STACK_POINTER_OFFSET))
-#endif
-#endif
-
-
-/* Given a piece of RTX and a pointer to a HOST_WIDE_INT, if the RTX
- is a virtual register, return the equivalent hard register and set the
- offset indirectly through the pointer. Otherwise, return 0. */
-
-static rtx
-instantiate_new_reg (rtx x, poly_int64_pod *poffset)
-{
- rtx new_rtx;
- poly_int64 offset;
-
- if (x == virtual_incoming_args_rtx)
- {
- if (stack_realign_drap)
- {
- /* Replace virtual_incoming_args_rtx with internal arg
- pointer if DRAP is used to realign stack. */
- new_rtx = crtl->args.internal_arg_pointer;
- offset = 0;
- }
- else
- new_rtx = arg_pointer_rtx, offset = in_arg_offset;
- }
- else if (x == virtual_stack_vars_rtx)
- new_rtx = frame_pointer_rtx, offset = var_offset;
- else if (x == virtual_stack_dynamic_rtx)
- new_rtx = stack_pointer_rtx, offset = dynamic_offset;
- else if (x == virtual_outgoing_args_rtx)
- new_rtx = stack_pointer_rtx, offset = out_arg_offset;
- else if (x == virtual_cfa_rtx)
- {
-#ifdef FRAME_POINTER_CFA_OFFSET
- new_rtx = frame_pointer_rtx;
-#else
- new_rtx = arg_pointer_rtx;
-#endif
- offset = cfa_offset;
- }
- else if (x == virtual_preferred_stack_boundary_rtx)
- {
- new_rtx = GEN_INT (crtl->preferred_stack_boundary / BITS_PER_UNIT);
- offset = 0;
- }
- else
- return NULL_RTX;
-
- *poffset = offset;
- return new_rtx;
-}
-
-/* A subroutine of instantiate_virtual_regs. Instantiate any virtual
- registers present inside of *LOC. The expression is simplified,
- as much as possible, but is not to be considered "valid" in any sense
- implied by the target. Return true if any change is made. */
-
-static bool
-instantiate_virtual_regs_in_rtx (rtx *loc)
-{
- if (!*loc)
- return false;
- bool changed = false;
- subrtx_ptr_iterator::array_type array;
- FOR_EACH_SUBRTX_PTR (iter, array, loc, NONCONST)
- {
- rtx *loc = *iter;
- if (rtx x = *loc)
- {
- rtx new_rtx;
- poly_int64 offset;
- switch (GET_CODE (x))
- {
- case REG:
- new_rtx = instantiate_new_reg (x, &offset);
- if (new_rtx)
- {
- *loc = plus_constant (GET_MODE (x), new_rtx, offset);
- changed = true;
- }
- iter.skip_subrtxes ();
- break;
-
- case PLUS:
- new_rtx = instantiate_new_reg (XEXP (x, 0), &offset);
- if (new_rtx)
- {
- XEXP (x, 0) = new_rtx;
- *loc = plus_constant (GET_MODE (x), x, offset, true);
- changed = true;
- iter.skip_subrtxes ();
- break;
- }
-
- /* FIXME -- from old code */
- /* If we have (plus (subreg (virtual-reg)) (const_int)), we know
- we can commute the PLUS and SUBREG because pointers into the
- frame are well-behaved. */
- break;
-
- default:
- break;
- }
- }
- }
- return changed;
-}
-
-/* A subroutine of instantiate_virtual_regs_in_insn. Return true if X
- matches the predicate for insn CODE operand OPERAND. */
-
-static int
-safe_insn_predicate (int code, int operand, rtx x)
-{
- return code < 0 || insn_operand_matches ((enum insn_code) code, operand, x);
-}
-
-/* A subroutine of instantiate_virtual_regs. Instantiate any virtual
- registers present inside of insn. The result will be a valid insn. */
-
-static void
-instantiate_virtual_regs_in_insn (rtx_insn *insn)
-{
- poly_int64 offset;
- int insn_code, i;
- bool any_change = false;
- rtx set, new_rtx, x;
- rtx_insn *seq;
-
- /* There are some special cases to be handled first. */
- set = single_set (insn);
- if (set)
- {
- /* We're allowed to assign to a virtual register. This is interpreted
- to mean that the underlying register gets assigned the inverse
- transformation. This is used, for example, in the handling of
- non-local gotos. */
- new_rtx = instantiate_new_reg (SET_DEST (set), &offset);
- if (new_rtx)
- {
- start_sequence ();
-
- instantiate_virtual_regs_in_rtx (&SET_SRC (set));
- x = simplify_gen_binary (PLUS, GET_MODE (new_rtx), SET_SRC (set),
- gen_int_mode (-offset, GET_MODE (new_rtx)));
- x = force_operand (x, new_rtx);
- if (x != new_rtx)
- emit_move_insn (new_rtx, x);
-
- seq = get_insns ();
- end_sequence ();
-
- emit_insn_before (seq, insn);
- delete_insn (insn);
- return;
- }
-
- /* Handle a straight copy from a virtual register by generating a
- new add insn. The difference between this and falling through
- to the generic case is avoiding a new pseudo and eliminating a
- move insn in the initial rtl stream. */
- new_rtx = instantiate_new_reg (SET_SRC (set), &offset);
- if (new_rtx
- && maybe_ne (offset, 0)
- && REG_P (SET_DEST (set))
- && REGNO (SET_DEST (set)) > LAST_VIRTUAL_REGISTER)
- {
- start_sequence ();
-
- x = expand_simple_binop (GET_MODE (SET_DEST (set)), PLUS, new_rtx,
- gen_int_mode (offset,
- GET_MODE (SET_DEST (set))),
- SET_DEST (set), 1, OPTAB_LIB_WIDEN);
- if (x != SET_DEST (set))
- emit_move_insn (SET_DEST (set), x);
-
- seq = get_insns ();
- end_sequence ();
-
- emit_insn_before (seq, insn);
- delete_insn (insn);
- return;
- }
-
- extract_insn (insn);
- insn_code = INSN_CODE (insn);
-
- /* Handle a plus involving a virtual register by determining if the
- operands remain valid if they're modified in place. */
- poly_int64 delta;
- if (GET_CODE (SET_SRC (set)) == PLUS
- && recog_data.n_operands >= 3
- && recog_data.operand_loc[1] == &XEXP (SET_SRC (set), 0)
- && recog_data.operand_loc[2] == &XEXP (SET_SRC (set), 1)
- && poly_int_rtx_p (recog_data.operand[2], &delta)
- && (new_rtx = instantiate_new_reg (recog_data.operand[1], &offset)))
- {
- offset += delta;
-
- /* If the sum is zero, then replace with a plain move. */
- if (known_eq (offset, 0)
- && REG_P (SET_DEST (set))
- && REGNO (SET_DEST (set)) > LAST_VIRTUAL_REGISTER)
- {
- start_sequence ();
- emit_move_insn (SET_DEST (set), new_rtx);
- seq = get_insns ();
- end_sequence ();
-
- emit_insn_before (seq, insn);
- delete_insn (insn);
- return;
- }
-
- x = gen_int_mode (offset, recog_data.operand_mode[2]);
-
- /* Using validate_change and apply_change_group here leaves
- recog_data in an invalid state. Since we know exactly what
- we want to check, do those two by hand. */
- if (safe_insn_predicate (insn_code, 1, new_rtx)
- && safe_insn_predicate (insn_code, 2, x))
- {
- *recog_data.operand_loc[1] = recog_data.operand[1] = new_rtx;
- *recog_data.operand_loc[2] = recog_data.operand[2] = x;
- any_change = true;
-
- /* Fall through into the regular operand fixup loop in
- order to take care of operands other than 1 and 2. */
- }
- }
- }
- else
- {
- extract_insn (insn);
- insn_code = INSN_CODE (insn);
- }
-
- /* In the general case, we expect virtual registers to appear only in
- operands, and then only as either bare registers or inside memories. */
- for (i = 0; i < recog_data.n_operands; ++i)
- {
- x = recog_data.operand[i];
- switch (GET_CODE (x))
- {
- case MEM:
- {
- rtx addr = XEXP (x, 0);
-
- if (!instantiate_virtual_regs_in_rtx (&addr))
- continue;
-
- start_sequence ();
- x = replace_equiv_address (x, addr, true);
- /* It may happen that the address with the virtual reg
- was valid (e.g. based on the virtual stack reg, which might
- be acceptable to the predicates with all offsets), whereas
- the address now isn't anymore, for instance when the address
- is still offsetted, but the base reg isn't virtual-stack-reg
- anymore. Below we would do a force_reg on the whole operand,
- but this insn might actually only accept memory. Hence,
- before doing that last resort, try to reload the address into
- a register, so this operand stays a MEM. */
- if (!safe_insn_predicate (insn_code, i, x))
- {
- addr = force_reg (GET_MODE (addr), addr);
- x = replace_equiv_address (x, addr, true);
- }
- seq = get_insns ();
- end_sequence ();
- if (seq)
- emit_insn_before (seq, insn);
- }
- break;
-
- case REG:
- new_rtx = instantiate_new_reg (x, &offset);
- if (new_rtx == NULL)
- continue;
- if (known_eq (offset, 0))
- x = new_rtx;
- else
- {
- start_sequence ();
-
- /* Careful, special mode predicates may have stuff in
- insn_data[insn_code].operand[i].mode that isn't useful
- to us for computing a new value. */
- /* ??? Recognize address_operand and/or "p" constraints
- to see if (plus new offset) is a valid before we put
- this through expand_simple_binop. */
- x = expand_simple_binop (GET_MODE (x), PLUS, new_rtx,
- gen_int_mode (offset, GET_MODE (x)),
- NULL_RTX, 1, OPTAB_LIB_WIDEN);
- seq = get_insns ();
- end_sequence ();
- emit_insn_before (seq, insn);
- }
- break;
-
- case SUBREG:
- new_rtx = instantiate_new_reg (SUBREG_REG (x), &offset);
- if (new_rtx == NULL)
- continue;
- if (maybe_ne (offset, 0))
- {
- start_sequence ();
- new_rtx = expand_simple_binop
- (GET_MODE (new_rtx), PLUS, new_rtx,
- gen_int_mode (offset, GET_MODE (new_rtx)),
- NULL_RTX, 1, OPTAB_LIB_WIDEN);
- seq = get_insns ();
- end_sequence ();
- emit_insn_before (seq, insn);
- }
- x = simplify_gen_subreg (recog_data.operand_mode[i], new_rtx,
- GET_MODE (new_rtx), SUBREG_BYTE (x));
- gcc_assert (x);
- break;
-
- default:
- continue;
- }
-
- /* At this point, X contains the new value for the operand.
- Validate the new value vs the insn predicate. Note that
- asm insns will have insn_code -1 here. */
- if (!safe_insn_predicate (insn_code, i, x))
- {
- start_sequence ();
- if (REG_P (x))
- {
- gcc_assert (REGNO (x) <= LAST_VIRTUAL_REGISTER);
- x = copy_to_reg (x);
- }
- else
- x = force_reg (insn_data[insn_code].operand[i].mode, x);
- seq = get_insns ();
- end_sequence ();
- if (seq)
- emit_insn_before (seq, insn);
- }
-
- *recog_data.operand_loc[i] = recog_data.operand[i] = x;
- any_change = true;
- }
-
- if (any_change)
- {
- /* Propagate operand changes into the duplicates. */
- for (i = 0; i < recog_data.n_dups; ++i)
- *recog_data.dup_loc[i]
- = copy_rtx (recog_data.operand[(unsigned)recog_data.dup_num[i]]);
-
- /* Force re-recognition of the instruction for validation. */
- INSN_CODE (insn) = -1;
- }
-
- if (asm_noperands (PATTERN (insn)) >= 0)
- {
- if (!check_asm_operands (PATTERN (insn)))
- {
- error_for_asm (insn, "impossible constraint in %<asm%>");
- /* For asm goto, instead of fixing up all the edges
- just clear the template and clear input and output operands
- and strip away clobbers. */
- if (JUMP_P (insn))
- {
- rtx asm_op = extract_asm_operands (PATTERN (insn));
- PATTERN (insn) = asm_op;
- PUT_MODE (asm_op, VOIDmode);
- ASM_OPERANDS_TEMPLATE (asm_op) = ggc_strdup ("");
- ASM_OPERANDS_OUTPUT_CONSTRAINT (asm_op) = "";
- ASM_OPERANDS_OUTPUT_IDX (asm_op) = 0;
- ASM_OPERANDS_INPUT_VEC (asm_op) = rtvec_alloc (0);
- ASM_OPERANDS_INPUT_CONSTRAINT_VEC (asm_op) = rtvec_alloc (0);
- }
- else
- delete_insn (insn);
- }
- }
- else
- {
- if (recog_memoized (insn) < 0)
- fatal_insn_not_found (insn);
- }
-}
-
-/* Subroutine of instantiate_decls. Given RTL representing a decl,
- do any instantiation required. */
-
-void
-instantiate_decl_rtl (rtx x)
-{
- rtx addr;
-
- if (x == 0)
- return;
-
- /* If this is a CONCAT, recurse for the pieces. */
- if (GET_CODE (x) == CONCAT)
- {
- instantiate_decl_rtl (XEXP (x, 0));
- instantiate_decl_rtl (XEXP (x, 1));
- return;
- }
-
- /* If this is not a MEM, no need to do anything. Similarly if the
- address is a constant or a register that is not a virtual register. */
- if (!MEM_P (x))
- return;
-
- addr = XEXP (x, 0);
- if (CONSTANT_P (addr)
- || (REG_P (addr)
- && (REGNO (addr) < FIRST_VIRTUAL_REGISTER
- || REGNO (addr) > LAST_VIRTUAL_REGISTER)))
- return;
-
- instantiate_virtual_regs_in_rtx (&XEXP (x, 0));
-}
-
-/* Helper for instantiate_decls called via walk_tree: Process all decls
- in the given DECL_VALUE_EXPR. */
-
-static tree
-instantiate_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
-{
- tree t = *tp;
- if (! EXPR_P (t))
- {
- *walk_subtrees = 0;
- if (DECL_P (t))
- {
- if (DECL_RTL_SET_P (t))
- instantiate_decl_rtl (DECL_RTL (t));
- if (TREE_CODE (t) == PARM_DECL && DECL_NAMELESS (t)
- && DECL_INCOMING_RTL (t))
- instantiate_decl_rtl (DECL_INCOMING_RTL (t));
- if ((VAR_P (t) || TREE_CODE (t) == RESULT_DECL)
- && DECL_HAS_VALUE_EXPR_P (t))
- {
- tree v = DECL_VALUE_EXPR (t);
- walk_tree (&v, instantiate_expr, NULL, NULL);
- }
- }
- }
- return NULL;
-}
-
-/* Subroutine of instantiate_decls: Process all decls in the given
- BLOCK node and all its subblocks. */
-
-static void
-instantiate_decls_1 (tree let)
-{
- tree t;
-
- for (t = BLOCK_VARS (let); t; t = DECL_CHAIN (t))
- {
- if (DECL_RTL_SET_P (t))
- instantiate_decl_rtl (DECL_RTL (t));
- if (VAR_P (t) && DECL_HAS_VALUE_EXPR_P (t))
- {
- tree v = DECL_VALUE_EXPR (t);
- walk_tree (&v, instantiate_expr, NULL, NULL);
- }
- }
-
- /* Process all subblocks. */
- for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t))
- instantiate_decls_1 (t);
-}
-
-/* Scan all decls in FNDECL (both variables and parameters) and instantiate
- all virtual registers in their DECL_RTL's. */
-
-static void
-instantiate_decls (tree fndecl)
-{
- tree decl;
- unsigned ix;
-
- /* Process all parameters of the function. */
- for (decl = DECL_ARGUMENTS (fndecl); decl; decl = DECL_CHAIN (decl))
- {
- instantiate_decl_rtl (DECL_RTL (decl));
- instantiate_decl_rtl (DECL_INCOMING_RTL (decl));
- if (DECL_HAS_VALUE_EXPR_P (decl))
- {
- tree v = DECL_VALUE_EXPR (decl);
- walk_tree (&v, instantiate_expr, NULL, NULL);
- }
- }
-
- if ((decl = DECL_RESULT (fndecl))
- && TREE_CODE (decl) == RESULT_DECL)
- {
- if (DECL_RTL_SET_P (decl))
- instantiate_decl_rtl (DECL_RTL (decl));
- if (DECL_HAS_VALUE_EXPR_P (decl))
- {
- tree v = DECL_VALUE_EXPR (decl);
- walk_tree (&v, instantiate_expr, NULL, NULL);
- }
- }
-
- /* Process the saved static chain if it exists. */
- decl = DECL_STRUCT_FUNCTION (fndecl)->static_chain_decl;
- if (decl && DECL_HAS_VALUE_EXPR_P (decl))
- instantiate_decl_rtl (DECL_RTL (DECL_VALUE_EXPR (decl)));
-
- /* Now process all variables defined in the function or its subblocks. */
- if (DECL_INITIAL (fndecl))
- instantiate_decls_1 (DECL_INITIAL (fndecl));
-
- FOR_EACH_LOCAL_DECL (cfun, ix, decl)
- if (DECL_RTL_SET_P (decl))
- instantiate_decl_rtl (DECL_RTL (decl));
- vec_free (cfun->local_decls);
-}
-
-/* Pass through the INSNS of function FNDECL and convert virtual register
- references to hard register references. */
-
-static unsigned int
-instantiate_virtual_regs (void)
-{
- rtx_insn *insn;
-
- /* Compute the offsets to use for this function. */
- in_arg_offset = FIRST_PARM_OFFSET (current_function_decl);
- var_offset = targetm.starting_frame_offset ();
- dynamic_offset = STACK_DYNAMIC_OFFSET (current_function_decl);
- out_arg_offset = STACK_POINTER_OFFSET;
-#ifdef FRAME_POINTER_CFA_OFFSET
- cfa_offset = FRAME_POINTER_CFA_OFFSET (current_function_decl);
-#else
- cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
-#endif
-
- /* Initialize recognition, indicating that volatile is OK. */
- init_recog ();
-
- /* Scan through all the insns, instantiating every virtual register still
- present. */
- for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
- if (INSN_P (insn))
- {
- /* These patterns in the instruction stream can never be recognized.
- Fortunately, they shouldn't contain virtual registers either. */
- if (GET_CODE (PATTERN (insn)) == USE
- || GET_CODE (PATTERN (insn)) == CLOBBER
- || GET_CODE (PATTERN (insn)) == ASM_INPUT
- || DEBUG_MARKER_INSN_P (insn))
- continue;
- else if (DEBUG_BIND_INSN_P (insn))
- instantiate_virtual_regs_in_rtx (INSN_VAR_LOCATION_PTR (insn));
- else
- instantiate_virtual_regs_in_insn (insn);
-
- if (insn->deleted ())
- continue;
-
- instantiate_virtual_regs_in_rtx (&REG_NOTES (insn));
-
- /* Instantiate any virtual registers in CALL_INSN_FUNCTION_USAGE. */
- if (CALL_P (insn))
- instantiate_virtual_regs_in_rtx (&CALL_INSN_FUNCTION_USAGE (insn));
- }
-
- /* Instantiate the virtual registers in the DECLs for debugging purposes. */
- instantiate_decls (current_function_decl);
-
- targetm.instantiate_decls ();
-
- /* Indicate that, from now on, assign_stack_local should use
- frame_pointer_rtx. */
- virtuals_instantiated = 1;
-
- return 0;
-}
-
-namespace {
-
-const pass_data pass_data_instantiate_virtual_regs =
-{
- RTL_PASS, /* type */
- "vregs", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_NONE, /* tv_id */
- 0, /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_instantiate_virtual_regs : public rtl_opt_pass
-{
-public:
- pass_instantiate_virtual_regs (gcc::context *ctxt)
- : rtl_opt_pass (pass_data_instantiate_virtual_regs, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual unsigned int execute (function *)
- {
- return instantiate_virtual_regs ();
- }
-
-}; // class pass_instantiate_virtual_regs
-
-} // anon namespace
-
-rtl_opt_pass *
-make_pass_instantiate_virtual_regs (gcc::context *ctxt)
-{
- return new pass_instantiate_virtual_regs (ctxt);
-}
-
-
-/* Return 1 if EXP is an aggregate type (or a value with aggregate type).
- This means a type for which function calls must pass an address to the
- function or get an address back from the function.
- EXP may be a type node or an expression (whose type is tested). */
-
-int
-aggregate_value_p (const_tree exp, const_tree fntype)
-{
- const_tree type = (TYPE_P (exp)) ? exp : TREE_TYPE (exp);
- int i, regno, nregs;
- rtx reg;
-
- if (fntype)
- switch (TREE_CODE (fntype))
- {
- case CALL_EXPR:
- {
- tree fndecl = get_callee_fndecl (fntype);
- if (fndecl)
- fntype = TREE_TYPE (fndecl);
- else if (CALL_EXPR_FN (fntype))
- fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (fntype)));
- else
- /* For internal functions, assume nothing needs to be
- returned in memory. */
- return 0;
- }
- break;
- case FUNCTION_DECL:
- fntype = TREE_TYPE (fntype);
- break;
- case FUNCTION_TYPE:
- case METHOD_TYPE:
- break;
- case IDENTIFIER_NODE:
- fntype = NULL_TREE;
- break;
- default:
- /* We don't expect other tree types here. */
- gcc_unreachable ();
- }
-
- if (VOID_TYPE_P (type))
- return 0;
-
- /* If a record should be passed the same as its first (and only) member
- don't pass it as an aggregate. */
- if (TREE_CODE (type) == RECORD_TYPE && TYPE_TRANSPARENT_AGGR (type))
- return aggregate_value_p (first_field (type), fntype);
-
- /* If the front end has decided that this needs to be passed by
- reference, do so. */
- if ((TREE_CODE (exp) == PARM_DECL || TREE_CODE (exp) == RESULT_DECL)
- && DECL_BY_REFERENCE (exp))
- return 1;
-
- /* Function types that are TREE_ADDRESSABLE force return in memory. */
- if (fntype && TREE_ADDRESSABLE (fntype))
- return 1;
-
- /* Types that are TREE_ADDRESSABLE must be constructed in memory,
- and thus can't be returned in registers. */
- if (TREE_ADDRESSABLE (type))
- return 1;
-
- if (TYPE_EMPTY_P (type))
- return 0;
-
- if (flag_pcc_struct_return && AGGREGATE_TYPE_P (type))
- return 1;
-
- if (targetm.calls.return_in_memory (type, fntype))
- return 1;
-
- /* Make sure we have suitable call-clobbered regs to return
- the value in; if not, we must return it in memory. */
- reg = hard_function_value (type, 0, fntype, 0);
-
- /* If we have something other than a REG (e.g. a PARALLEL), then assume
- it is OK. */
- if (!REG_P (reg))
- return 0;
-
- /* Use the default ABI if the type of the function isn't known.
- The scheme for handling interoperability between different ABIs
- requires us to be able to tell when we're calling a function with
- a nondefault ABI. */
- const predefined_function_abi &abi = (fntype
- ? fntype_abi (fntype)
- : default_function_abi);
- regno = REGNO (reg);
- nregs = hard_regno_nregs (regno, TYPE_MODE (type));
- for (i = 0; i < nregs; i++)
- if (!fixed_regs[regno + i] && !abi.clobbers_full_reg_p (regno + i))
- return 1;
-
- return 0;
-}
-
-/* Return true if we should assign DECL a pseudo register; false if it
- should live on the local stack. */
-
-bool
-use_register_for_decl (const_tree decl)
-{
- if (TREE_CODE (decl) == SSA_NAME)
- {
- /* We often try to use the SSA_NAME, instead of its underlying
- decl, to get type information and guide decisions, to avoid
- differences of behavior between anonymous and named
- variables, but in this one case we have to go for the actual
- variable if there is one. The main reason is that, at least
- at -O0, we want to place user variables on the stack, but we
- don't mind using pseudos for anonymous or ignored temps.
- Should we take the SSA_NAME, we'd conclude all SSA_NAMEs
- should go in pseudos, whereas their corresponding variables
- might have to go on the stack. So, disregarding the decl
- here would negatively impact debug info at -O0, enable
- coalescing between SSA_NAMEs that ought to get different
- stack/pseudo assignments, and get the incoming argument
- processing thoroughly confused by PARM_DECLs expected to live
- in stack slots but assigned to pseudos. */
- if (!SSA_NAME_VAR (decl))
- return TYPE_MODE (TREE_TYPE (decl)) != BLKmode
- && !(flag_float_store && FLOAT_TYPE_P (TREE_TYPE (decl)));
-
- decl = SSA_NAME_VAR (decl);
- }
-
- /* Honor volatile. */
- if (TREE_SIDE_EFFECTS (decl))
- return false;
-
- /* Honor addressability. */
- if (TREE_ADDRESSABLE (decl))
- return false;
-
- /* RESULT_DECLs are a bit special in that they're assigned without
- regard to use_register_for_decl, but we generally only store in
- them. If we coalesce their SSA NAMEs, we'd better return a
- result that matches the assignment in expand_function_start. */
- if (TREE_CODE (decl) == RESULT_DECL)
- {
- /* If it's not an aggregate, we're going to use a REG or a
- PARALLEL containing a REG. */
- if (!aggregate_value_p (decl, current_function_decl))
- return true;
-
- /* If expand_function_start determines the return value, we'll
- use MEM if it's not by reference. */
- if (cfun->returns_pcc_struct
- || (targetm.calls.struct_value_rtx
- (TREE_TYPE (current_function_decl), 1)))
- return DECL_BY_REFERENCE (decl);
-
- /* Otherwise, we're taking an extra all.function_result_decl
- argument. It's set up in assign_parms_augmented_arg_list,
- under the (negated) conditions above, and then it's used to
- set up the RESULT_DECL rtl in assign_params, after looping
- over all parameters. Now, if the RESULT_DECL is not by
- reference, we'll use a MEM either way. */
- if (!DECL_BY_REFERENCE (decl))
- return false;
-
- /* Otherwise, if RESULT_DECL is DECL_BY_REFERENCE, it will take
- the function_result_decl's assignment. Since it's a pointer,
- we can short-circuit a number of the tests below, and we must
- duplicate them because we don't have the function_result_decl
- to test. */
- if (!targetm.calls.allocate_stack_slots_for_args ())
- return true;
- /* We don't set DECL_IGNORED_P for the function_result_decl. */
- if (optimize)
- return true;
- if (cfun->tail_call_marked)
- return true;
- /* We don't set DECL_REGISTER for the function_result_decl. */
- return false;
- }
-
- /* Only register-like things go in registers. */
- if (DECL_MODE (decl) == BLKmode)
- return false;
-
- /* If -ffloat-store specified, don't put explicit float variables
- into registers. */
- /* ??? This should be checked after DECL_ARTIFICIAL, but tree-ssa
- propagates values across these stores, and it probably shouldn't. */
- if (flag_float_store && FLOAT_TYPE_P (TREE_TYPE (decl)))
- return false;
-
- if (!targetm.calls.allocate_stack_slots_for_args ())
- return true;
-
- /* If we're not interested in tracking debugging information for
- this decl, then we can certainly put it in a register. */
- if (DECL_IGNORED_P (decl))
- return true;
-
- if (optimize)
- return true;
-
- /* Thunks force a tail call even at -O0 so we need to avoid creating a
- dangling reference in case the parameter is passed by reference. */
- if (TREE_CODE (decl) == PARM_DECL && cfun->tail_call_marked)
- return true;
-
- if (!DECL_REGISTER (decl))
- return false;
-
- /* When not optimizing, disregard register keyword for types that
- could have methods, otherwise the methods won't be callable from
- the debugger. */
- if (RECORD_OR_UNION_TYPE_P (TREE_TYPE (decl)))
- return false;
-
- return true;
-}
-
-/* Structures to communicate between the subroutines of assign_parms.
- The first holds data persistent across all parameters, the second
- is cleared out for each parameter. */
-
-struct assign_parm_data_all
-{
- /* When INIT_CUMULATIVE_ARGS gets revamped, allocating CUMULATIVE_ARGS
- should become a job of the target or otherwise encapsulated. */
- CUMULATIVE_ARGS args_so_far_v;
- cumulative_args_t args_so_far;
- struct args_size stack_args_size;
- tree function_result_decl;
- tree orig_fnargs;
- rtx_insn *first_conversion_insn;
- rtx_insn *last_conversion_insn;
- HOST_WIDE_INT pretend_args_size;
- HOST_WIDE_INT extra_pretend_bytes;
- int reg_parm_stack_space;
-};
-
-struct assign_parm_data_one
-{
- tree nominal_type;
- function_arg_info arg;
- rtx entry_parm;
- rtx stack_parm;
- machine_mode nominal_mode;
- machine_mode passed_mode;
- struct locate_and_pad_arg_data locate;
- int partial;
-};
-
-/* A subroutine of assign_parms. Initialize ALL. */
-
-static void
-assign_parms_initialize_all (struct assign_parm_data_all *all)
-{
- tree fntype ATTRIBUTE_UNUSED;
-
- memset (all, 0, sizeof (*all));
-
- fntype = TREE_TYPE (current_function_decl);
-
-#ifdef INIT_CUMULATIVE_INCOMING_ARGS
- INIT_CUMULATIVE_INCOMING_ARGS (all->args_so_far_v, fntype, NULL_RTX);
-#else
- INIT_CUMULATIVE_ARGS (all->args_so_far_v, fntype, NULL_RTX,
- current_function_decl, -1);
-#endif
- all->args_so_far = pack_cumulative_args (&all->args_so_far_v);
-
-#ifdef INCOMING_REG_PARM_STACK_SPACE
- all->reg_parm_stack_space
- = INCOMING_REG_PARM_STACK_SPACE (current_function_decl);
-#endif
-}
-
-/* If ARGS contains entries with complex types, split the entry into two
- entries of the component type. Return a new list of substitutions are
- needed, else the old list. */
-
-static void
-split_complex_args (vec<tree> *args)
-{
- unsigned i;
- tree p;
-
- FOR_EACH_VEC_ELT (*args, i, p)
- {
- tree type = TREE_TYPE (p);
- if (TREE_CODE (type) == COMPLEX_TYPE
- && targetm.calls.split_complex_arg (type))
- {
- tree decl;
- tree subtype = TREE_TYPE (type);
- bool addressable = TREE_ADDRESSABLE (p);
-
- /* Rewrite the PARM_DECL's type with its component. */
- p = copy_node (p);
- TREE_TYPE (p) = subtype;
- DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
- SET_DECL_MODE (p, VOIDmode);
- DECL_SIZE (p) = NULL;
- DECL_SIZE_UNIT (p) = NULL;
- /* If this arg must go in memory, put it in a pseudo here.
- We can't allow it to go in memory as per normal parms,
- because the usual place might not have the imag part
- adjacent to the real part. */
- DECL_ARTIFICIAL (p) = addressable;
- DECL_IGNORED_P (p) = addressable;
- TREE_ADDRESSABLE (p) = 0;
- layout_decl (p, 0);
- (*args)[i] = p;
-
- /* Build a second synthetic decl. */
- decl = build_decl (EXPR_LOCATION (p),
- PARM_DECL, NULL_TREE, subtype);
- DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
- DECL_ARTIFICIAL (decl) = addressable;
- DECL_IGNORED_P (decl) = addressable;
- layout_decl (decl, 0);
- args->safe_insert (++i, decl);
- }
- }
-}
-
-/* A subroutine of assign_parms. Adjust the parameter list to incorporate
- the hidden struct return argument, and (abi willing) complex args.
- Return the new parameter list. */
-
-static vec<tree>
-assign_parms_augmented_arg_list (struct assign_parm_data_all *all)
-{
- tree fndecl = current_function_decl;
- tree fntype = TREE_TYPE (fndecl);
- vec<tree> fnargs = vNULL;
- tree arg;
-
- for (arg = DECL_ARGUMENTS (fndecl); arg; arg = DECL_CHAIN (arg))
- fnargs.safe_push (arg);
-
- all->orig_fnargs = DECL_ARGUMENTS (fndecl);
-
- /* If struct value address is treated as the first argument, make it so. */
- if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
- && ! cfun->returns_pcc_struct
- && targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
- {
- tree type = build_pointer_type (TREE_TYPE (fntype));
- tree decl;
-
- decl = build_decl (DECL_SOURCE_LOCATION (fndecl),
- PARM_DECL, get_identifier (".result_ptr"), type);
- DECL_ARG_TYPE (decl) = type;
- DECL_ARTIFICIAL (decl) = 1;
- DECL_NAMELESS (decl) = 1;
- TREE_CONSTANT (decl) = 1;
- /* We don't set DECL_IGNORED_P or DECL_REGISTER here. If this
- changes, the end of the RESULT_DECL handling block in
- use_register_for_decl must be adjusted to match. */
-
- DECL_CHAIN (decl) = all->orig_fnargs;
- all->orig_fnargs = decl;
- fnargs.safe_insert (0, decl);
-
- all->function_result_decl = decl;
- }
-
- /* If the target wants to split complex arguments into scalars, do so. */
- if (targetm.calls.split_complex_arg)
- split_complex_args (&fnargs);
-
- return fnargs;
-}
-
-/* A subroutine of assign_parms. Examine PARM and pull out type and mode
- data for the parameter. Incorporate ABI specifics such as pass-by-
- reference and type promotion. */
-
-static void
-assign_parm_find_data_types (struct assign_parm_data_all *all, tree parm,
- struct assign_parm_data_one *data)
-{
- int unsignedp;
-
-#ifndef BROKEN_VALUE_INITIALIZATION
- *data = assign_parm_data_one ();
-#else
- /* Old versions of GCC used to miscompile the above by only initializing
- the members with explicit constructors and copying garbage
- to the other members. */
- assign_parm_data_one zero_data = {};
- *data = zero_data;
-#endif
-
- /* NAMED_ARG is a misnomer. We really mean 'non-variadic'. */
- if (!cfun->stdarg)
- data->arg.named = 1; /* No variadic parms. */
- else if (DECL_CHAIN (parm))
- data->arg.named = 1; /* Not the last non-variadic parm. */
- else if (targetm.calls.strict_argument_naming (all->args_so_far))
- data->arg.named = 1; /* Only variadic ones are unnamed. */
- else
- data->arg.named = 0; /* Treat as variadic. */
-
- data->nominal_type = TREE_TYPE (parm);
- data->arg.type = DECL_ARG_TYPE (parm);
-
- /* Look out for errors propagating this far. Also, if the parameter's
- type is void then its value doesn't matter. */
- if (TREE_TYPE (parm) == error_mark_node
- /* This can happen after weird syntax errors
- or if an enum type is defined among the parms. */
- || TREE_CODE (parm) != PARM_DECL
- || data->arg.type == NULL
- || VOID_TYPE_P (data->nominal_type))
- {
- data->nominal_type = data->arg.type = void_type_node;
- data->nominal_mode = data->passed_mode = data->arg.mode = VOIDmode;
- return;
- }
-
- /* Find mode of arg as it is passed, and mode of arg as it should be
- during execution of this function. */
- data->passed_mode = data->arg.mode = TYPE_MODE (data->arg.type);
- data->nominal_mode = TYPE_MODE (data->nominal_type);
-
- /* If the parm is to be passed as a transparent union or record, use the
- type of the first field for the tests below. We have already verified
- that the modes are the same. */
- if (RECORD_OR_UNION_TYPE_P (data->arg.type)
- && TYPE_TRANSPARENT_AGGR (data->arg.type))
- data->arg.type = TREE_TYPE (first_field (data->arg.type));
-
- /* See if this arg was passed by invisible reference. */
- if (apply_pass_by_reference_rules (&all->args_so_far_v, data->arg))
- {
- data->nominal_type = data->arg.type;
- data->passed_mode = data->nominal_mode = data->arg.mode;
- }
-
- /* Find mode as it is passed by the ABI. */
- unsignedp = TYPE_UNSIGNED (data->arg.type);
- data->arg.mode
- = promote_function_mode (data->arg.type, data->arg.mode, &unsignedp,
- TREE_TYPE (current_function_decl), 0);
-}
-
-/* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
-
-static void
-assign_parms_setup_varargs (struct assign_parm_data_all *all,
- struct assign_parm_data_one *data, bool no_rtl)
-{
- int varargs_pretend_bytes = 0;
-
- function_arg_info last_named_arg = data->arg;
- last_named_arg.named = true;
- targetm.calls.setup_incoming_varargs (all->args_so_far, last_named_arg,
- &varargs_pretend_bytes, no_rtl);
-
- /* If the back-end has requested extra stack space, record how much is
- needed. Do not change pretend_args_size otherwise since it may be
- nonzero from an earlier partial argument. */
- if (varargs_pretend_bytes > 0)
- all->pretend_args_size = varargs_pretend_bytes;
-}
-
-/* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
- the incoming location of the current parameter. */
-
-static void
-assign_parm_find_entry_rtl (struct assign_parm_data_all *all,
- struct assign_parm_data_one *data)
-{
- HOST_WIDE_INT pretend_bytes = 0;
- rtx entry_parm;
- bool in_regs;
-
- if (data->arg.mode == VOIDmode)
- {
- data->entry_parm = data->stack_parm = const0_rtx;
- return;
- }
-
- targetm.calls.warn_parameter_passing_abi (all->args_so_far,
- data->arg.type);
-
- entry_parm = targetm.calls.function_incoming_arg (all->args_so_far,
- data->arg);
- if (entry_parm == 0)
- data->arg.mode = data->passed_mode;
-
- /* Determine parm's home in the stack, in case it arrives in the stack
- or we should pretend it did. Compute the stack position and rtx where
- the argument arrives and its size.
-
- There is one complexity here: If this was a parameter that would
- have been passed in registers, but wasn't only because it is
- __builtin_va_alist, we want locate_and_pad_parm to treat it as if
- it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
- In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
- as it was the previous time. */
- in_regs = (entry_parm != 0);
-#ifdef STACK_PARMS_IN_REG_PARM_AREA
- in_regs = true;
-#endif
- if (!in_regs && !data->arg.named)
- {
- if (targetm.calls.pretend_outgoing_varargs_named (all->args_so_far))
- {
- rtx tem;
- function_arg_info named_arg = data->arg;
- named_arg.named = true;
- tem = targetm.calls.function_incoming_arg (all->args_so_far,
- named_arg);
- in_regs = tem != NULL;
- }
- }
-
- /* If this parameter was passed both in registers and in the stack, use
- the copy on the stack. */
- if (targetm.calls.must_pass_in_stack (data->arg))
- entry_parm = 0;
-
- if (entry_parm)
- {
- int partial;
-
- partial = targetm.calls.arg_partial_bytes (all->args_so_far, data->arg);
- data->partial = partial;
-
- /* The caller might already have allocated stack space for the
- register parameters. */
- if (partial != 0 && all->reg_parm_stack_space == 0)
- {
- /* Part of this argument is passed in registers and part
- is passed on the stack. Ask the prologue code to extend
- the stack part so that we can recreate the full value.
-
- PRETEND_BYTES is the size of the registers we need to store.
- CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
- stack space that the prologue should allocate.
-
- Internally, gcc assumes that the argument pointer is aligned
- to STACK_BOUNDARY bits. This is used both for alignment
- optimizations (see init_emit) and to locate arguments that are
- aligned to more than PARM_BOUNDARY bits. We must preserve this
- invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
- a stack boundary. */
-
- /* We assume at most one partial arg, and it must be the first
- argument on the stack. */
- gcc_assert (!all->extra_pretend_bytes && !all->pretend_args_size);
-
- pretend_bytes = partial;
- all->pretend_args_size = CEIL_ROUND (pretend_bytes, STACK_BYTES);
-
- /* We want to align relative to the actual stack pointer, so
- don't include this in the stack size until later. */
- all->extra_pretend_bytes = all->pretend_args_size;
- }
- }
-
- locate_and_pad_parm (data->arg.mode, data->arg.type, in_regs,
- all->reg_parm_stack_space,
- entry_parm ? data->partial : 0, current_function_decl,
- &all->stack_args_size, &data->locate);
-
- /* Update parm_stack_boundary if this parameter is passed in the
- stack. */
- if (!in_regs && crtl->parm_stack_boundary < data->locate.boundary)
- crtl->parm_stack_boundary = data->locate.boundary;
-
- /* Adjust offsets to include the pretend args. */
- pretend_bytes = all->extra_pretend_bytes - pretend_bytes;
- data->locate.slot_offset.constant += pretend_bytes;
- data->locate.offset.constant += pretend_bytes;
-
- data->entry_parm = entry_parm;
-}
-
-/* A subroutine of assign_parms. If there is actually space on the stack
- for this parm, count it in stack_args_size and return true. */
-
-static bool
-assign_parm_is_stack_parm (struct assign_parm_data_all *all,
- struct assign_parm_data_one *data)
-{
- /* Trivially true if we've no incoming register. */
- if (data->entry_parm == NULL)
- ;
- /* Also true if we're partially in registers and partially not,
- since we've arranged to drop the entire argument on the stack. */
- else if (data->partial != 0)
- ;
- /* Also true if the target says that it's passed in both registers
- and on the stack. */
- else if (GET_CODE (data->entry_parm) == PARALLEL
- && XEXP (XVECEXP (data->entry_parm, 0, 0), 0) == NULL_RTX)
- ;
- /* Also true if the target says that there's stack allocated for
- all register parameters. */
- else if (all->reg_parm_stack_space > 0)
- ;
- /* Otherwise, no, this parameter has no ABI defined stack slot. */
- else
- return false;
-
- all->stack_args_size.constant += data->locate.size.constant;
- if (data->locate.size.var)
- ADD_PARM_SIZE (all->stack_args_size, data->locate.size.var);
-
- return true;
-}
-
-/* A subroutine of assign_parms. Given that this parameter is allocated
- stack space by the ABI, find it. */
-
-static void
-assign_parm_find_stack_rtl (tree parm, struct assign_parm_data_one *data)
-{
- rtx offset_rtx, stack_parm;
- unsigned int align, boundary;
-
- /* If we're passing this arg using a reg, make its stack home the
- aligned stack slot. */
- if (data->entry_parm)
- offset_rtx = ARGS_SIZE_RTX (data->locate.slot_offset);
- else
- offset_rtx = ARGS_SIZE_RTX (data->locate.offset);
-
- stack_parm = crtl->args.internal_arg_pointer;
- if (offset_rtx != const0_rtx)
- stack_parm = gen_rtx_PLUS (Pmode, stack_parm, offset_rtx);
- stack_parm = gen_rtx_MEM (data->arg.mode, stack_parm);
-
- if (!data->arg.pass_by_reference)
- {
- set_mem_attributes (stack_parm, parm, 1);
- /* set_mem_attributes could set MEM_SIZE to the passed mode's size,
- while promoted mode's size is needed. */
- if (data->arg.mode != BLKmode
- && data->arg.mode != DECL_MODE (parm))
- {
- set_mem_size (stack_parm, GET_MODE_SIZE (data->arg.mode));
- if (MEM_EXPR (stack_parm) && MEM_OFFSET_KNOWN_P (stack_parm))
- {
- poly_int64 offset = subreg_lowpart_offset (DECL_MODE (parm),
- data->arg.mode);
- if (maybe_ne (offset, 0))
- set_mem_offset (stack_parm, MEM_OFFSET (stack_parm) - offset);
- }
- }
- }
-
- boundary = data->locate.boundary;
- align = BITS_PER_UNIT;
-
- /* If we're padding upward, we know that the alignment of the slot
- is TARGET_FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
- intentionally forcing upward padding. Otherwise we have to come
- up with a guess at the alignment based on OFFSET_RTX. */
- poly_int64 offset;
- if (data->locate.where_pad == PAD_NONE || data->entry_parm)
- align = boundary;
- else if (data->locate.where_pad == PAD_UPWARD)
- {
- align = boundary;
- /* If the argument offset is actually more aligned than the nominal
- stack slot boundary, take advantage of that excess alignment.
- Don't make any assumptions if STACK_POINTER_OFFSET is in use. */
- if (poly_int_rtx_p (offset_rtx, &offset)
- && known_eq (STACK_POINTER_OFFSET, 0))
- {
- unsigned int offset_align = known_alignment (offset) * BITS_PER_UNIT;
- if (offset_align == 0 || offset_align > STACK_BOUNDARY)
- offset_align = STACK_BOUNDARY;
- align = MAX (align, offset_align);
- }
- }
- else if (poly_int_rtx_p (offset_rtx, &offset))
- {
- align = least_bit_hwi (boundary);
- unsigned int offset_align = known_alignment (offset) * BITS_PER_UNIT;
- if (offset_align != 0)
- align = MIN (align, offset_align);
- }
- set_mem_align (stack_parm, align);
-
- if (data->entry_parm)
- set_reg_attrs_for_parm (data->entry_parm, stack_parm);
-
- data->stack_parm = stack_parm;
-}
-
-/* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
- always valid and contiguous. */
-
-static void
-assign_parm_adjust_entry_rtl (struct assign_parm_data_one *data)
-{
- rtx entry_parm = data->entry_parm;
- rtx stack_parm = data->stack_parm;
-
- /* If this parm was passed part in regs and part in memory, pretend it
- arrived entirely in memory by pushing the register-part onto the stack.
- In the special case of a DImode or DFmode that is split, we could put
- it together in a pseudoreg directly, but for now that's not worth
- bothering with. */
- if (data->partial != 0)
- {
- /* Handle calls that pass values in multiple non-contiguous
- locations. The Irix 6 ABI has examples of this. */
- if (GET_CODE (entry_parm) == PARALLEL)
- emit_group_store (validize_mem (copy_rtx (stack_parm)), entry_parm,
- data->arg.type, int_size_in_bytes (data->arg.type));
- else
- {
- gcc_assert (data->partial % UNITS_PER_WORD == 0);
- move_block_from_reg (REGNO (entry_parm),
- validize_mem (copy_rtx (stack_parm)),
- data->partial / UNITS_PER_WORD);
- }
-
- entry_parm = stack_parm;
- }
-
- /* If we didn't decide this parm came in a register, by default it came
- on the stack. */
- else if (entry_parm == NULL)
- entry_parm = stack_parm;
-
- /* When an argument is passed in multiple locations, we can't make use
- of this information, but we can save some copying if the whole argument
- is passed in a single register. */
- else if (GET_CODE (entry_parm) == PARALLEL
- && data->nominal_mode != BLKmode
- && data->passed_mode != BLKmode)
- {
- size_t i, len = XVECLEN (entry_parm, 0);
-
- for (i = 0; i < len; i++)
- if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
- && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
- && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
- == data->passed_mode)
- && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
- {
- entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
- break;
- }
- }
-
- data->entry_parm = entry_parm;
-}
-
-/* A subroutine of assign_parms. Reconstitute any values which were
- passed in multiple registers and would fit in a single register. */
-
-static void
-assign_parm_remove_parallels (struct assign_parm_data_one *data)
-{
- rtx entry_parm = data->entry_parm;
-
- /* Convert the PARALLEL to a REG of the same mode as the parallel.
- This can be done with register operations rather than on the
- stack, even if we will store the reconstituted parameter on the
- stack later. */
- if (GET_CODE (entry_parm) == PARALLEL && GET_MODE (entry_parm) != BLKmode)
- {
- rtx parmreg = gen_reg_rtx (GET_MODE (entry_parm));
- emit_group_store (parmreg, entry_parm, data->arg.type,
- GET_MODE_SIZE (GET_MODE (entry_parm)));
- entry_parm = parmreg;
- }
-
- data->entry_parm = entry_parm;
-}
-
-/* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
- always valid and properly aligned. */
-
-static void
-assign_parm_adjust_stack_rtl (struct assign_parm_data_one *data)
-{
- rtx stack_parm = data->stack_parm;
-
- /* If we can't trust the parm stack slot to be aligned enough for its
- ultimate type, don't use that slot after entry. We'll make another
- stack slot, if we need one. */
- if (stack_parm
- && ((GET_MODE_ALIGNMENT (data->nominal_mode) > MEM_ALIGN (stack_parm)
- && ((optab_handler (movmisalign_optab, data->nominal_mode)
- != CODE_FOR_nothing)
- || targetm.slow_unaligned_access (data->nominal_mode,
- MEM_ALIGN (stack_parm))))
- || (data->nominal_type
- && TYPE_ALIGN (data->nominal_type) > MEM_ALIGN (stack_parm)
- && MEM_ALIGN (stack_parm) < PREFERRED_STACK_BOUNDARY)))
- stack_parm = NULL;
-
- /* If parm was passed in memory, and we need to convert it on entry,
- don't store it back in that same slot. */
- else if (data->entry_parm == stack_parm
- && data->nominal_mode != BLKmode
- && data->nominal_mode != data->passed_mode)
- stack_parm = NULL;
-
- /* If stack protection is in effect for this function, don't leave any
- pointers in their passed stack slots. */
- else if (crtl->stack_protect_guard
- && (flag_stack_protect == SPCT_FLAG_ALL
- || data->arg.pass_by_reference
- || POINTER_TYPE_P (data->nominal_type)))
- stack_parm = NULL;
-
- data->stack_parm = stack_parm;
-}
-
-/* A subroutine of assign_parms. Return true if the current parameter
- should be stored as a BLKmode in the current frame. */
-
-static bool
-assign_parm_setup_block_p (struct assign_parm_data_one *data)
-{
- if (data->nominal_mode == BLKmode)
- return true;
- if (GET_MODE (data->entry_parm) == BLKmode)
- return true;
-
-#ifdef BLOCK_REG_PADDING
- /* Only assign_parm_setup_block knows how to deal with register arguments
- that are padded at the least significant end. */
- if (REG_P (data->entry_parm)
- && known_lt (GET_MODE_SIZE (data->arg.mode), UNITS_PER_WORD)
- && (BLOCK_REG_PADDING (data->passed_mode, data->arg.type, 1)
- == (BYTES_BIG_ENDIAN ? PAD_UPWARD : PAD_DOWNWARD)))
- return true;
-#endif
-
- return false;
-}
-
-/* A subroutine of assign_parms. Arrange for the parameter to be
- present and valid in DATA->STACK_RTL. */
-
-static void
-assign_parm_setup_block (struct assign_parm_data_all *all,
- tree parm, struct assign_parm_data_one *data)
-{
- rtx entry_parm = data->entry_parm;
- rtx stack_parm = data->stack_parm;
- rtx target_reg = NULL_RTX;
- bool in_conversion_seq = false;
- HOST_WIDE_INT size;
- HOST_WIDE_INT size_stored;
-
- if (GET_CODE (entry_parm) == PARALLEL)
- entry_parm = emit_group_move_into_temps (entry_parm);
-
- /* If we want the parameter in a pseudo, don't use a stack slot. */
- if (is_gimple_reg (parm) && use_register_for_decl (parm))
- {
- tree def = ssa_default_def (cfun, parm);
- gcc_assert (def);
- machine_mode mode = promote_ssa_mode (def, NULL);
- rtx reg = gen_reg_rtx (mode);
- if (GET_CODE (reg) != CONCAT)
- stack_parm = reg;
- else
- {
- target_reg = reg;
- /* Avoid allocating a stack slot, if there isn't one
- preallocated by the ABI. It might seem like we should
- always prefer a pseudo, but converting between
- floating-point and integer modes goes through the stack
- on various machines, so it's better to use the reserved
- stack slot than to risk wasting it and allocating more
- for the conversion. */
- if (stack_parm == NULL_RTX)
- {
- int save = generating_concat_p;
- generating_concat_p = 0;
- stack_parm = gen_reg_rtx (mode);
- generating_concat_p = save;
- }
- }
- data->stack_parm = NULL;
- }
-
- size = int_size_in_bytes (data->arg.type);
- size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
- if (stack_parm == 0)
- {
- HOST_WIDE_INT parm_align
- = (STRICT_ALIGNMENT
- ? MAX (DECL_ALIGN (parm), BITS_PER_WORD) : DECL_ALIGN (parm));
-
- SET_DECL_ALIGN (parm, parm_align);
- if (DECL_ALIGN (parm) > MAX_SUPPORTED_STACK_ALIGNMENT)
- {
- rtx allocsize = gen_int_mode (size_stored, Pmode);
- get_dynamic_stack_size (&allocsize, 0, DECL_ALIGN (parm), NULL);
- stack_parm = assign_stack_local (BLKmode, UINTVAL (allocsize),
- MAX_SUPPORTED_STACK_ALIGNMENT);
- rtx addr = align_dynamic_address (XEXP (stack_parm, 0),
- DECL_ALIGN (parm));
- mark_reg_pointer (addr, DECL_ALIGN (parm));
- stack_parm = gen_rtx_MEM (GET_MODE (stack_parm), addr);
- MEM_NOTRAP_P (stack_parm) = 1;
- }
- else
- stack_parm = assign_stack_local (BLKmode, size_stored,
- DECL_ALIGN (parm));
- if (known_eq (GET_MODE_SIZE (GET_MODE (entry_parm)), size))
- PUT_MODE (stack_parm, GET_MODE (entry_parm));
- set_mem_attributes (stack_parm, parm, 1);
- }
-
- /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
- calls that pass values in multiple non-contiguous locations. */
- if (REG_P (entry_parm) || GET_CODE (entry_parm) == PARALLEL)
- {
- rtx mem;
-
- /* Note that we will be storing an integral number of words.
- So we have to be careful to ensure that we allocate an
- integral number of words. We do this above when we call
- assign_stack_local if space was not allocated in the argument
- list. If it was, this will not work if PARM_BOUNDARY is not
- a multiple of BITS_PER_WORD. It isn't clear how to fix this
- if it becomes a problem. Exception is when BLKmode arrives
- with arguments not conforming to word_mode. */
-
- if (data->stack_parm == 0)
- ;
- else if (GET_CODE (entry_parm) == PARALLEL)
- ;
- else
- gcc_assert (!size || !(PARM_BOUNDARY % BITS_PER_WORD));
-
- mem = validize_mem (copy_rtx (stack_parm));
-
- /* Handle values in multiple non-contiguous locations. */
- if (GET_CODE (entry_parm) == PARALLEL && !MEM_P (mem))
- emit_group_store (mem, entry_parm, data->arg.type, size);
- else if (GET_CODE (entry_parm) == PARALLEL)
- {
- push_to_sequence2 (all->first_conversion_insn,
- all->last_conversion_insn);
- emit_group_store (mem, entry_parm, data->arg.type, size);
- all->first_conversion_insn = get_insns ();
- all->last_conversion_insn = get_last_insn ();
- end_sequence ();
- in_conversion_seq = true;
- }
-
- else if (size == 0)
- ;
-
- /* If SIZE is that of a mode no bigger than a word, just use
- that mode's store operation. */
- else if (size <= UNITS_PER_WORD)
- {
- unsigned int bits = size * BITS_PER_UNIT;
- machine_mode mode = int_mode_for_size (bits, 0).else_blk ();
-
- if (mode != BLKmode
-#ifdef BLOCK_REG_PADDING
- && (size == UNITS_PER_WORD
- || (BLOCK_REG_PADDING (mode, data->arg.type, 1)
- != (BYTES_BIG_ENDIAN ? PAD_UPWARD : PAD_DOWNWARD)))
-#endif
- )
- {
- rtx reg;
-
- /* We are really truncating a word_mode value containing
- SIZE bytes into a value of mode MODE. If such an
- operation requires no actual instructions, we can refer
- to the value directly in mode MODE, otherwise we must
- start with the register in word_mode and explicitly
- convert it. */
- if (mode == word_mode
- || TRULY_NOOP_TRUNCATION_MODES_P (mode, word_mode))
- reg = gen_rtx_REG (mode, REGNO (entry_parm));
- else
- {
- reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
- reg = convert_to_mode (mode, copy_to_reg (reg), 1);
- }
-
- /* We use adjust_address to get a new MEM with the mode
- changed. adjust_address is better than change_address
- for this purpose because adjust_address does not lose
- the MEM_EXPR associated with the MEM.
-
- If the MEM_EXPR is lost, then optimizations like DSE
- assume the MEM escapes and thus is not subject to DSE. */
- emit_move_insn (adjust_address (mem, mode, 0), reg);
- }
-
-#ifdef BLOCK_REG_PADDING
- /* Storing the register in memory as a full word, as
- move_block_from_reg below would do, and then using the
- MEM in a smaller mode, has the effect of shifting right
- if BYTES_BIG_ENDIAN. If we're bypassing memory, the
- shifting must be explicit. */
- else if (!MEM_P (mem))
- {
- rtx x;
-
- /* If the assert below fails, we should have taken the
- mode != BLKmode path above, unless we have downward
- padding of smaller-than-word arguments on a machine
- with little-endian bytes, which would likely require
- additional changes to work correctly. */
- gcc_checking_assert (BYTES_BIG_ENDIAN
- && (BLOCK_REG_PADDING (mode,
- data->arg.type, 1)
- == PAD_UPWARD));
-
- int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
-
- x = gen_rtx_REG (word_mode, REGNO (entry_parm));
- x = expand_shift (RSHIFT_EXPR, word_mode, x, by,
- NULL_RTX, 1);
- x = force_reg (word_mode, x);
- x = gen_lowpart_SUBREG (GET_MODE (mem), x);
-
- emit_move_insn (mem, x);
- }
-#endif
-
- /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
- machine must be aligned to the left before storing
- to memory. Note that the previous test doesn't
- handle all cases (e.g. SIZE == 3). */
- else if (size != UNITS_PER_WORD
-#ifdef BLOCK_REG_PADDING
- && (BLOCK_REG_PADDING (mode, data->arg.type, 1)
- == PAD_DOWNWARD)
-#else
- && BYTES_BIG_ENDIAN
-#endif
- )
- {
- rtx tem, x;
- int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
- rtx reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
-
- x = expand_shift (LSHIFT_EXPR, word_mode, reg, by, NULL_RTX, 1);
- tem = change_address (mem, word_mode, 0);
- emit_move_insn (tem, x);
- }
- else
- move_block_from_reg (REGNO (entry_parm), mem,
- size_stored / UNITS_PER_WORD);
- }
- else if (!MEM_P (mem))
- {
- gcc_checking_assert (size > UNITS_PER_WORD);
-#ifdef BLOCK_REG_PADDING
- gcc_checking_assert (BLOCK_REG_PADDING (GET_MODE (mem),
- data->arg.type, 0)
- == PAD_UPWARD);
-#endif
- emit_move_insn (mem, entry_parm);
- }
- else
- move_block_from_reg (REGNO (entry_parm), mem,
- size_stored / UNITS_PER_WORD);
- }
- else if (data->stack_parm == 0 && !TYPE_EMPTY_P (data->arg.type))
- {
- push_to_sequence2 (all->first_conversion_insn, all->last_conversion_insn);
- emit_block_move (stack_parm, data->entry_parm, GEN_INT (size),
- BLOCK_OP_NORMAL);
- all->first_conversion_insn = get_insns ();
- all->last_conversion_insn = get_last_insn ();
- end_sequence ();
- in_conversion_seq = true;
- }
-
- if (target_reg)
- {
- if (!in_conversion_seq)
- emit_move_insn (target_reg, stack_parm);
- else
- {
- push_to_sequence2 (all->first_conversion_insn,
- all->last_conversion_insn);
- emit_move_insn (target_reg, stack_parm);
- all->first_conversion_insn = get_insns ();
- all->last_conversion_insn = get_last_insn ();
- end_sequence ();
- }
- stack_parm = target_reg;
- }
-
- data->stack_parm = stack_parm;
- set_parm_rtl (parm, stack_parm);
-}
-
-/* A subroutine of assign_parms. Allocate a pseudo to hold the current
- parameter. Get it there. Perform all ABI specified conversions. */
-
-static void
-assign_parm_setup_reg (struct assign_parm_data_all *all, tree parm,
- struct assign_parm_data_one *data)
-{
- rtx parmreg, validated_mem;
- rtx equiv_stack_parm;
- machine_mode promoted_nominal_mode;
- int unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
- bool did_conversion = false;
- bool need_conversion, moved;
- enum insn_code icode;
- rtx rtl;
-
- /* Store the parm in a pseudoregister during the function, but we may
- need to do it in a wider mode. Using 2 here makes the result
- consistent with promote_decl_mode and thus expand_expr_real_1. */
- promoted_nominal_mode
- = promote_function_mode (data->nominal_type, data->nominal_mode, &unsignedp,
- TREE_TYPE (current_function_decl), 2);
-
- parmreg = gen_reg_rtx (promoted_nominal_mode);
- if (!DECL_ARTIFICIAL (parm))
- mark_user_reg (parmreg);
-
- /* If this was an item that we received a pointer to,
- set rtl appropriately. */
- if (data->arg.pass_by_reference)
- {
- rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data->arg.type)), parmreg);
- set_mem_attributes (rtl, parm, 1);
- }
- else
- rtl = parmreg;
-
- assign_parm_remove_parallels (data);
-
- /* Copy the value into the register, thus bridging between
- assign_parm_find_data_types and expand_expr_real_1. */
-
- equiv_stack_parm = data->stack_parm;
- validated_mem = validize_mem (copy_rtx (data->entry_parm));
-
- need_conversion = (data->nominal_mode != data->passed_mode
- || promoted_nominal_mode != data->arg.mode);
- moved = false;
-
- if (need_conversion
- && GET_MODE_CLASS (data->nominal_mode) == MODE_INT
- && data->nominal_mode == data->passed_mode
- && data->nominal_mode == GET_MODE (data->entry_parm))
- {
- /* ENTRY_PARM has been converted to PROMOTED_MODE, its
- mode, by the caller. We now have to convert it to
- NOMINAL_MODE, if different. However, PARMREG may be in
- a different mode than NOMINAL_MODE if it is being stored
- promoted.
-
- If ENTRY_PARM is a hard register, it might be in a register
- not valid for operating in its mode (e.g., an odd-numbered
- register for a DFmode). In that case, moves are the only
- thing valid, so we can't do a convert from there. This
- occurs when the calling sequence allow such misaligned
- usages.
-
- In addition, the conversion may involve a call, which could
- clobber parameters which haven't been copied to pseudo
- registers yet.
-
- First, we try to emit an insn which performs the necessary
- conversion. We verify that this insn does not clobber any
- hard registers. */
-
- rtx op0, op1;
-
- icode = can_extend_p (promoted_nominal_mode, data->passed_mode,
- unsignedp);
-
- op0 = parmreg;
- op1 = validated_mem;
- if (icode != CODE_FOR_nothing
- && insn_operand_matches (icode, 0, op0)
- && insn_operand_matches (icode, 1, op1))
- {
- enum rtx_code code = unsignedp ? ZERO_EXTEND : SIGN_EXTEND;
- rtx_insn *insn, *insns;
- rtx t = op1;
- HARD_REG_SET hardregs;
-
- start_sequence ();
- /* If op1 is a hard register that is likely spilled, first
- force it into a pseudo, otherwise combiner might extend
- its lifetime too much. */
- if (GET_CODE (t) == SUBREG)
- t = SUBREG_REG (t);
- if (REG_P (t)
- && HARD_REGISTER_P (t)
- && ! TEST_HARD_REG_BIT (fixed_reg_set, REGNO (t))
- && targetm.class_likely_spilled_p (REGNO_REG_CLASS (REGNO (t))))
- {
- t = gen_reg_rtx (GET_MODE (op1));
- emit_move_insn (t, op1);
- }
- else
- t = op1;
- rtx_insn *pat = gen_extend_insn (op0, t, promoted_nominal_mode,
- data->passed_mode, unsignedp);
- emit_insn (pat);
- insns = get_insns ();
-
- moved = true;
- CLEAR_HARD_REG_SET (hardregs);
- for (insn = insns; insn && moved; insn = NEXT_INSN (insn))
- {
- if (INSN_P (insn))
- note_stores (insn, record_hard_reg_sets, &hardregs);
- if (!hard_reg_set_empty_p (hardregs))
- moved = false;
- }
-
- end_sequence ();
-
- if (moved)
- {
- emit_insn (insns);
- if (equiv_stack_parm != NULL_RTX)
- equiv_stack_parm = gen_rtx_fmt_e (code, GET_MODE (parmreg),
- equiv_stack_parm);
- }
- }
- }
-
- if (moved)
- /* Nothing to do. */
- ;
- else if (need_conversion)
- {
- /* We did not have an insn to convert directly, or the sequence
- generated appeared unsafe. We must first copy the parm to a
- pseudo reg, and save the conversion until after all
- parameters have been moved. */
-
- int save_tree_used;
- rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
-
- emit_move_insn (tempreg, validated_mem);
-
- push_to_sequence2 (all->first_conversion_insn, all->last_conversion_insn);
- tempreg = convert_to_mode (data->nominal_mode, tempreg, unsignedp);
-
- if (partial_subreg_p (tempreg)
- && GET_MODE (tempreg) == data->nominal_mode
- && REG_P (SUBREG_REG (tempreg))
- && data->nominal_mode == data->passed_mode
- && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (data->entry_parm))
- {
- /* The argument is already sign/zero extended, so note it
- into the subreg. */
- SUBREG_PROMOTED_VAR_P (tempreg) = 1;
- SUBREG_PROMOTED_SET (tempreg, unsignedp);
- }
-
- /* TREE_USED gets set erroneously during expand_assignment. */
- save_tree_used = TREE_USED (parm);
- SET_DECL_RTL (parm, rtl);
- expand_assignment (parm, make_tree (data->nominal_type, tempreg), false);
- SET_DECL_RTL (parm, NULL_RTX);
- TREE_USED (parm) = save_tree_used;
- all->first_conversion_insn = get_insns ();
- all->last_conversion_insn = get_last_insn ();
- end_sequence ();
-
- did_conversion = true;
- }
- else if (MEM_P (data->entry_parm)
- && GET_MODE_ALIGNMENT (promoted_nominal_mode)
- > MEM_ALIGN (data->entry_parm)
- && (((icode = optab_handler (movmisalign_optab,
- promoted_nominal_mode))
- != CODE_FOR_nothing)
- || targetm.slow_unaligned_access (promoted_nominal_mode,
- MEM_ALIGN (data->entry_parm))))
- {
- if (icode != CODE_FOR_nothing)
- emit_insn (GEN_FCN (icode) (parmreg, validated_mem));
- else
- rtl = parmreg = extract_bit_field (validated_mem,
- GET_MODE_BITSIZE (promoted_nominal_mode), 0,
- unsignedp, parmreg,
- promoted_nominal_mode, VOIDmode, false, NULL);
- }
- else
- emit_move_insn (parmreg, validated_mem);
-
- /* If we were passed a pointer but the actual value can live in a register,
- retrieve it and use it directly. Note that we cannot use nominal_mode,
- because it will have been set to Pmode above, we must use the actual mode
- of the parameter instead. */
- if (data->arg.pass_by_reference && TYPE_MODE (TREE_TYPE (parm)) != BLKmode)
- {
- /* Use a stack slot for debugging purposes if possible. */
- if (use_register_for_decl (parm))
- {
- parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
- mark_user_reg (parmreg);
- }
- else
- {
- int align = STACK_SLOT_ALIGNMENT (TREE_TYPE (parm),
- TYPE_MODE (TREE_TYPE (parm)),
- TYPE_ALIGN (TREE_TYPE (parm)));
- parmreg
- = assign_stack_local (TYPE_MODE (TREE_TYPE (parm)),
- GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (parm))),
- align);
- set_mem_attributes (parmreg, parm, 1);
- }
-
- /* We need to preserve an address based on VIRTUAL_STACK_VARS_REGNUM for
- the debug info in case it is not legitimate. */
- if (GET_MODE (parmreg) != GET_MODE (rtl))
- {
- rtx tempreg = gen_reg_rtx (GET_MODE (rtl));
- int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
-
- push_to_sequence2 (all->first_conversion_insn,
- all->last_conversion_insn);
- emit_move_insn (tempreg, rtl);
- tempreg = convert_to_mode (GET_MODE (parmreg), tempreg, unsigned_p);
- emit_move_insn (MEM_P (parmreg) ? copy_rtx (parmreg) : parmreg,
- tempreg);
- all->first_conversion_insn = get_insns ();
- all->last_conversion_insn = get_last_insn ();
- end_sequence ();
-
- did_conversion = true;
- }
- else
- emit_move_insn (MEM_P (parmreg) ? copy_rtx (parmreg) : parmreg, rtl);
-
- rtl = parmreg;
-
- /* STACK_PARM is the pointer, not the parm, and PARMREG is
- now the parm. */
- data->stack_parm = NULL;
- }
-
- set_parm_rtl (parm, rtl);
-
- /* Mark the register as eliminable if we did no conversion and it was
- copied from memory at a fixed offset, and the arg pointer was not
- copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
- offset formed an invalid address, such memory-equivalences as we
- make here would screw up life analysis for it. */
- if (data->nominal_mode == data->passed_mode
- && !did_conversion
- && data->stack_parm != 0
- && MEM_P (data->stack_parm)
- && data->locate.offset.var == 0
- && reg_mentioned_p (virtual_incoming_args_rtx,
- XEXP (data->stack_parm, 0)))
- {
- rtx_insn *linsn = get_last_insn ();
- rtx_insn *sinsn;
- rtx set;
-
- /* Mark complex types separately. */
- if (GET_CODE (parmreg) == CONCAT)
- {
- scalar_mode submode = GET_MODE_INNER (GET_MODE (parmreg));
- int regnor = REGNO (XEXP (parmreg, 0));
- int regnoi = REGNO (XEXP (parmreg, 1));
- rtx stackr = adjust_address_nv (data->stack_parm, submode, 0);
- rtx stacki = adjust_address_nv (data->stack_parm, submode,
- GET_MODE_SIZE (submode));
-
- /* Scan backwards for the set of the real and
- imaginary parts. */
- for (sinsn = linsn; sinsn != 0;
- sinsn = prev_nonnote_insn (sinsn))
- {
- set = single_set (sinsn);
- if (set == 0)
- continue;
-
- if (SET_DEST (set) == regno_reg_rtx [regnoi])
- set_unique_reg_note (sinsn, REG_EQUIV, stacki);
- else if (SET_DEST (set) == regno_reg_rtx [regnor])
- set_unique_reg_note (sinsn, REG_EQUIV, stackr);
- }
- }
- else
- set_dst_reg_note (linsn, REG_EQUIV, equiv_stack_parm, parmreg);
- }
-
- /* For pointer data type, suggest pointer register. */
- if (POINTER_TYPE_P (TREE_TYPE (parm)))
- mark_reg_pointer (parmreg,
- TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
-}
-
-/* A subroutine of assign_parms. Allocate stack space to hold the current
- parameter. Get it there. Perform all ABI specified conversions. */
-
-static void
-assign_parm_setup_stack (struct assign_parm_data_all *all, tree parm,
- struct assign_parm_data_one *data)
-{
- /* Value must be stored in the stack slot STACK_PARM during function
- execution. */
- bool to_conversion = false;
-
- assign_parm_remove_parallels (data);
-
- if (data->arg.mode != data->nominal_mode)
- {
- /* Conversion is required. */
- rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
-
- emit_move_insn (tempreg, validize_mem (copy_rtx (data->entry_parm)));
-
- push_to_sequence2 (all->first_conversion_insn, all->last_conversion_insn);
- to_conversion = true;
-
- data->entry_parm = convert_to_mode (data->nominal_mode, tempreg,
- TYPE_UNSIGNED (TREE_TYPE (parm)));
-
- if (data->stack_parm)
- {
- poly_int64 offset
- = subreg_lowpart_offset (data->nominal_mode,
- GET_MODE (data->stack_parm));
- /* ??? This may need a big-endian conversion on sparc64. */
- data->stack_parm
- = adjust_address (data->stack_parm, data->nominal_mode, 0);
- if (maybe_ne (offset, 0) && MEM_OFFSET_KNOWN_P (data->stack_parm))
- set_mem_offset (data->stack_parm,
- MEM_OFFSET (data->stack_parm) + offset);
- }
- }
-
- if (data->entry_parm != data->stack_parm)
- {
- rtx src, dest;
-
- if (data->stack_parm == 0)
- {
- int align = STACK_SLOT_ALIGNMENT (data->arg.type,
- GET_MODE (data->entry_parm),
- TYPE_ALIGN (data->arg.type));
- if (align < (int)GET_MODE_ALIGNMENT (GET_MODE (data->entry_parm))
- && ((optab_handler (movmisalign_optab,
- GET_MODE (data->entry_parm))
- != CODE_FOR_nothing)
- || targetm.slow_unaligned_access (GET_MODE (data->entry_parm),
- align)))
- align = GET_MODE_ALIGNMENT (GET_MODE (data->entry_parm));
- data->stack_parm
- = assign_stack_local (GET_MODE (data->entry_parm),
- GET_MODE_SIZE (GET_MODE (data->entry_parm)),
- align);
- align = MEM_ALIGN (data->stack_parm);
- set_mem_attributes (data->stack_parm, parm, 1);
- set_mem_align (data->stack_parm, align);
- }
-
- dest = validize_mem (copy_rtx (data->stack_parm));
- src = validize_mem (copy_rtx (data->entry_parm));
-
- if (TYPE_EMPTY_P (data->arg.type))
- /* Empty types don't really need to be copied. */;
- else if (MEM_P (src))
- {
- /* Use a block move to handle potentially misaligned entry_parm. */
- if (!to_conversion)
- push_to_sequence2 (all->first_conversion_insn,
- all->last_conversion_insn);
- to_conversion = true;
-
- emit_block_move (dest, src,
- GEN_INT (int_size_in_bytes (data->arg.type)),
- BLOCK_OP_NORMAL);
- }
- else
- {
- if (!REG_P (src))
- src = force_reg (GET_MODE (src), src);
- emit_move_insn (dest, src);
- }
- }
-
- if (to_conversion)
- {
- all->first_conversion_insn = get_insns ();
- all->last_conversion_insn = get_last_insn ();
- end_sequence ();
- }
-
- set_parm_rtl (parm, data->stack_parm);
-}
-
-/* A subroutine of assign_parms. If the ABI splits complex arguments, then
- undo the frobbing that we did in assign_parms_augmented_arg_list. */
-
-static void
-assign_parms_unsplit_complex (struct assign_parm_data_all *all,
- vec<tree> fnargs)
-{
- tree parm;
- tree orig_fnargs = all->orig_fnargs;
- unsigned i = 0;
-
- for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm), ++i)
- {
- if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
- && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
- {
- rtx tmp, real, imag;
- scalar_mode inner = GET_MODE_INNER (DECL_MODE (parm));
-
- real = DECL_RTL (fnargs[i]);
- imag = DECL_RTL (fnargs[i + 1]);
- if (inner != GET_MODE (real))
- {
- real = gen_lowpart_SUBREG (inner, real);
- imag = gen_lowpart_SUBREG (inner, imag);
- }
-
- if (TREE_ADDRESSABLE (parm))
- {
- rtx rmem, imem;
- HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (parm));
- int align = STACK_SLOT_ALIGNMENT (TREE_TYPE (parm),
- DECL_MODE (parm),
- TYPE_ALIGN (TREE_TYPE (parm)));
-
- /* split_complex_arg put the real and imag parts in
- pseudos. Move them to memory. */
- tmp = assign_stack_local (DECL_MODE (parm), size, align);
- set_mem_attributes (tmp, parm, 1);
- rmem = adjust_address_nv (tmp, inner, 0);
- imem = adjust_address_nv (tmp, inner, GET_MODE_SIZE (inner));
- push_to_sequence2 (all->first_conversion_insn,
- all->last_conversion_insn);
- emit_move_insn (rmem, real);
- emit_move_insn (imem, imag);
- all->first_conversion_insn = get_insns ();
- all->last_conversion_insn = get_last_insn ();
- end_sequence ();
- }
- else
- tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
- set_parm_rtl (parm, tmp);
-
- real = DECL_INCOMING_RTL (fnargs[i]);
- imag = DECL_INCOMING_RTL (fnargs[i + 1]);
- if (inner != GET_MODE (real))
- {
- real = gen_lowpart_SUBREG (inner, real);
- imag = gen_lowpart_SUBREG (inner, imag);
- }
- tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
- set_decl_incoming_rtl (parm, tmp, false);
- i++;
- }
- }
-}
-
-/* Assign RTL expressions to the function's parameters. This may involve
- copying them into registers and using those registers as the DECL_RTL. */
-
-static void
-assign_parms (tree fndecl)
-{
- struct assign_parm_data_all all;
- tree parm;
- vec<tree> fnargs;
- unsigned i;
-
- crtl->args.internal_arg_pointer
- = targetm.calls.internal_arg_pointer ();
-
- assign_parms_initialize_all (&all);
- fnargs = assign_parms_augmented_arg_list (&all);
-
- FOR_EACH_VEC_ELT (fnargs, i, parm)
- {
- struct assign_parm_data_one data;
-
- /* Extract the type of PARM; adjust it according to ABI. */
- assign_parm_find_data_types (&all, parm, &data);
-
- /* Early out for errors and void parameters. */
- if (data.passed_mode == VOIDmode)
- {
- SET_DECL_RTL (parm, const0_rtx);
- DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
- continue;
- }
-
- /* Estimate stack alignment from parameter alignment. */
- if (SUPPORTS_STACK_ALIGNMENT)
- {
- unsigned int align
- = targetm.calls.function_arg_boundary (data.arg.mode,
- data.arg.type);
- align = MINIMUM_ALIGNMENT (data.arg.type, data.arg.mode, align);
- if (TYPE_ALIGN (data.nominal_type) > align)
- align = MINIMUM_ALIGNMENT (data.nominal_type,
- TYPE_MODE (data.nominal_type),
- TYPE_ALIGN (data.nominal_type));
- if (crtl->stack_alignment_estimated < align)
- {
- gcc_assert (!crtl->stack_realign_processed);
- crtl->stack_alignment_estimated = align;
- }
- }
-
- /* Find out where the parameter arrives in this function. */
- assign_parm_find_entry_rtl (&all, &data);
-
- /* Find out where stack space for this parameter might be. */
- if (assign_parm_is_stack_parm (&all, &data))
- {
- assign_parm_find_stack_rtl (parm, &data);
- assign_parm_adjust_entry_rtl (&data);
- /* For arguments that occupy no space in the parameter
- passing area, have non-zero size and have address taken,
- force creation of a stack slot so that they have distinct
- address from other parameters. */
- if (TYPE_EMPTY_P (data.arg.type)
- && TREE_ADDRESSABLE (parm)
- && data.entry_parm == data.stack_parm
- && MEM_P (data.entry_parm)
- && int_size_in_bytes (data.arg.type))
- data.stack_parm = NULL_RTX;
- }
- /* Record permanently how this parm was passed. */
- if (data.arg.pass_by_reference)
- {
- rtx incoming_rtl
- = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data.arg.type)),
- data.entry_parm);
- set_decl_incoming_rtl (parm, incoming_rtl, true);
- }
- else
- set_decl_incoming_rtl (parm, data.entry_parm, false);
-
- assign_parm_adjust_stack_rtl (&data);
-
- if (assign_parm_setup_block_p (&data))
- assign_parm_setup_block (&all, parm, &data);
- else if (data.arg.pass_by_reference || use_register_for_decl (parm))
- assign_parm_setup_reg (&all, parm, &data);
- else
- assign_parm_setup_stack (&all, parm, &data);
-
- if (cfun->stdarg && !DECL_CHAIN (parm))
- assign_parms_setup_varargs (&all, &data, false);
-
- /* Update info on where next arg arrives in registers. */
- targetm.calls.function_arg_advance (all.args_so_far, data.arg);
- }
-
- if (targetm.calls.split_complex_arg)
- assign_parms_unsplit_complex (&all, fnargs);
-
- fnargs.release ();
-
- /* Output all parameter conversion instructions (possibly including calls)
- now that all parameters have been copied out of hard registers. */
- emit_insn (all.first_conversion_insn);
-
- /* Estimate reload stack alignment from scalar return mode. */
- if (SUPPORTS_STACK_ALIGNMENT)
- {
- if (DECL_RESULT (fndecl))
- {
- tree type = TREE_TYPE (DECL_RESULT (fndecl));
- machine_mode mode = TYPE_MODE (type);
-
- if (mode != BLKmode
- && mode != VOIDmode
- && !AGGREGATE_TYPE_P (type))
- {
- unsigned int align = GET_MODE_ALIGNMENT (mode);
- if (crtl->stack_alignment_estimated < align)
- {
- gcc_assert (!crtl->stack_realign_processed);
- crtl->stack_alignment_estimated = align;
- }
- }
- }
- }
-
- /* If we are receiving a struct value address as the first argument, set up
- the RTL for the function result. As this might require code to convert
- the transmitted address to Pmode, we do this here to ensure that possible
- preliminary conversions of the address have been emitted already. */
- if (all.function_result_decl)
- {
- tree result = DECL_RESULT (current_function_decl);
- rtx addr = DECL_RTL (all.function_result_decl);
- rtx x;
-
- if (DECL_BY_REFERENCE (result))
- {
- SET_DECL_VALUE_EXPR (result, all.function_result_decl);
- x = addr;
- }
- else
- {
- SET_DECL_VALUE_EXPR (result,
- build1 (INDIRECT_REF, TREE_TYPE (result),
- all.function_result_decl));
- addr = convert_memory_address (Pmode, addr);
- x = gen_rtx_MEM (DECL_MODE (result), addr);
- set_mem_attributes (x, result, 1);
- }
-
- DECL_HAS_VALUE_EXPR_P (result) = 1;
-
- set_parm_rtl (result, x);
- }
-
- /* We have aligned all the args, so add space for the pretend args. */
- crtl->args.pretend_args_size = all.pretend_args_size;
- all.stack_args_size.constant += all.extra_pretend_bytes;
- crtl->args.size = all.stack_args_size.constant;
-
- /* Adjust function incoming argument size for alignment and
- minimum length. */
-
- crtl->args.size = upper_bound (crtl->args.size, all.reg_parm_stack_space);
- crtl->args.size = aligned_upper_bound (crtl->args.size,
- PARM_BOUNDARY / BITS_PER_UNIT);
-
- if (ARGS_GROW_DOWNWARD)
- {
- crtl->args.arg_offset_rtx
- = (all.stack_args_size.var == 0
- ? gen_int_mode (-all.stack_args_size.constant, Pmode)
- : expand_expr (size_diffop (all.stack_args_size.var,
- size_int (-all.stack_args_size.constant)),
- NULL_RTX, VOIDmode, EXPAND_NORMAL));
- }
- else
- crtl->args.arg_offset_rtx = ARGS_SIZE_RTX (all.stack_args_size);
-
- /* See how many bytes, if any, of its args a function should try to pop
- on return. */
-
- crtl->args.pops_args = targetm.calls.return_pops_args (fndecl,
- TREE_TYPE (fndecl),
- crtl->args.size);
-
- /* For stdarg.h function, save info about
- regs and stack space used by the named args. */
-
- crtl->args.info = all.args_so_far_v;
-
- /* Set the rtx used for the function return value. Put this in its
- own variable so any optimizers that need this information don't have
- to include tree.h. Do this here so it gets done when an inlined
- function gets output. */
-
- crtl->return_rtx
- = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
- ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
-
- /* If scalar return value was computed in a pseudo-reg, or was a named
- return value that got dumped to the stack, copy that to the hard
- return register. */
- if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
- {
- tree decl_result = DECL_RESULT (fndecl);
- rtx decl_rtl = DECL_RTL (decl_result);
-
- if (REG_P (decl_rtl)
- ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
- : DECL_REGISTER (decl_result))
- {
- rtx real_decl_rtl;
-
- /* Unless the psABI says not to. */
- if (TYPE_EMPTY_P (TREE_TYPE (decl_result)))
- real_decl_rtl = NULL_RTX;
- else
- {
- real_decl_rtl
- = targetm.calls.function_value (TREE_TYPE (decl_result),
- fndecl, true);
- REG_FUNCTION_VALUE_P (real_decl_rtl) = 1;
- }
- /* The delay slot scheduler assumes that crtl->return_rtx
- holds the hard register containing the return value, not a
- temporary pseudo. */
- crtl->return_rtx = real_decl_rtl;
- }
- }
-}
-
-/* A subroutine of gimplify_parameters, invoked via walk_tree.
- For all seen types, gimplify their sizes. */
-
-static tree
-gimplify_parm_type (tree *tp, int *walk_subtrees, void *data)
-{
- tree t = *tp;
-
- *walk_subtrees = 0;
- if (TYPE_P (t))
- {
- if (POINTER_TYPE_P (t))
- *walk_subtrees = 1;
- else if (TYPE_SIZE (t) && !TREE_CONSTANT (TYPE_SIZE (t))
- && !TYPE_SIZES_GIMPLIFIED (t))
- {
- gimplify_type_sizes (t, (gimple_seq *) data);
- *walk_subtrees = 1;
- }
- }
-
- return NULL;
-}
-
-/* Gimplify the parameter list for current_function_decl. This involves
- evaluating SAVE_EXPRs of variable sized parameters and generating code
- to implement callee-copies reference parameters. Returns a sequence of
- statements to add to the beginning of the function. */
-
-gimple_seq
-gimplify_parameters (gimple_seq *cleanup)
-{
- struct assign_parm_data_all all;
- tree parm;
- gimple_seq stmts = NULL;
- vec<tree> fnargs;
- unsigned i;
-
- assign_parms_initialize_all (&all);
- fnargs = assign_parms_augmented_arg_list (&all);
-
- FOR_EACH_VEC_ELT (fnargs, i, parm)
- {
- struct assign_parm_data_one data;
-
- /* Extract the type of PARM; adjust it according to ABI. */
- assign_parm_find_data_types (&all, parm, &data);
-
- /* Early out for errors and void parameters. */
- if (data.passed_mode == VOIDmode || DECL_SIZE (parm) == NULL)
- continue;
-
- /* Update info on where next arg arrives in registers. */
- targetm.calls.function_arg_advance (all.args_so_far, data.arg);
-
- /* ??? Once upon a time variable_size stuffed parameter list
- SAVE_EXPRs (amongst others) onto a pending sizes list. This
- turned out to be less than manageable in the gimple world.
- Now we have to hunt them down ourselves. */
- walk_tree_without_duplicates (&data.arg.type,
- gimplify_parm_type, &stmts);
-
- if (TREE_CODE (DECL_SIZE_UNIT (parm)) != INTEGER_CST)
- {
- gimplify_one_sizepos (&DECL_SIZE (parm), &stmts);
- gimplify_one_sizepos (&DECL_SIZE_UNIT (parm), &stmts);
- }
-
- if (data.arg.pass_by_reference)
- {
- tree type = TREE_TYPE (data.arg.type);
- function_arg_info orig_arg (type, data.arg.named);
- if (reference_callee_copied (&all.args_so_far_v, orig_arg))
- {
- tree local, t;
-
- /* For constant-sized objects, this is trivial; for
- variable-sized objects, we have to play games. */
- if (TREE_CODE (DECL_SIZE_UNIT (parm)) == INTEGER_CST
- && !(flag_stack_check == GENERIC_STACK_CHECK
- && compare_tree_int (DECL_SIZE_UNIT (parm),
- STACK_CHECK_MAX_VAR_SIZE) > 0))
- {
- local = create_tmp_var (type, get_name (parm));
- DECL_IGNORED_P (local) = 0;
- /* If PARM was addressable, move that flag over
- to the local copy, as its address will be taken,
- not the PARMs. Keep the parms address taken
- as we'll query that flag during gimplification. */
- if (TREE_ADDRESSABLE (parm))
- TREE_ADDRESSABLE (local) = 1;
- if (DECL_NOT_GIMPLE_REG_P (parm))
- DECL_NOT_GIMPLE_REG_P (local) = 1;
-
- if (!is_gimple_reg (local)
- && flag_stack_reuse != SR_NONE)
- {
- tree clobber = build_clobber (type);
- gimple *clobber_stmt;
- clobber_stmt = gimple_build_assign (local, clobber);
- gimple_seq_add_stmt (cleanup, clobber_stmt);
- }
- }
- else
- {
- tree ptr_type, addr;
-
- ptr_type = build_pointer_type (type);
- addr = create_tmp_reg (ptr_type, get_name (parm));
- DECL_IGNORED_P (addr) = 0;
- local = build_fold_indirect_ref (addr);
-
- t = build_alloca_call_expr (DECL_SIZE_UNIT (parm),
- DECL_ALIGN (parm),
- max_int_size_in_bytes (type));
- /* The call has been built for a variable-sized object. */
- CALL_ALLOCA_FOR_VAR_P (t) = 1;
- t = fold_convert (ptr_type, t);
- t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
- gimplify_and_add (t, &stmts);
- }
-
- gimplify_assign (local, parm, &stmts);
-
- SET_DECL_VALUE_EXPR (parm, local);
- DECL_HAS_VALUE_EXPR_P (parm) = 1;
- }
- }
- }
-
- fnargs.release ();
-
- return stmts;
-}
-
-/* Compute the size and offset from the start of the stacked arguments for a
- parm passed in mode PASSED_MODE and with type TYPE.
-
- INITIAL_OFFSET_PTR points to the current offset into the stacked
- arguments.
-
- The starting offset and size for this parm are returned in
- LOCATE->OFFSET and LOCATE->SIZE, respectively. When IN_REGS is
- nonzero, the offset is that of stack slot, which is returned in
- LOCATE->SLOT_OFFSET. LOCATE->ALIGNMENT_PAD is the amount of
- padding required from the initial offset ptr to the stack slot.
-
- IN_REGS is nonzero if the argument will be passed in registers. It will
- never be set if REG_PARM_STACK_SPACE is not defined.
-
- REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
- for arguments which are passed in registers.
-
- FNDECL is the function in which the argument was defined.
-
- There are two types of rounding that are done. The first, controlled by
- TARGET_FUNCTION_ARG_BOUNDARY, forces the offset from the start of the
- argument list to be aligned to the specific boundary (in bits). This
- rounding affects the initial and starting offsets, but not the argument
- size.
-
- The second, controlled by TARGET_FUNCTION_ARG_PADDING and PARM_BOUNDARY,
- optionally rounds the size of the parm to PARM_BOUNDARY. The
- initial offset is not affected by this rounding, while the size always
- is and the starting offset may be. */
-
-/* LOCATE->OFFSET will be negative for ARGS_GROW_DOWNWARD case;
- INITIAL_OFFSET_PTR is positive because locate_and_pad_parm's
- callers pass in the total size of args so far as
- INITIAL_OFFSET_PTR. LOCATE->SIZE is always positive. */
-
-void
-locate_and_pad_parm (machine_mode passed_mode, tree type, int in_regs,
- int reg_parm_stack_space, int partial,
- tree fndecl ATTRIBUTE_UNUSED,
- struct args_size *initial_offset_ptr,
- struct locate_and_pad_arg_data *locate)
-{
- tree sizetree;
- pad_direction where_pad;
- unsigned int boundary, round_boundary;
- int part_size_in_regs;
-
- /* If we have found a stack parm before we reach the end of the
- area reserved for registers, skip that area. */
- if (! in_regs)
- {
- if (reg_parm_stack_space > 0)
- {
- if (initial_offset_ptr->var
- || !ordered_p (initial_offset_ptr->constant,
- reg_parm_stack_space))
- {
- initial_offset_ptr->var
- = size_binop (MAX_EXPR, ARGS_SIZE_TREE (*initial_offset_ptr),
- ssize_int (reg_parm_stack_space));
- initial_offset_ptr->constant = 0;
- }
- else
- initial_offset_ptr->constant
- = ordered_max (initial_offset_ptr->constant,
- reg_parm_stack_space);
- }
- }
-
- part_size_in_regs = (reg_parm_stack_space == 0 ? partial : 0);
-
- sizetree = (type
- ? arg_size_in_bytes (type)
- : size_int (GET_MODE_SIZE (passed_mode)));
- where_pad = targetm.calls.function_arg_padding (passed_mode, type);
- boundary = targetm.calls.function_arg_boundary (passed_mode, type);
- round_boundary = targetm.calls.function_arg_round_boundary (passed_mode,
- type);
- locate->where_pad = where_pad;
-
- /* Alignment can't exceed MAX_SUPPORTED_STACK_ALIGNMENT. */
- if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT)
- boundary = MAX_SUPPORTED_STACK_ALIGNMENT;
-
- locate->boundary = boundary;
-
- if (SUPPORTS_STACK_ALIGNMENT)
- {
- /* stack_alignment_estimated can't change after stack has been
- realigned. */
- if (crtl->stack_alignment_estimated < boundary)
- {
- if (!crtl->stack_realign_processed)
- crtl->stack_alignment_estimated = boundary;
- else
- {
- /* If stack is realigned and stack alignment value
- hasn't been finalized, it is OK not to increase
- stack_alignment_estimated. The bigger alignment
- requirement is recorded in stack_alignment_needed
- below. */
- gcc_assert (!crtl->stack_realign_finalized
- && crtl->stack_realign_needed);
- }
- }
- }
-
- if (ARGS_GROW_DOWNWARD)
- {
- locate->slot_offset.constant = -initial_offset_ptr->constant;
- if (initial_offset_ptr->var)
- locate->slot_offset.var = size_binop (MINUS_EXPR, ssize_int (0),
- initial_offset_ptr->var);
-
- {
- tree s2 = sizetree;
- if (where_pad != PAD_NONE
- && (!tree_fits_uhwi_p (sizetree)
- || (tree_to_uhwi (sizetree) * BITS_PER_UNIT) % round_boundary))
- s2 = round_up (s2, round_boundary / BITS_PER_UNIT);
- SUB_PARM_SIZE (locate->slot_offset, s2);
- }
-
- locate->slot_offset.constant += part_size_in_regs;
-
- if (!in_regs || reg_parm_stack_space > 0)
- pad_to_arg_alignment (&locate->slot_offset, boundary,
- &locate->alignment_pad);
-
- locate->size.constant = (-initial_offset_ptr->constant
- - locate->slot_offset.constant);
- if (initial_offset_ptr->var)
- locate->size.var = size_binop (MINUS_EXPR,
- size_binop (MINUS_EXPR,
- ssize_int (0),
- initial_offset_ptr->var),
- locate->slot_offset.var);
-
- /* Pad_below needs the pre-rounded size to know how much to pad
- below. */
- locate->offset = locate->slot_offset;
- if (where_pad == PAD_DOWNWARD)
- pad_below (&locate->offset, passed_mode, sizetree);
-
- }
- else
- {
- if (!in_regs || reg_parm_stack_space > 0)
- pad_to_arg_alignment (initial_offset_ptr, boundary,
- &locate->alignment_pad);
- locate->slot_offset = *initial_offset_ptr;
-
-#ifdef PUSH_ROUNDING
- if (passed_mode != BLKmode)
- sizetree = size_int (PUSH_ROUNDING (TREE_INT_CST_LOW (sizetree)));
-#endif
-
- /* Pad_below needs the pre-rounded size to know how much to pad below
- so this must be done before rounding up. */
- locate->offset = locate->slot_offset;
- if (where_pad == PAD_DOWNWARD)
- pad_below (&locate->offset, passed_mode, sizetree);
-
- if (where_pad != PAD_NONE
- && (!tree_fits_uhwi_p (sizetree)
- || (tree_to_uhwi (sizetree) * BITS_PER_UNIT) % round_boundary))
- sizetree = round_up (sizetree, round_boundary / BITS_PER_UNIT);
-
- ADD_PARM_SIZE (locate->size, sizetree);
-
- locate->size.constant -= part_size_in_regs;
- }
-
- locate->offset.constant
- += targetm.calls.function_arg_offset (passed_mode, type);
-}
-
-/* Round the stack offset in *OFFSET_PTR up to a multiple of BOUNDARY.
- BOUNDARY is measured in bits, but must be a multiple of a storage unit. */
-
-static void
-pad_to_arg_alignment (struct args_size *offset_ptr, int boundary,
- struct args_size *alignment_pad)
-{
- tree save_var = NULL_TREE;
- poly_int64 save_constant = 0;
- int boundary_in_bytes = boundary / BITS_PER_UNIT;
- poly_int64 sp_offset = STACK_POINTER_OFFSET;
-
-#ifdef SPARC_STACK_BOUNDARY_HACK
- /* ??? The SPARC port may claim a STACK_BOUNDARY higher than
- the real alignment of %sp. However, when it does this, the
- alignment of %sp+STACK_POINTER_OFFSET is STACK_BOUNDARY. */
- if (SPARC_STACK_BOUNDARY_HACK)
- sp_offset = 0;
-#endif
-
- if (boundary > PARM_BOUNDARY)
- {
- save_var = offset_ptr->var;
- save_constant = offset_ptr->constant;
- }
-
- alignment_pad->var = NULL_TREE;
- alignment_pad->constant = 0;
-
- if (boundary > BITS_PER_UNIT)
- {
- int misalign;
- if (offset_ptr->var
- || !known_misalignment (offset_ptr->constant + sp_offset,
- boundary_in_bytes, &misalign))
- {
- tree sp_offset_tree = ssize_int (sp_offset);
- tree offset = size_binop (PLUS_EXPR,
- ARGS_SIZE_TREE (*offset_ptr),
- sp_offset_tree);
- tree rounded;
- if (ARGS_GROW_DOWNWARD)
- rounded = round_down (offset, boundary / BITS_PER_UNIT);
- else
- rounded = round_up (offset, boundary / BITS_PER_UNIT);
-
- offset_ptr->var = size_binop (MINUS_EXPR, rounded, sp_offset_tree);
- /* ARGS_SIZE_TREE includes constant term. */
- offset_ptr->constant = 0;
- if (boundary > PARM_BOUNDARY)
- alignment_pad->var = size_binop (MINUS_EXPR, offset_ptr->var,
- save_var);
- }
- else
- {
- if (ARGS_GROW_DOWNWARD)
- offset_ptr->constant -= misalign;
- else
- offset_ptr->constant += -misalign & (boundary_in_bytes - 1);
-
- if (boundary > PARM_BOUNDARY)
- alignment_pad->constant = offset_ptr->constant - save_constant;
- }
- }
-}
-
-static void
-pad_below (struct args_size *offset_ptr, machine_mode passed_mode, tree sizetree)
-{
- unsigned int align = PARM_BOUNDARY / BITS_PER_UNIT;
- int misalign;
- if (passed_mode != BLKmode
- && known_misalignment (GET_MODE_SIZE (passed_mode), align, &misalign))
- offset_ptr->constant += -misalign & (align - 1);
- else
- {
- if (TREE_CODE (sizetree) != INTEGER_CST
- || (TREE_INT_CST_LOW (sizetree) & (align - 1)) != 0)
- {
- /* Round the size up to multiple of PARM_BOUNDARY bits. */
- tree s2 = round_up (sizetree, align);
- /* Add it in. */
- ADD_PARM_SIZE (*offset_ptr, s2);
- SUB_PARM_SIZE (*offset_ptr, sizetree);
- }
- }
-}
-
-
-/* True if register REGNO was alive at a place where `setjmp' was
- called and was set more than once or is an argument. Such regs may
- be clobbered by `longjmp'. */
-
-static bool
-regno_clobbered_at_setjmp (bitmap setjmp_crosses, int regno)
-{
- /* There appear to be cases where some local vars never reach the
- backend but have bogus regnos. */
- if (regno >= max_reg_num ())
- return false;
-
- return ((REG_N_SETS (regno) > 1
- || REGNO_REG_SET_P (df_get_live_out (ENTRY_BLOCK_PTR_FOR_FN (cfun)),
- regno))
- && REGNO_REG_SET_P (setjmp_crosses, regno));
-}
-
-/* Walk the tree of blocks describing the binding levels within a
- function and warn about variables the might be killed by setjmp or
- vfork. This is done after calling flow_analysis before register
- allocation since that will clobber the pseudo-regs to hard
- regs. */
-
-static void
-setjmp_vars_warning (bitmap setjmp_crosses, tree block)
-{
- tree decl, sub;
-
- for (decl = BLOCK_VARS (block); decl; decl = DECL_CHAIN (decl))
- {
- if (VAR_P (decl)
- && DECL_RTL_SET_P (decl)
- && REG_P (DECL_RTL (decl))
- && regno_clobbered_at_setjmp (setjmp_crosses, REGNO (DECL_RTL (decl))))
- warning (OPT_Wclobbered, "variable %q+D might be clobbered by"
- " %<longjmp%> or %<vfork%>", decl);
- }
-
- for (sub = BLOCK_SUBBLOCKS (block); sub; sub = BLOCK_CHAIN (sub))
- setjmp_vars_warning (setjmp_crosses, sub);
-}
-
-/* Do the appropriate part of setjmp_vars_warning
- but for arguments instead of local variables. */
-
-static void
-setjmp_args_warning (bitmap setjmp_crosses)
-{
- tree decl;
- for (decl = DECL_ARGUMENTS (current_function_decl);
- decl; decl = DECL_CHAIN (decl))
- if (DECL_RTL (decl) != 0
- && REG_P (DECL_RTL (decl))
- && regno_clobbered_at_setjmp (setjmp_crosses, REGNO (DECL_RTL (decl))))
- warning (OPT_Wclobbered,
- "argument %q+D might be clobbered by %<longjmp%> or %<vfork%>",
- decl);
-}
-
-/* Generate warning messages for variables live across setjmp. */
-
-void
-generate_setjmp_warnings (void)
-{
- bitmap setjmp_crosses = regstat_get_setjmp_crosses ();
-
- if (n_basic_blocks_for_fn (cfun) == NUM_FIXED_BLOCKS
- || bitmap_empty_p (setjmp_crosses))
- return;
-
- setjmp_vars_warning (setjmp_crosses, DECL_INITIAL (current_function_decl));
- setjmp_args_warning (setjmp_crosses);
-}
-
-
-/* Reverse the order of elements in the fragment chain T of blocks,
- and return the new head of the chain (old last element).
- In addition to that clear BLOCK_SAME_RANGE flags when needed
- and adjust BLOCK_SUPERCONTEXT from the super fragment to
- its super fragment origin. */
-
-static tree
-block_fragments_nreverse (tree t)
-{
- tree prev = 0, block, next, prev_super = 0;
- tree super = BLOCK_SUPERCONTEXT (t);
- if (BLOCK_FRAGMENT_ORIGIN (super))
- super = BLOCK_FRAGMENT_ORIGIN (super);
- for (block = t; block; block = next)
- {
- next = BLOCK_FRAGMENT_CHAIN (block);
- BLOCK_FRAGMENT_CHAIN (block) = prev;
- if ((prev && !BLOCK_SAME_RANGE (prev))
- || (BLOCK_FRAGMENT_CHAIN (BLOCK_SUPERCONTEXT (block))
- != prev_super))
- BLOCK_SAME_RANGE (block) = 0;
- prev_super = BLOCK_SUPERCONTEXT (block);
- BLOCK_SUPERCONTEXT (block) = super;
- prev = block;
- }
- t = BLOCK_FRAGMENT_ORIGIN (t);
- if (BLOCK_FRAGMENT_CHAIN (BLOCK_SUPERCONTEXT (t))
- != prev_super)
- BLOCK_SAME_RANGE (t) = 0;
- BLOCK_SUPERCONTEXT (t) = super;
- return prev;
-}
-
-/* Reverse the order of elements in the chain T of blocks,
- and return the new head of the chain (old last element).
- Also do the same on subblocks and reverse the order of elements
- in BLOCK_FRAGMENT_CHAIN as well. */
-
-static tree
-blocks_nreverse_all (tree t)
-{
- tree prev = 0, block, next;
- for (block = t; block; block = next)
- {
- next = BLOCK_CHAIN (block);
- BLOCK_CHAIN (block) = prev;
- if (BLOCK_FRAGMENT_CHAIN (block)
- && BLOCK_FRAGMENT_ORIGIN (block) == NULL_TREE)
- {
- BLOCK_FRAGMENT_CHAIN (block)
- = block_fragments_nreverse (BLOCK_FRAGMENT_CHAIN (block));
- if (!BLOCK_SAME_RANGE (BLOCK_FRAGMENT_CHAIN (block)))
- BLOCK_SAME_RANGE (block) = 0;
- }
- BLOCK_SUBBLOCKS (block) = blocks_nreverse_all (BLOCK_SUBBLOCKS (block));
- prev = block;
- }
- return prev;
-}
-
-
-/* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
- and create duplicate blocks. */
-/* ??? Need an option to either create block fragments or to create
- abstract origin duplicates of a source block. It really depends
- on what optimization has been performed. */
-
-void
-reorder_blocks (void)
-{
- tree block = DECL_INITIAL (current_function_decl);
-
- if (block == NULL_TREE)
- return;
-
- auto_vec<tree, 10> block_stack;
-
- /* Reset the TREE_ASM_WRITTEN bit for all blocks. */
- clear_block_marks (block);
-
- /* Prune the old trees away, so that they don't get in the way. */
- BLOCK_SUBBLOCKS (block) = NULL_TREE;
- BLOCK_CHAIN (block) = NULL_TREE;
-
- /* Recreate the block tree from the note nesting. */
- reorder_blocks_1 (get_insns (), block, &block_stack);
- BLOCK_SUBBLOCKS (block) = blocks_nreverse_all (BLOCK_SUBBLOCKS (block));
-}
-
-/* Helper function for reorder_blocks. Reset TREE_ASM_WRITTEN. */
-
-void
-clear_block_marks (tree block)
-{
- while (block)
- {
- TREE_ASM_WRITTEN (block) = 0;
- clear_block_marks (BLOCK_SUBBLOCKS (block));
- block = BLOCK_CHAIN (block);
- }
-}
-
-static void
-reorder_blocks_1 (rtx_insn *insns, tree current_block,
- vec<tree> *p_block_stack)
-{
- rtx_insn *insn;
- tree prev_beg = NULL_TREE, prev_end = NULL_TREE;
-
- for (insn = insns; insn; insn = NEXT_INSN (insn))
- {
- if (NOTE_P (insn))
- {
- if (NOTE_KIND (insn) == NOTE_INSN_BLOCK_BEG)
- {
- tree block = NOTE_BLOCK (insn);
- tree origin;
-
- gcc_assert (BLOCK_FRAGMENT_ORIGIN (block) == NULL_TREE);
- origin = block;
-
- if (prev_end)
- BLOCK_SAME_RANGE (prev_end) = 0;
- prev_end = NULL_TREE;
-
- /* If we have seen this block before, that means it now
- spans multiple address regions. Create a new fragment. */
- if (TREE_ASM_WRITTEN (block))
- {
- tree new_block = copy_node (block);
-
- BLOCK_SAME_RANGE (new_block) = 0;
- BLOCK_FRAGMENT_ORIGIN (new_block) = origin;
- BLOCK_FRAGMENT_CHAIN (new_block)
- = BLOCK_FRAGMENT_CHAIN (origin);
- BLOCK_FRAGMENT_CHAIN (origin) = new_block;
-
- NOTE_BLOCK (insn) = new_block;
- block = new_block;
- }
-
- if (prev_beg == current_block && prev_beg)
- BLOCK_SAME_RANGE (block) = 1;
-
- prev_beg = origin;
-
- BLOCK_SUBBLOCKS (block) = 0;
- TREE_ASM_WRITTEN (block) = 1;
- /* When there's only one block for the entire function,
- current_block == block and we mustn't do this, it
- will cause infinite recursion. */
- if (block != current_block)
- {
- tree super;
- if (block != origin)
- gcc_assert (BLOCK_SUPERCONTEXT (origin) == current_block
- || BLOCK_FRAGMENT_ORIGIN (BLOCK_SUPERCONTEXT
- (origin))
- == current_block);
- if (p_block_stack->is_empty ())
- super = current_block;
- else
- {
- super = p_block_stack->last ();
- gcc_assert (super == current_block
- || BLOCK_FRAGMENT_ORIGIN (super)
- == current_block);
- }
- BLOCK_SUPERCONTEXT (block) = super;
- BLOCK_CHAIN (block) = BLOCK_SUBBLOCKS (current_block);
- BLOCK_SUBBLOCKS (current_block) = block;
- current_block = origin;
- }
- p_block_stack->safe_push (block);
- }
- else if (NOTE_KIND (insn) == NOTE_INSN_BLOCK_END)
- {
- NOTE_BLOCK (insn) = p_block_stack->pop ();
- current_block = BLOCK_SUPERCONTEXT (current_block);
- if (BLOCK_FRAGMENT_ORIGIN (current_block))
- current_block = BLOCK_FRAGMENT_ORIGIN (current_block);
- prev_beg = NULL_TREE;
- prev_end = BLOCK_SAME_RANGE (NOTE_BLOCK (insn))
- ? NOTE_BLOCK (insn) : NULL_TREE;
- }
- }
- else
- {
- prev_beg = NULL_TREE;
- if (prev_end)
- BLOCK_SAME_RANGE (prev_end) = 0;
- prev_end = NULL_TREE;
- }
- }
-}
-
-/* Reverse the order of elements in the chain T of blocks,
- and return the new head of the chain (old last element). */
-
-tree
-blocks_nreverse (tree t)
-{
- tree prev = 0, block, next;
- for (block = t; block; block = next)
- {
- next = BLOCK_CHAIN (block);
- BLOCK_CHAIN (block) = prev;
- prev = block;
- }
- return prev;
-}
-
-/* Concatenate two chains of blocks (chained through BLOCK_CHAIN)
- by modifying the last node in chain 1 to point to chain 2. */
-
-tree
-block_chainon (tree op1, tree op2)
-{
- tree t1;
-
- if (!op1)
- return op2;
- if (!op2)
- return op1;
-
- for (t1 = op1; BLOCK_CHAIN (t1); t1 = BLOCK_CHAIN (t1))
- continue;
- BLOCK_CHAIN (t1) = op2;
-
-#ifdef ENABLE_TREE_CHECKING
- {
- tree t2;
- for (t2 = op2; t2; t2 = BLOCK_CHAIN (t2))
- gcc_assert (t2 != t1);
- }
-#endif
-
- return op1;
-}
-
-/* Count the subblocks of the list starting with BLOCK. If VECTOR is
- non-NULL, list them all into VECTOR, in a depth-first preorder
- traversal of the block tree. Also clear TREE_ASM_WRITTEN in all
- blocks. */
-
-static int
-all_blocks (tree block, tree *vector)
-{
- int n_blocks = 0;
-
- while (block)
- {
- TREE_ASM_WRITTEN (block) = 0;
-
- /* Record this block. */
- if (vector)
- vector[n_blocks] = block;
-
- ++n_blocks;
-
- /* Record the subblocks, and their subblocks... */
- n_blocks += all_blocks (BLOCK_SUBBLOCKS (block),
- vector ? vector + n_blocks : 0);
- block = BLOCK_CHAIN (block);
- }
-
- return n_blocks;
-}
-
-/* Return a vector containing all the blocks rooted at BLOCK. The
- number of elements in the vector is stored in N_BLOCKS_P. The
- vector is dynamically allocated; it is the caller's responsibility
- to call `free' on the pointer returned. */
-
-static tree *
-get_block_vector (tree block, int *n_blocks_p)
-{
- tree *block_vector;
-
- *n_blocks_p = all_blocks (block, NULL);
- block_vector = XNEWVEC (tree, *n_blocks_p);
- all_blocks (block, block_vector);
-
- return block_vector;
-}
-
-static GTY(()) int next_block_index = 2;
-
-/* Set BLOCK_NUMBER for all the blocks in FN. */
-
-void
-number_blocks (tree fn)
-{
- int i;
- int n_blocks;
- tree *block_vector;
-
- /* For XCOFF debugging output, we start numbering the blocks
- from 1 within each function, rather than keeping a running
- count. */
-#if defined (XCOFF_DEBUGGING_INFO)
- if (write_symbols == XCOFF_DEBUG)
- next_block_index = 1;
-#endif
-
- block_vector = get_block_vector (DECL_INITIAL (fn), &n_blocks);
-
- /* The top-level BLOCK isn't numbered at all. */
- for (i = 1; i < n_blocks; ++i)
- /* We number the blocks from two. */
- BLOCK_NUMBER (block_vector[i]) = next_block_index++;
-
- free (block_vector);
-
- return;
-}
-
-/* If VAR is present in a subblock of BLOCK, return the subblock. */
-
-DEBUG_FUNCTION tree
-debug_find_var_in_block_tree (tree var, tree block)
-{
- tree t;
-
- for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
- if (t == var)
- return block;
-
- for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
- {
- tree ret = debug_find_var_in_block_tree (var, t);
- if (ret)
- return ret;
- }
-
- return NULL_TREE;
-}
-
-/* Keep track of whether we're in a dummy function context. If we are,
- we don't want to invoke the set_current_function hook, because we'll
- get into trouble if the hook calls target_reinit () recursively or
- when the initial initialization is not yet complete. */
-
-static bool in_dummy_function;
-
-/* Invoke the target hook when setting cfun. Update the optimization options
- if the function uses different options than the default. */
-
-static void
-invoke_set_current_function_hook (tree fndecl)
-{
- if (!in_dummy_function)
- {
- tree opts = ((fndecl)
- ? DECL_FUNCTION_SPECIFIC_OPTIMIZATION (fndecl)
- : optimization_default_node);
-
- if (!opts)
- opts = optimization_default_node;
-
- /* Change optimization options if needed. */
- if (optimization_current_node != opts)
- {
- optimization_current_node = opts;
- cl_optimization_restore (&global_options, &global_options_set,
- TREE_OPTIMIZATION (opts));
- }
-
- targetm.set_current_function (fndecl);
- this_fn_optabs = this_target_optabs;
-
- /* Initialize global alignment variables after op. */
- parse_alignment_opts ();
-
- if (opts != optimization_default_node)
- {
- init_tree_optimization_optabs (opts);
- if (TREE_OPTIMIZATION_OPTABS (opts))
- this_fn_optabs = (struct target_optabs *)
- TREE_OPTIMIZATION_OPTABS (opts);
- }
- }
-}
-
-/* cfun should never be set directly; use this function. */
-
-void
-set_cfun (struct function *new_cfun, bool force)
-{
- if (cfun != new_cfun || force)
- {
- cfun = new_cfun;
- invoke_set_current_function_hook (new_cfun ? new_cfun->decl : NULL_TREE);
- redirect_edge_var_map_empty ();
- }
-}
-
-/* Initialized with NOGC, making this poisonous to the garbage collector. */
-
-static vec<function *> cfun_stack;
-
-/* Push the current cfun onto the stack, and set cfun to new_cfun. Also set
- current_function_decl accordingly. */
-
-void
-push_cfun (struct function *new_cfun)
-{
- gcc_assert ((!cfun && !current_function_decl)
- || (cfun && current_function_decl == cfun->decl));
- cfun_stack.safe_push (cfun);
- current_function_decl = new_cfun ? new_cfun->decl : NULL_TREE;
- set_cfun (new_cfun);
-}
-
-/* Pop cfun from the stack. Also set current_function_decl accordingly. */
-
-void
-pop_cfun (void)
-{
- struct function *new_cfun = cfun_stack.pop ();
- /* When in_dummy_function, we do have a cfun but current_function_decl is
- NULL. We also allow pushing NULL cfun and subsequently changing
- current_function_decl to something else and have both restored by
- pop_cfun. */
- gcc_checking_assert (in_dummy_function
- || !cfun
- || current_function_decl == cfun->decl);
- set_cfun (new_cfun);
- current_function_decl = new_cfun ? new_cfun->decl : NULL_TREE;
-}
-
-/* Return value of funcdef and increase it. */
-int
-get_next_funcdef_no (void)
-{
- return funcdef_no++;
-}
-
-/* Return value of funcdef. */
-int
-get_last_funcdef_no (void)
-{
- return funcdef_no;
-}
-
-/* Allocate and initialize the stack usage info data structure for the
- current function. */
-static void
-allocate_stack_usage_info (void)
-{
- gcc_assert (!cfun->su);
- cfun->su = ggc_cleared_alloc<stack_usage> ();
- cfun->su->static_stack_size = -1;
-}
-
-/* Allocate a function structure for FNDECL and set its contents
- to the defaults. Set cfun to the newly-allocated object.
- Some of the helper functions invoked during initialization assume
- that cfun has already been set. Therefore, assign the new object
- directly into cfun and invoke the back end hook explicitly at the
- very end, rather than initializing a temporary and calling set_cfun
- on it.
-
- ABSTRACT_P is true if this is a function that will never be seen by
- the middle-end. Such functions are front-end concepts (like C++
- function templates) that do not correspond directly to functions
- placed in object files. */
-
-void
-allocate_struct_function (tree fndecl, bool abstract_p)
-{
- tree fntype = fndecl ? TREE_TYPE (fndecl) : NULL_TREE;
-
- cfun = ggc_cleared_alloc<function> ();
-
- init_eh_for_function ();
-
- if (init_machine_status)
- cfun->machine = (*init_machine_status) ();
-
-#ifdef OVERRIDE_ABI_FORMAT
- OVERRIDE_ABI_FORMAT (fndecl);
-#endif
-
- if (fndecl != NULL_TREE)
- {
- DECL_STRUCT_FUNCTION (fndecl) = cfun;
- cfun->decl = fndecl;
- current_function_funcdef_no = get_next_funcdef_no ();
- }
-
- invoke_set_current_function_hook (fndecl);
-
- if (fndecl != NULL_TREE)
- {
- tree result = DECL_RESULT (fndecl);
-
- if (!abstract_p)
- {
- /* Now that we have activated any function-specific attributes
- that might affect layout, particularly vector modes, relayout
- each of the parameters and the result. */
- relayout_decl (result);
- for (tree parm = DECL_ARGUMENTS (fndecl); parm;
- parm = DECL_CHAIN (parm))
- relayout_decl (parm);
-
- /* Similarly relayout the function decl. */
- targetm.target_option.relayout_function (fndecl);
- }
-
- if (!abstract_p && aggregate_value_p (result, fndecl))
- {
-#ifdef PCC_STATIC_STRUCT_RETURN
- cfun->returns_pcc_struct = 1;
-#endif
- cfun->returns_struct = 1;
- }
-
- cfun->stdarg = stdarg_p (fntype);
-
- /* Assume all registers in stdarg functions need to be saved. */
- cfun->va_list_gpr_size = VA_LIST_MAX_GPR_SIZE;
- cfun->va_list_fpr_size = VA_LIST_MAX_FPR_SIZE;
-
- /* ??? This could be set on a per-function basis by the front-end
- but is this worth the hassle? */
- cfun->can_throw_non_call_exceptions = flag_non_call_exceptions;
- cfun->can_delete_dead_exceptions = flag_delete_dead_exceptions;
-
- if (!profile_flag && !flag_instrument_function_entry_exit)
- DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl) = 1;
-
- if (flag_callgraph_info)
- allocate_stack_usage_info ();
- }
-
- /* Don't enable begin stmt markers if var-tracking at assignments is
- disabled. The markers make little sense without the variable
- binding annotations among them. */
- cfun->debug_nonbind_markers = lang_hooks.emits_begin_stmt
- && MAY_HAVE_DEBUG_MARKER_STMTS;
-}
-
-/* This is like allocate_struct_function, but pushes a new cfun for FNDECL
- instead of just setting it. */
-
-void
-push_struct_function (tree fndecl)
-{
- /* When in_dummy_function we might be in the middle of a pop_cfun and
- current_function_decl and cfun may not match. */
- gcc_assert (in_dummy_function
- || (!cfun && !current_function_decl)
- || (cfun && current_function_decl == cfun->decl));
- cfun_stack.safe_push (cfun);
- current_function_decl = fndecl;
- allocate_struct_function (fndecl, false);
-}
-
-/* Reset crtl and other non-struct-function variables to defaults as
- appropriate for emitting rtl at the start of a function. */
-
-static void
-prepare_function_start (void)
-{
- gcc_assert (!get_last_insn ());
-
- if (in_dummy_function)
- crtl->abi = &default_function_abi;
- else
- crtl->abi = &fndecl_abi (cfun->decl).base_abi ();
-
- init_temp_slots ();
- init_emit ();
- init_varasm_status ();
- init_expr ();
- default_rtl_profile ();
-
- if (flag_stack_usage_info && !flag_callgraph_info)
- allocate_stack_usage_info ();
-
- cse_not_expected = ! optimize;
-
- /* Caller save not needed yet. */
- caller_save_needed = 0;
-
- /* We haven't done register allocation yet. */
- reg_renumber = 0;
-
- /* Indicate that we have not instantiated virtual registers yet. */
- virtuals_instantiated = 0;
-
- /* Indicate that we want CONCATs now. */
- generating_concat_p = 1;
-
- /* Indicate we have no need of a frame pointer yet. */
- frame_pointer_needed = 0;
-}
-
-void
-push_dummy_function (bool with_decl)
-{
- tree fn_decl, fn_type, fn_result_decl;
-
- gcc_assert (!in_dummy_function);
- in_dummy_function = true;
-
- if (with_decl)
- {
- fn_type = build_function_type_list (void_type_node, NULL_TREE);
- fn_decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, NULL_TREE,
- fn_type);
- fn_result_decl = build_decl (UNKNOWN_LOCATION, RESULT_DECL,
- NULL_TREE, void_type_node);
- DECL_RESULT (fn_decl) = fn_result_decl;
- DECL_ARTIFICIAL (fn_decl) = 1;
- tree fn_name = get_identifier (" ");
- SET_DECL_ASSEMBLER_NAME (fn_decl, fn_name);
- }
- else
- fn_decl = NULL_TREE;
-
- push_struct_function (fn_decl);
-}
-
-/* Initialize the rtl expansion mechanism so that we can do simple things
- like generate sequences. This is used to provide a context during global
- initialization of some passes. You must call expand_dummy_function_end
- to exit this context. */
-
-void
-init_dummy_function_start (void)
-{
- push_dummy_function (false);
- prepare_function_start ();
-}
-
-/* Generate RTL for the start of the function SUBR (a FUNCTION_DECL tree node)
- and initialize static variables for generating RTL for the statements
- of the function. */
-
-void
-init_function_start (tree subr)
-{
- /* Initialize backend, if needed. */
- initialize_rtl ();
-
- prepare_function_start ();
- decide_function_section (subr);
-
- /* Warn if this value is an aggregate type,
- regardless of which calling convention we are using for it. */
- if (AGGREGATE_TYPE_P (TREE_TYPE (DECL_RESULT (subr))))
- warning (OPT_Waggregate_return, "function returns an aggregate");
-}
-
-/* Expand code to verify the stack_protect_guard. This is invoked at
- the end of a function to be protected. */
-
-void
-stack_protect_epilogue (void)
-{
- tree guard_decl = crtl->stack_protect_guard_decl;
- rtx_code_label *label = gen_label_rtx ();
- rtx x, y;
- rtx_insn *seq = NULL;
-
- x = expand_normal (crtl->stack_protect_guard);
-
- if (targetm.have_stack_protect_combined_test () && guard_decl)
- {
- gcc_assert (DECL_P (guard_decl));
- y = DECL_RTL (guard_decl);
- /* Allow the target to compute address of Y and compare it with X without
- leaking Y into a register. This combined address + compare pattern
- allows the target to prevent spilling of any intermediate results by
- splitting it after register allocator. */
- seq = targetm.gen_stack_protect_combined_test (x, y, label);
- }
- else
- {
- if (guard_decl)
- y = expand_normal (guard_decl);
- else
- y = const0_rtx;
-
- /* Allow the target to compare Y with X without leaking either into
- a register. */
- if (targetm.have_stack_protect_test ())
- seq = targetm.gen_stack_protect_test (x, y, label);
- }
-
- if (seq)
- emit_insn (seq);
- else
- emit_cmp_and_jump_insns (x, y, EQ, NULL_RTX, ptr_mode, 1, label);
-
- /* The noreturn predictor has been moved to the tree level. The rtl-level
- predictors estimate this branch about 20%, which isn't enough to get
- things moved out of line. Since this is the only extant case of adding
- a noreturn function at the rtl level, it doesn't seem worth doing ought
- except adding the prediction by hand. */
- rtx_insn *tmp = get_last_insn ();
- if (JUMP_P (tmp))
- predict_insn_def (tmp, PRED_NORETURN, TAKEN);
-
- expand_call (targetm.stack_protect_fail (), NULL_RTX, /*ignore=*/true);
- free_temp_slots ();
- emit_label (label);
-}
-
-/* Start the RTL for a new function, and set variables used for
- emitting RTL.
- SUBR is the FUNCTION_DECL node.
- PARMS_HAVE_CLEANUPS is nonzero if there are cleanups associated with
- the function's parameters, which must be run at any return statement. */
-
-void
-expand_function_start (tree subr)
-{
- /* Make sure volatile mem refs aren't considered
- valid operands of arithmetic insns. */
- init_recog_no_volatile ();
-
- crtl->profile
- = (profile_flag
- && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (subr));
-
- crtl->limit_stack
- = (stack_limit_rtx != NULL_RTX && ! DECL_NO_LIMIT_STACK (subr));
-
- /* Make the label for return statements to jump to. Do not special
- case machines with special return instructions -- they will be
- handled later during jump, ifcvt, or epilogue creation. */
- return_label = gen_label_rtx ();
-
- /* Initialize rtx used to return the value. */
- /* Do this before assign_parms so that we copy the struct value address
- before any library calls that assign parms might generate. */
-
- /* Decide whether to return the value in memory or in a register. */
- tree res = DECL_RESULT (subr);
- if (aggregate_value_p (res, subr))
- {
- /* Returning something that won't go in a register. */
- rtx value_address = 0;
-
-#ifdef PCC_STATIC_STRUCT_RETURN
- if (cfun->returns_pcc_struct)
- {
- int size = int_size_in_bytes (TREE_TYPE (res));
- value_address = assemble_static_space (size);
- }
- else
-#endif
- {
- rtx sv = targetm.calls.struct_value_rtx (TREE_TYPE (subr), 2);
- /* Expect to be passed the address of a place to store the value.
- If it is passed as an argument, assign_parms will take care of
- it. */
- if (sv)
- {
- value_address = gen_reg_rtx (Pmode);
- emit_move_insn (value_address, sv);
- }
- }
- if (value_address)
- {
- rtx x = value_address;
- if (!DECL_BY_REFERENCE (res))
- {
- x = gen_rtx_MEM (DECL_MODE (res), x);
- set_mem_attributes (x, res, 1);
- }
- set_parm_rtl (res, x);
- }
- }
- else if (DECL_MODE (res) == VOIDmode)
- /* If return mode is void, this decl rtl should not be used. */
- set_parm_rtl (res, NULL_RTX);
- else
- {
- /* Compute the return values into a pseudo reg, which we will copy
- into the true return register after the cleanups are done. */
- tree return_type = TREE_TYPE (res);
-
- /* If we may coalesce this result, make sure it has the expected mode
- in case it was promoted. But we need not bother about BLKmode. */
- machine_mode promoted_mode
- = flag_tree_coalesce_vars && is_gimple_reg (res)
- ? promote_ssa_mode (ssa_default_def (cfun, res), NULL)
- : BLKmode;
-
- if (promoted_mode != BLKmode)
- set_parm_rtl (res, gen_reg_rtx (promoted_mode));
- else if (TYPE_MODE (return_type) != BLKmode
- && targetm.calls.return_in_msb (return_type))
- /* expand_function_end will insert the appropriate padding in
- this case. Use the return value's natural (unpadded) mode
- within the function proper. */
- set_parm_rtl (res, gen_reg_rtx (TYPE_MODE (return_type)));
- else
- {
- /* In order to figure out what mode to use for the pseudo, we
- figure out what the mode of the eventual return register will
- actually be, and use that. */
- rtx hard_reg = hard_function_value (return_type, subr, 0, 1);
-
- /* Structures that are returned in registers are not
- aggregate_value_p, so we may see a PARALLEL or a REG. */
- if (REG_P (hard_reg))
- set_parm_rtl (res, gen_reg_rtx (GET_MODE (hard_reg)));
- else
- {
- gcc_assert (GET_CODE (hard_reg) == PARALLEL);
- set_parm_rtl (res, gen_group_rtx (hard_reg));
- }
- }
-
- /* Set DECL_REGISTER flag so that expand_function_end will copy the
- result to the real return register(s). */
- DECL_REGISTER (res) = 1;
- }
-
- /* Initialize rtx for parameters and local variables.
- In some cases this requires emitting insns. */
- assign_parms (subr);
-
- /* If function gets a static chain arg, store it. */
- if (cfun->static_chain_decl)
- {
- tree parm = cfun->static_chain_decl;
- rtx local, chain;
- rtx_insn *insn;
- int unsignedp;
-
- local = gen_reg_rtx (promote_decl_mode (parm, &unsignedp));
- chain = targetm.calls.static_chain (current_function_decl, true);
-
- set_decl_incoming_rtl (parm, chain, false);
- set_parm_rtl (parm, local);
- mark_reg_pointer (local, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
-
- if (GET_MODE (local) != GET_MODE (chain))
- {
- convert_move (local, chain, unsignedp);
- insn = get_last_insn ();
- }
- else
- insn = emit_move_insn (local, chain);
-
- /* Mark the register as eliminable, similar to parameters. */
- if (MEM_P (chain)
- && reg_mentioned_p (arg_pointer_rtx, XEXP (chain, 0)))
- set_dst_reg_note (insn, REG_EQUIV, chain, local);
-
- /* If we aren't optimizing, save the static chain onto the stack. */
- if (!optimize)
- {
- tree saved_static_chain_decl
- = build_decl (DECL_SOURCE_LOCATION (parm), VAR_DECL,
- DECL_NAME (parm), TREE_TYPE (parm));
- rtx saved_static_chain_rtx
- = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0);
- SET_DECL_RTL (saved_static_chain_decl, saved_static_chain_rtx);
- emit_move_insn (saved_static_chain_rtx, chain);
- SET_DECL_VALUE_EXPR (parm, saved_static_chain_decl);
- DECL_HAS_VALUE_EXPR_P (parm) = 1;
- }
- }
-
- /* The following was moved from init_function_start.
- The move was supposed to make sdb output more accurate. */
- /* Indicate the beginning of the function body,
- as opposed to parm setup. */
- emit_note (NOTE_INSN_FUNCTION_BEG);
-
- gcc_assert (NOTE_P (get_last_insn ()));
-
- parm_birth_insn = get_last_insn ();
-
- /* If the function receives a non-local goto, then store the
- bits we need to restore the frame pointer. */
- if (cfun->nonlocal_goto_save_area)
- {
- tree t_save;
- rtx r_save;
-
- tree var = TREE_OPERAND (cfun->nonlocal_goto_save_area, 0);
- gcc_assert (DECL_RTL_SET_P (var));
-
- t_save = build4 (ARRAY_REF,
- TREE_TYPE (TREE_TYPE (cfun->nonlocal_goto_save_area)),
- cfun->nonlocal_goto_save_area,
- integer_zero_node, NULL_TREE, NULL_TREE);
- r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
- gcc_assert (GET_MODE (r_save) == Pmode);
-
- emit_move_insn (r_save, hard_frame_pointer_rtx);
- update_nonlocal_goto_save_area ();
- }
-
- if (crtl->profile)
- {
-#ifdef PROFILE_HOOK
- PROFILE_HOOK (current_function_funcdef_no);
-#endif
- }
-
- /* If we are doing generic stack checking, the probe should go here. */
- if (flag_stack_check == GENERIC_STACK_CHECK)
- stack_check_probe_note = emit_note (NOTE_INSN_DELETED);
-}
-
-void
-pop_dummy_function (void)
-{
- pop_cfun ();
- in_dummy_function = false;
-}
-
-/* Undo the effects of init_dummy_function_start. */
-void
-expand_dummy_function_end (void)
-{
- gcc_assert (in_dummy_function);
-
- /* End any sequences that failed to be closed due to syntax errors. */
- while (in_sequence_p ())
- end_sequence ();
-
- /* Outside function body, can't compute type's actual size
- until next function's body starts. */
-
- free_after_parsing (cfun);
- free_after_compilation (cfun);
- pop_dummy_function ();
-}
-
-/* Helper for diddle_return_value. */
-
-void
-diddle_return_value_1 (void (*doit) (rtx, void *), void *arg, rtx outgoing)
-{
- if (! outgoing)
- return;
-
- if (REG_P (outgoing))
- (*doit) (outgoing, arg);
- else if (GET_CODE (outgoing) == PARALLEL)
- {
- int i;
-
- for (i = 0; i < XVECLEN (outgoing, 0); i++)
- {
- rtx x = XEXP (XVECEXP (outgoing, 0, i), 0);
-
- if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
- (*doit) (x, arg);
- }
- }
-}
-
-/* Call DOIT for each hard register used as a return value from
- the current function. */
-
-void
-diddle_return_value (void (*doit) (rtx, void *), void *arg)
-{
- diddle_return_value_1 (doit, arg, crtl->return_rtx);
-}
-
-static void
-do_clobber_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
-{
- emit_clobber (reg);
-}
-
-void
-clobber_return_register (void)
-{
- diddle_return_value (do_clobber_return_reg, NULL);
-
- /* In case we do use pseudo to return value, clobber it too. */
- if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
- {
- tree decl_result = DECL_RESULT (current_function_decl);
- rtx decl_rtl = DECL_RTL (decl_result);
- if (REG_P (decl_rtl) && REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER)
- {
- do_clobber_return_reg (decl_rtl, NULL);
- }
- }
-}
-
-static void
-do_use_return_reg (rtx reg, void *arg ATTRIBUTE_UNUSED)
-{
- emit_use (reg);
-}
-
-static void
-use_return_register (void)
-{
- diddle_return_value (do_use_return_reg, NULL);
-}
-
-/* Generate RTL for the end of the current function. */
-
-void
-expand_function_end (void)
-{
- /* If arg_pointer_save_area was referenced only from a nested
- function, we will not have initialized it yet. Do that now. */
- if (arg_pointer_save_area && ! crtl->arg_pointer_save_area_init)
- get_arg_pointer_save_area ();
-
- /* If we are doing generic stack checking and this function makes calls,
- do a stack probe at the start of the function to ensure we have enough
- space for another stack frame. */
- if (flag_stack_check == GENERIC_STACK_CHECK)
- {
- rtx_insn *insn, *seq;
-
- for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
- if (CALL_P (insn))
- {
- rtx max_frame_size = GEN_INT (STACK_CHECK_MAX_FRAME_SIZE);
- start_sequence ();
- if (STACK_CHECK_MOVING_SP)
- anti_adjust_stack_and_probe (max_frame_size, true);
- else
- probe_stack_range (STACK_OLD_CHECK_PROTECT, max_frame_size);
- seq = get_insns ();
- end_sequence ();
- set_insn_locations (seq, prologue_location);
- emit_insn_before (seq, stack_check_probe_note);
- break;
- }
- }
-
- /* End any sequences that failed to be closed due to syntax errors. */
- while (in_sequence_p ())
- end_sequence ();
-
- clear_pending_stack_adjust ();
- do_pending_stack_adjust ();
-
- /* Output a linenumber for the end of the function.
- SDB depended on this. */
- set_curr_insn_location (input_location);
-
- /* Before the return label (if any), clobber the return
- registers so that they are not propagated live to the rest of
- the function. This can only happen with functions that drop
- through; if there had been a return statement, there would
- have either been a return rtx, or a jump to the return label.
-
- We delay actual code generation after the current_function_value_rtx
- is computed. */
- rtx_insn *clobber_after = get_last_insn ();
-
- /* Output the label for the actual return from the function. */
- emit_label (return_label);
-
- if (targetm_common.except_unwind_info (&global_options) == UI_SJLJ)
- {
- /* Let except.c know where it should emit the call to unregister
- the function context for sjlj exceptions. */
- if (flag_exceptions)
- sjlj_emit_function_exit_after (get_last_insn ());
- }
-
- /* If this is an implementation of throw, do what's necessary to
- communicate between __builtin_eh_return and the epilogue. */
- expand_eh_return ();
-
- /* If stack protection is enabled for this function, check the guard. */
- if (crtl->stack_protect_guard
- && targetm.stack_protect_runtime_enabled_p ()
- && naked_return_label == NULL_RTX)
- stack_protect_epilogue ();
-
- /* If scalar return value was computed in a pseudo-reg, or was a named
- return value that got dumped to the stack, copy that to the hard
- return register. */
- if (DECL_RTL_SET_P (DECL_RESULT (current_function_decl)))
- {
- tree decl_result = DECL_RESULT (current_function_decl);
- rtx decl_rtl = DECL_RTL (decl_result);
-
- if ((REG_P (decl_rtl)
- ? REGNO (decl_rtl) >= FIRST_PSEUDO_REGISTER
- : DECL_REGISTER (decl_result))
- /* Unless the psABI says not to. */
- && !TYPE_EMPTY_P (TREE_TYPE (decl_result)))
- {
- rtx real_decl_rtl = crtl->return_rtx;
- complex_mode cmode;
-
- /* This should be set in assign_parms. */
- gcc_assert (REG_FUNCTION_VALUE_P (real_decl_rtl));
-
- /* If this is a BLKmode structure being returned in registers,
- then use the mode computed in expand_return. Note that if
- decl_rtl is memory, then its mode may have been changed,
- but that crtl->return_rtx has not. */
- if (GET_MODE (real_decl_rtl) == BLKmode)
- PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
-
- /* If a non-BLKmode return value should be padded at the least
- significant end of the register, shift it left by the appropriate
- amount. BLKmode results are handled using the group load/store
- machinery. */
- if (TYPE_MODE (TREE_TYPE (decl_result)) != BLKmode
- && REG_P (real_decl_rtl)
- && targetm.calls.return_in_msb (TREE_TYPE (decl_result)))
- {
- emit_move_insn (gen_rtx_REG (GET_MODE (decl_rtl),
- REGNO (real_decl_rtl)),
- decl_rtl);
- shift_return_value (GET_MODE (decl_rtl), true, real_decl_rtl);
- }
- else if (GET_CODE (real_decl_rtl) == PARALLEL)
- {
- /* If expand_function_start has created a PARALLEL for decl_rtl,
- move the result to the real return registers. Otherwise, do
- a group load from decl_rtl for a named return. */
- if (GET_CODE (decl_rtl) == PARALLEL)
- emit_group_move (real_decl_rtl, decl_rtl);
- else
- emit_group_load (real_decl_rtl, decl_rtl,
- TREE_TYPE (decl_result),
- int_size_in_bytes (TREE_TYPE (decl_result)));
- }
- /* In the case of complex integer modes smaller than a word, we'll
- need to generate some non-trivial bitfield insertions. Do that
- on a pseudo and not the hard register. */
- else if (GET_CODE (decl_rtl) == CONCAT
- && is_complex_int_mode (GET_MODE (decl_rtl), &cmode)
- && GET_MODE_BITSIZE (cmode) <= BITS_PER_WORD)
- {
- int old_generating_concat_p;
- rtx tmp;
-
- old_generating_concat_p = generating_concat_p;
- generating_concat_p = 0;
- tmp = gen_reg_rtx (GET_MODE (decl_rtl));
- generating_concat_p = old_generating_concat_p;
-
- emit_move_insn (tmp, decl_rtl);
- emit_move_insn (real_decl_rtl, tmp);
- }
- /* If a named return value dumped decl_return to memory, then
- we may need to re-do the PROMOTE_MODE signed/unsigned
- extension. */
- else if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
- {
- int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
- promote_function_mode (TREE_TYPE (decl_result),
- GET_MODE (decl_rtl), &unsignedp,
- TREE_TYPE (current_function_decl), 1);
-
- convert_move (real_decl_rtl, decl_rtl, unsignedp);
- }
- else
- emit_move_insn (real_decl_rtl, decl_rtl);
- }
- }
-
- /* If returning a structure, arrange to return the address of the value
- in a place where debuggers expect to find it.
-
- If returning a structure PCC style,
- the caller also depends on this value.
- And cfun->returns_pcc_struct is not necessarily set. */
- if ((cfun->returns_struct || cfun->returns_pcc_struct)
- && !targetm.calls.omit_struct_return_reg)
- {
- rtx value_address = DECL_RTL (DECL_RESULT (current_function_decl));
- tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
- rtx outgoing;
-
- if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
- type = TREE_TYPE (type);
- else
- value_address = XEXP (value_address, 0);
-
- outgoing = targetm.calls.function_value (build_pointer_type (type),
- current_function_decl, true);
-
- /* Mark this as a function return value so integrate will delete the
- assignment and USE below when inlining this function. */
- REG_FUNCTION_VALUE_P (outgoing) = 1;
-
- /* The address may be ptr_mode and OUTGOING may be Pmode. */
- scalar_int_mode mode = as_a <scalar_int_mode> (GET_MODE (outgoing));
- value_address = convert_memory_address (mode, value_address);
-
- emit_move_insn (outgoing, value_address);
-
- /* Show return register used to hold result (in this case the address
- of the result. */
- crtl->return_rtx = outgoing;
- }
-
- /* Emit the actual code to clobber return register. Don't emit
- it if clobber_after is a barrier, then the previous basic block
- certainly doesn't fall thru into the exit block. */
- if (!BARRIER_P (clobber_after))
- {
- start_sequence ();
- clobber_return_register ();
- rtx_insn *seq = get_insns ();
- end_sequence ();
-
- emit_insn_after (seq, clobber_after);
- }
-
- /* Output the label for the naked return from the function. */
- if (naked_return_label)
- emit_label (naked_return_label);
-
- /* @@@ This is a kludge. We want to ensure that instructions that
- may trap are not moved into the epilogue by scheduling, because
- we don't always emit unwind information for the epilogue. */
- if (cfun->can_throw_non_call_exceptions
- && targetm_common.except_unwind_info (&global_options) != UI_SJLJ)
- emit_insn (gen_blockage ());
-
- /* If stack protection is enabled for this function, check the guard. */
- if (crtl->stack_protect_guard
- && targetm.stack_protect_runtime_enabled_p ()
- && naked_return_label)
- stack_protect_epilogue ();
-
- /* If we had calls to alloca, and this machine needs
- an accurate stack pointer to exit the function,
- insert some code to save and restore the stack pointer. */
- if (! EXIT_IGNORE_STACK
- && cfun->calls_alloca)
- {
- rtx tem = 0;
-
- start_sequence ();
- emit_stack_save (SAVE_FUNCTION, &tem);
- rtx_insn *seq = get_insns ();
- end_sequence ();
- emit_insn_before (seq, parm_birth_insn);
-
- emit_stack_restore (SAVE_FUNCTION, tem);
- }
-
- /* ??? This should no longer be necessary since stupid is no longer with
- us, but there are some parts of the compiler (eg reload_combine, and
- sh mach_dep_reorg) that still try and compute their own lifetime info
- instead of using the general framework. */
- use_return_register ();
-}
-
-rtx
-get_arg_pointer_save_area (void)
-{
- rtx ret = arg_pointer_save_area;
-
- if (! ret)
- {
- ret = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0);
- arg_pointer_save_area = ret;
- }
-
- if (! crtl->arg_pointer_save_area_init)
- {
- /* Save the arg pointer at the beginning of the function. The
- generated stack slot may not be a valid memory address, so we
- have to check it and fix it if necessary. */
- start_sequence ();
- emit_move_insn (validize_mem (copy_rtx (ret)),
- crtl->args.internal_arg_pointer);
- rtx_insn *seq = get_insns ();
- end_sequence ();
-
- push_topmost_sequence ();
- emit_insn_after (seq, entry_of_function ());
- pop_topmost_sequence ();
-
- crtl->arg_pointer_save_area_init = true;
- }
-
- return ret;
-}
-
-
-/* If debugging dumps are requested, dump information about how the
- target handled -fstack-check=clash for the prologue.
-
- PROBES describes what if any probes were emitted.
-
- RESIDUALS indicates if the prologue had any residual allocation
- (i.e. total allocation was not a multiple of PROBE_INTERVAL). */
-
-void
-dump_stack_clash_frame_info (enum stack_clash_probes probes, bool residuals)
-{
- if (!dump_file)
- return;
-
- switch (probes)
- {
- case NO_PROBE_NO_FRAME:
- fprintf (dump_file,
- "Stack clash no probe no stack adjustment in prologue.\n");
- break;
- case NO_PROBE_SMALL_FRAME:
- fprintf (dump_file,
- "Stack clash no probe small stack adjustment in prologue.\n");
- break;
- case PROBE_INLINE:
- fprintf (dump_file, "Stack clash inline probes in prologue.\n");
- break;
- case PROBE_LOOP:
- fprintf (dump_file, "Stack clash probe loop in prologue.\n");
- break;
- }
-
- if (residuals)
- fprintf (dump_file, "Stack clash residual allocation in prologue.\n");
- else
- fprintf (dump_file, "Stack clash no residual allocation in prologue.\n");
-
- if (frame_pointer_needed)
- fprintf (dump_file, "Stack clash frame pointer needed.\n");
- else
- fprintf (dump_file, "Stack clash no frame pointer needed.\n");
-
- if (TREE_THIS_VOLATILE (cfun->decl))
- fprintf (dump_file,
- "Stack clash noreturn prologue, assuming no implicit"
- " probes in caller.\n");
- else
- fprintf (dump_file,
- "Stack clash not noreturn prologue.\n");
-}
-
-/* Add a list of INSNS to the hash HASHP, possibly allocating HASHP
- for the first time. */
-
-static void
-record_insns (rtx_insn *insns, rtx end, hash_table<insn_cache_hasher> **hashp)
-{
- rtx_insn *tmp;
- hash_table<insn_cache_hasher> *hash = *hashp;
-
- if (hash == NULL)
- *hashp = hash = hash_table<insn_cache_hasher>::create_ggc (17);
-
- for (tmp = insns; tmp != end; tmp = NEXT_INSN (tmp))
- {
- rtx *slot = hash->find_slot (tmp, INSERT);
- gcc_assert (*slot == NULL);
- *slot = tmp;
- }
-}
-
-/* INSN has been duplicated or replaced by as COPY, perhaps by duplicating a
- basic block, splitting or peepholes. If INSN is a prologue or epilogue
- insn, then record COPY as well. */
-
-void
-maybe_copy_prologue_epilogue_insn (rtx insn, rtx copy)
-{
- hash_table<insn_cache_hasher> *hash;
- rtx *slot;
-
- hash = epilogue_insn_hash;
- if (!hash || !hash->find (insn))
- {
- hash = prologue_insn_hash;
- if (!hash || !hash->find (insn))
- return;
- }
-
- slot = hash->find_slot (copy, INSERT);
- gcc_assert (*slot == NULL);
- *slot = copy;
-}
-
-/* Determine if any INSNs in HASH are, or are part of, INSN. Because
- we can be running after reorg, SEQUENCE rtl is possible. */
-
-static bool
-contains (const rtx_insn *insn, hash_table<insn_cache_hasher> *hash)
-{
- if (hash == NULL)
- return false;
-
- if (NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)
- {
- rtx_sequence *seq = as_a <rtx_sequence *> (PATTERN (insn));
- int i;
- for (i = seq->len () - 1; i >= 0; i--)
- if (hash->find (seq->element (i)))
- return true;
- return false;
- }
-
- return hash->find (const_cast<rtx_insn *> (insn)) != NULL;
-}
-
-int
-prologue_contains (const rtx_insn *insn)
-{
- return contains (insn, prologue_insn_hash);
-}
-
-int
-epilogue_contains (const rtx_insn *insn)
-{
- return contains (insn, epilogue_insn_hash);
-}
-
-int
-prologue_epilogue_contains (const rtx_insn *insn)
-{
- if (contains (insn, prologue_insn_hash))
- return 1;
- if (contains (insn, epilogue_insn_hash))
- return 1;
- return 0;
-}
-
-void
-record_prologue_seq (rtx_insn *seq)
-{
- record_insns (seq, NULL, &prologue_insn_hash);
-}
-
-void
-record_epilogue_seq (rtx_insn *seq)
-{
- record_insns (seq, NULL, &epilogue_insn_hash);
-}
-
-/* Set JUMP_LABEL for a return insn. */
-
-void
-set_return_jump_label (rtx_insn *returnjump)
-{
- rtx pat = PATTERN (returnjump);
- if (GET_CODE (pat) == PARALLEL)
- pat = XVECEXP (pat, 0, 0);
- if (ANY_RETURN_P (pat))
- JUMP_LABEL (returnjump) = pat;
- else
- JUMP_LABEL (returnjump) = ret_rtx;
-}
-
-/* Return a sequence to be used as the split prologue for the current
- function, or NULL. */
-
-static rtx_insn *
-make_split_prologue_seq (void)
-{
- if (!flag_split_stack
- || lookup_attribute ("no_split_stack", DECL_ATTRIBUTES (cfun->decl)))
- return NULL;
-
- start_sequence ();
- emit_insn (targetm.gen_split_stack_prologue ());
- rtx_insn *seq = get_insns ();
- end_sequence ();
-
- record_insns (seq, NULL, &prologue_insn_hash);
- set_insn_locations (seq, prologue_location);
-
- return seq;
-}
-
-/* Return a sequence to be used as the prologue for the current function,
- or NULL. */
-
-static rtx_insn *
-make_prologue_seq (void)
-{
- if (!targetm.have_prologue ())
- return NULL;
-
- start_sequence ();
- rtx_insn *seq = targetm.gen_prologue ();
- emit_insn (seq);
-
- /* Insert an explicit USE for the frame pointer
- if the profiling is on and the frame pointer is required. */
- if (crtl->profile && frame_pointer_needed)
- emit_use (hard_frame_pointer_rtx);
-
- /* Retain a map of the prologue insns. */
- record_insns (seq, NULL, &prologue_insn_hash);
- emit_note (NOTE_INSN_PROLOGUE_END);
-
- /* Ensure that instructions are not moved into the prologue when
- profiling is on. The call to the profiling routine can be
- emitted within the live range of a call-clobbered register. */
- if (!targetm.profile_before_prologue () && crtl->profile)
- emit_insn (gen_blockage ());
-
- seq = get_insns ();
- end_sequence ();
- set_insn_locations (seq, prologue_location);
-
- return seq;
-}
-
-/* Emit a sequence of insns to zero the call-used registers before RET
- according to ZERO_REGS_TYPE. */
-
-static void
-gen_call_used_regs_seq (rtx_insn *ret, unsigned int zero_regs_type)
-{
- bool only_gpr = true;
- bool only_used = true;
- bool only_arg = true;
-
- /* No need to zero call-used-regs in main (). */
- if (MAIN_NAME_P (DECL_NAME (current_function_decl)))
- return;
-
- /* No need to zero call-used-regs if __builtin_eh_return is called
- since it isn't a normal function return. */
- if (crtl->calls_eh_return)
- return;
-
- /* If only_gpr is true, only zero call-used registers that are
- general-purpose registers; if only_used is true, only zero
- call-used registers that are used in the current function;
- if only_arg is true, only zero call-used registers that pass
- parameters defined by the flatform's calling conversion. */
-
- using namespace zero_regs_flags;
-
- only_gpr = zero_regs_type & ONLY_GPR;
- only_used = zero_regs_type & ONLY_USED;
- only_arg = zero_regs_type & ONLY_ARG;
-
- /* For each of the hard registers, we should zero it if:
- 1. it is a call-used register;
- and 2. it is not a fixed register;
- and 3. it is not live at the return of the routine;
- and 4. it is general registor if only_gpr is true;
- and 5. it is used in the routine if only_used is true;
- and 6. it is a register that passes parameter if only_arg is true. */
-
- /* First, prepare the data flow information. */
- basic_block bb = BLOCK_FOR_INSN (ret);
- auto_bitmap live_out;
- bitmap_copy (live_out, df_get_live_out (bb));
- df_simulate_initialize_backwards (bb, live_out);
- df_simulate_one_insn_backwards (bb, ret, live_out);
-
- HARD_REG_SET selected_hardregs;
- CLEAR_HARD_REG_SET (selected_hardregs);
- for (unsigned int regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
- {
- if (!crtl->abi->clobbers_full_reg_p (regno))
- continue;
- if (fixed_regs[regno])
- continue;
- if (REGNO_REG_SET_P (live_out, regno))
- continue;
- if (only_gpr
- && !TEST_HARD_REG_BIT (reg_class_contents[GENERAL_REGS], regno))
- continue;
- if (only_used && !df_regs_ever_live_p (regno))
- continue;
- if (only_arg && !FUNCTION_ARG_REGNO_P (regno))
- continue;
-#ifdef LEAF_REG_REMAP
- if (crtl->uses_only_leaf_regs && LEAF_REG_REMAP (regno) < 0)
- continue;
-#endif
-
- /* Now this is a register that we might want to zero. */
- SET_HARD_REG_BIT (selected_hardregs, regno);
- }
-
- if (hard_reg_set_empty_p (selected_hardregs))
- return;
-
- /* Now that we have a hard register set that needs to be zeroed, pass it to
- target to generate zeroing sequence. */
- HARD_REG_SET zeroed_hardregs;
- start_sequence ();
- zeroed_hardregs = targetm.calls.zero_call_used_regs (selected_hardregs);
- rtx_insn *seq = get_insns ();
- end_sequence ();
- if (seq)
- {
- /* Emit the memory blockage and register clobber asm volatile before
- the whole sequence. */
- start_sequence ();
- expand_asm_reg_clobber_mem_blockage (zeroed_hardregs);
- rtx_insn *seq_barrier = get_insns ();
- end_sequence ();
-
- emit_insn_before (seq_barrier, ret);
- emit_insn_before (seq, ret);
-
- /* Update the data flow information. */
- crtl->must_be_zero_on_return |= zeroed_hardregs;
- df_set_bb_dirty (EXIT_BLOCK_PTR_FOR_FN (cfun));
- }
-}
-
-
-/* Return a sequence to be used as the epilogue for the current function,
- or NULL. */
-
-static rtx_insn *
-make_epilogue_seq (void)
-{
- if (!targetm.have_epilogue ())
- return NULL;
-
- start_sequence ();
- emit_note (NOTE_INSN_EPILOGUE_BEG);
- rtx_insn *seq = targetm.gen_epilogue ();
- if (seq)
- emit_jump_insn (seq);
-
- /* Retain a map of the epilogue insns. */
- record_insns (seq, NULL, &epilogue_insn_hash);
- set_insn_locations (seq, epilogue_location);
-
- seq = get_insns ();
- rtx_insn *returnjump = get_last_insn ();
- end_sequence ();
-
- if (JUMP_P (returnjump))
- set_return_jump_label (returnjump);
-
- return seq;
-}
-
-
-/* Generate the prologue and epilogue RTL if the machine supports it. Thread
- this into place with notes indicating where the prologue ends and where
- the epilogue begins. Update the basic block information when possible.
-
- Notes on epilogue placement:
- There are several kinds of edges to the exit block:
- * a single fallthru edge from LAST_BB
- * possibly, edges from blocks containing sibcalls
- * possibly, fake edges from infinite loops
-
- The epilogue is always emitted on the fallthru edge from the last basic
- block in the function, LAST_BB, into the exit block.
-
- If LAST_BB is empty except for a label, it is the target of every
- other basic block in the function that ends in a return. If a
- target has a return or simple_return pattern (possibly with
- conditional variants), these basic blocks can be changed so that a
- return insn is emitted into them, and their target is adjusted to
- the real exit block.
-
- Notes on shrink wrapping: We implement a fairly conservative
- version of shrink-wrapping rather than the textbook one. We only
- generate a single prologue and a single epilogue. This is
- sufficient to catch a number of interesting cases involving early
- exits.
-
- First, we identify the blocks that require the prologue to occur before
- them. These are the ones that modify a call-saved register, or reference
- any of the stack or frame pointer registers. To simplify things, we then
- mark everything reachable from these blocks as also requiring a prologue.
- This takes care of loops automatically, and avoids the need to examine
- whether MEMs reference the frame, since it is sufficient to check for
- occurrences of the stack or frame pointer.
-
- We then compute the set of blocks for which the need for a prologue
- is anticipatable (borrowing terminology from the shrink-wrapping
- description in Muchnick's book). These are the blocks which either
- require a prologue themselves, or those that have only successors
- where the prologue is anticipatable. The prologue needs to be
- inserted on all edges from BB1->BB2 where BB2 is in ANTIC and BB1
- is not. For the moment, we ensure that only one such edge exists.
-
- The epilogue is placed as described above, but we make a
- distinction between inserting return and simple_return patterns
- when modifying other blocks that end in a return. Blocks that end
- in a sibcall omit the sibcall_epilogue if the block is not in
- ANTIC. */
-
-void
-thread_prologue_and_epilogue_insns (void)
-{
- df_analyze ();
-
- /* Can't deal with multiple successors of the entry block at the
- moment. Function should always have at least one entry
- point. */
- gcc_assert (single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun)));
-
- edge entry_edge = single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun));
- edge orig_entry_edge = entry_edge;
-
- rtx_insn *split_prologue_seq = make_split_prologue_seq ();
- rtx_insn *prologue_seq = make_prologue_seq ();
- rtx_insn *epilogue_seq = make_epilogue_seq ();
-
- /* Try to perform a kind of shrink-wrapping, making sure the
- prologue/epilogue is emitted only around those parts of the
- function that require it. */
- try_shrink_wrapping (&entry_edge, prologue_seq);
-
- /* If the target can handle splitting the prologue/epilogue into separate
- components, try to shrink-wrap these components separately. */
- try_shrink_wrapping_separate (entry_edge->dest);
-
- /* If that did anything for any component we now need the generate the
- "main" prologue again. Because some targets require some of these
- to be called in a specific order (i386 requires the split prologue
- to be first, for example), we create all three sequences again here.
- If this does not work for some target, that target should not enable
- separate shrink-wrapping. */
- if (crtl->shrink_wrapped_separate)
- {
- split_prologue_seq = make_split_prologue_seq ();
- prologue_seq = make_prologue_seq ();
- epilogue_seq = make_epilogue_seq ();
- }
-
- rtl_profile_for_bb (EXIT_BLOCK_PTR_FOR_FN (cfun));
-
- /* A small fib -- epilogue is not yet completed, but we wish to re-use
- this marker for the splits of EH_RETURN patterns, and nothing else
- uses the flag in the meantime. */
- epilogue_completed = 1;
-
- /* Find non-fallthru edges that end with EH_RETURN instructions. On
- some targets, these get split to a special version of the epilogue
- code. In order to be able to properly annotate these with unwind
- info, try to split them now. If we get a valid split, drop an
- EPILOGUE_BEG note and mark the insns as epilogue insns. */
- edge e;
- edge_iterator ei;
- FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
- {
- rtx_insn *prev, *last, *trial;
-
- if (e->flags & EDGE_FALLTHRU)
- continue;
- last = BB_END (e->src);
- if (!eh_returnjump_p (last))
- continue;
-
- prev = PREV_INSN (last);
- trial = try_split (PATTERN (last), last, 1);
- if (trial == last)
- continue;
-
- record_insns (NEXT_INSN (prev), NEXT_INSN (trial), &epilogue_insn_hash);
- emit_note_after (NOTE_INSN_EPILOGUE_BEG, prev);
- }
-
- edge exit_fallthru_edge = find_fallthru_edge (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds);
-
- if (exit_fallthru_edge)
- {
- if (epilogue_seq)
- {
- insert_insn_on_edge (epilogue_seq, exit_fallthru_edge);
- commit_edge_insertions ();
-
- /* The epilogue insns we inserted may cause the exit edge to no longer
- be fallthru. */
- FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
- {
- if (((e->flags & EDGE_FALLTHRU) != 0)
- && returnjump_p (BB_END (e->src)))
- e->flags &= ~EDGE_FALLTHRU;
- }
- }
- else if (next_active_insn (BB_END (exit_fallthru_edge->src)))
- {
- /* We have a fall-through edge to the exit block, the source is not
- at the end of the function, and there will be an assembler epilogue
- at the end of the function.
- We can't use force_nonfallthru here, because that would try to
- use return. Inserting a jump 'by hand' is extremely messy, so
- we take advantage of cfg_layout_finalize using
- fixup_fallthru_exit_predecessor. */
- cfg_layout_initialize (0);
- basic_block cur_bb;
- FOR_EACH_BB_FN (cur_bb, cfun)
- if (cur_bb->index >= NUM_FIXED_BLOCKS
- && cur_bb->next_bb->index >= NUM_FIXED_BLOCKS)
- cur_bb->aux = cur_bb->next_bb;
- cfg_layout_finalize ();
- }
- }
-
- /* Insert the prologue. */
-
- rtl_profile_for_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun));
-
- if (split_prologue_seq || prologue_seq)
- {
- rtx_insn *split_prologue_insn = split_prologue_seq;
- if (split_prologue_seq)
- {
- while (split_prologue_insn && !NONDEBUG_INSN_P (split_prologue_insn))
- split_prologue_insn = NEXT_INSN (split_prologue_insn);
- insert_insn_on_edge (split_prologue_seq, orig_entry_edge);
- }
-
- rtx_insn *prologue_insn = prologue_seq;
- if (prologue_seq)
- {
- while (prologue_insn && !NONDEBUG_INSN_P (prologue_insn))
- prologue_insn = NEXT_INSN (prologue_insn);
- insert_insn_on_edge (prologue_seq, entry_edge);
- }
-
- commit_edge_insertions ();
-
- /* Look for basic blocks within the prologue insns. */
- if (split_prologue_insn
- && BLOCK_FOR_INSN (split_prologue_insn) == NULL)
- split_prologue_insn = NULL;
- if (prologue_insn
- && BLOCK_FOR_INSN (prologue_insn) == NULL)
- prologue_insn = NULL;
- if (split_prologue_insn || prologue_insn)
- {
- auto_sbitmap blocks (last_basic_block_for_fn (cfun));
- bitmap_clear (blocks);
- if (split_prologue_insn)
- bitmap_set_bit (blocks,
- BLOCK_FOR_INSN (split_prologue_insn)->index);
- if (prologue_insn)
- bitmap_set_bit (blocks, BLOCK_FOR_INSN (prologue_insn)->index);
- find_many_sub_basic_blocks (blocks);
- }
- }
-
- default_rtl_profile ();
-
- /* Emit sibling epilogues before any sibling call sites. */
- for (ei = ei_start (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds);
- (e = ei_safe_edge (ei));
- ei_next (&ei))
- {
- /* Skip those already handled, the ones that run without prologue. */
- if (e->flags & EDGE_IGNORE)
- {
- e->flags &= ~EDGE_IGNORE;
- continue;
- }
-
- rtx_insn *insn = BB_END (e->src);
-
- if (!(CALL_P (insn) && SIBLING_CALL_P (insn)))
- continue;
-
- if (rtx_insn *ep_seq = targetm.gen_sibcall_epilogue ())
- {
- start_sequence ();
- emit_note (NOTE_INSN_EPILOGUE_BEG);
- emit_insn (ep_seq);
- rtx_insn *seq = get_insns ();
- end_sequence ();
-
- /* Retain a map of the epilogue insns. Used in life analysis to
- avoid getting rid of sibcall epilogue insns. Do this before we
- actually emit the sequence. */
- record_insns (seq, NULL, &epilogue_insn_hash);
- set_insn_locations (seq, epilogue_location);
-
- emit_insn_before (seq, insn);
- }
- }
-
- if (epilogue_seq)
- {
- rtx_insn *insn, *next;
-
- /* Similarly, move any line notes that appear after the epilogue.
- There is no need, however, to be quite so anal about the existence
- of such a note. Also possibly move
- NOTE_INSN_FUNCTION_BEG notes, as those can be relevant for debug
- info generation. */
- for (insn = epilogue_seq; insn; insn = next)
- {
- next = NEXT_INSN (insn);
- if (NOTE_P (insn)
- && (NOTE_KIND (insn) == NOTE_INSN_FUNCTION_BEG))
- reorder_insns (insn, insn, PREV_INSN (epilogue_seq));
- }
- }
-
- /* Threading the prologue and epilogue changes the artificial refs
- in the entry and exit blocks. */
- epilogue_completed = 1;
- df_update_entry_exit_and_calls ();
-}
-
-/* Reposition the prologue-end and epilogue-begin notes after
- instruction scheduling. */
-
-void
-reposition_prologue_and_epilogue_notes (void)
-{
- if (!targetm.have_prologue ()
- && !targetm.have_epilogue ()
- && !targetm.have_sibcall_epilogue ())
- return;
-
- /* Since the hash table is created on demand, the fact that it is
- non-null is a signal that it is non-empty. */
- if (prologue_insn_hash != NULL)
- {
- size_t len = prologue_insn_hash->elements ();
- rtx_insn *insn, *last = NULL, *note = NULL;
-
- /* Scan from the beginning until we reach the last prologue insn. */
- /* ??? While we do have the CFG intact, there are two problems:
- (1) The prologue can contain loops (typically probing the stack),
- which means that the end of the prologue isn't in the first bb.
- (2) Sometimes the PROLOGUE_END note gets pushed into the next bb. */
- for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
- {
- if (NOTE_P (insn))
- {
- if (NOTE_KIND (insn) == NOTE_INSN_PROLOGUE_END)
- note = insn;
- }
- else if (contains (insn, prologue_insn_hash))
- {
- last = insn;
- if (--len == 0)
- break;
- }
- }
-
- if (last)
- {
- if (note == NULL)
- {
- /* Scan forward looking for the PROLOGUE_END note. It should
- be right at the beginning of the block, possibly with other
- insn notes that got moved there. */
- for (note = NEXT_INSN (last); ; note = NEXT_INSN (note))
- {
- if (NOTE_P (note)
- && NOTE_KIND (note) == NOTE_INSN_PROLOGUE_END)
- break;
- }
- }
-
- /* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
- if (LABEL_P (last))
- last = NEXT_INSN (last);
- reorder_insns (note, note, last);
- }
- }
-
- if (epilogue_insn_hash != NULL)
- {
- edge_iterator ei;
- edge e;
-
- FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
- {
- rtx_insn *insn, *first = NULL, *note = NULL;
- basic_block bb = e->src;
-
- /* Scan from the beginning until we reach the first epilogue insn. */
- FOR_BB_INSNS (bb, insn)
- {
- if (NOTE_P (insn))
- {
- if (NOTE_KIND (insn) == NOTE_INSN_EPILOGUE_BEG)
- {
- note = insn;
- if (first != NULL)
- break;
- }
- }
- else if (first == NULL && contains (insn, epilogue_insn_hash))
- {
- first = insn;
- if (note != NULL)
- break;
- }
- }
-
- if (note)
- {
- /* If the function has a single basic block, and no real
- epilogue insns (e.g. sibcall with no cleanup), the
- epilogue note can get scheduled before the prologue
- note. If we have frame related prologue insns, having
- them scanned during the epilogue will result in a crash.
- In this case re-order the epilogue note to just before
- the last insn in the block. */
- if (first == NULL)
- first = BB_END (bb);
-
- if (PREV_INSN (first) != note)
- reorder_insns (note, note, PREV_INSN (first));
- }
- }
- }
-}
-
-/* Returns the name of function declared by FNDECL. */
-const char *
-fndecl_name (tree fndecl)
-{
- if (fndecl == NULL)
- return "(nofn)";
- return lang_hooks.decl_printable_name (fndecl, 1);
-}
-
-/* Returns the name of function FN. */
-const char *
-function_name (struct function *fn)
-{
- tree fndecl = (fn == NULL) ? NULL : fn->decl;
- return fndecl_name (fndecl);
-}
-
-/* Returns the name of the current function. */
-const char *
-current_function_name (void)
-{
- return function_name (cfun);
-}
-
-
-static unsigned int
-rest_of_handle_check_leaf_regs (void)
-{
-#ifdef LEAF_REGISTERS
- crtl->uses_only_leaf_regs
- = optimize > 0 && only_leaf_regs_used () && leaf_function_p ();
-#endif
- return 0;
-}
-
-/* Insert a TYPE into the used types hash table of CFUN. */
-
-static void
-used_types_insert_helper (tree type, struct function *func)
-{
- if (type != NULL && func != NULL)
- {
- if (func->used_types_hash == NULL)
- func->used_types_hash = hash_set<tree>::create_ggc (37);
-
- func->used_types_hash->add (type);
- }
-}
-
-/* Given a type, insert it into the used hash table in cfun. */
-void
-used_types_insert (tree t)
-{
- while (POINTER_TYPE_P (t) || TREE_CODE (t) == ARRAY_TYPE)
- if (TYPE_NAME (t))
- break;
- else
- t = TREE_TYPE (t);
- if (TREE_CODE (t) == ERROR_MARK)
- return;
- if (TYPE_NAME (t) == NULL_TREE
- || TYPE_NAME (t) == TYPE_NAME (TYPE_MAIN_VARIANT (t)))
- t = TYPE_MAIN_VARIANT (t);
- if (debug_info_level > DINFO_LEVEL_NONE)
- {
- if (cfun)
- used_types_insert_helper (t, cfun);
- else
- {
- /* So this might be a type referenced by a global variable.
- Record that type so that we can later decide to emit its
- debug information. */
- vec_safe_push (types_used_by_cur_var_decl, t);
- }
- }
-}
-
-/* Helper to Hash a struct types_used_by_vars_entry. */
-
-static hashval_t
-hash_types_used_by_vars_entry (const struct types_used_by_vars_entry *entry)
-{
- gcc_assert (entry && entry->var_decl && entry->type);
-
- return iterative_hash_object (entry->type,
- iterative_hash_object (entry->var_decl, 0));
-}
-
-/* Hash function of the types_used_by_vars_entry hash table. */
-
-hashval_t
-used_type_hasher::hash (types_used_by_vars_entry *entry)
-{
- return hash_types_used_by_vars_entry (entry);
-}
-
-/*Equality function of the types_used_by_vars_entry hash table. */
-
-bool
-used_type_hasher::equal (types_used_by_vars_entry *e1,
- types_used_by_vars_entry *e2)
-{
- return (e1->var_decl == e2->var_decl && e1->type == e2->type);
-}
-
-/* Inserts an entry into the types_used_by_vars_hash hash table. */
-
-void
-types_used_by_var_decl_insert (tree type, tree var_decl)
-{
- if (type != NULL && var_decl != NULL)
- {
- types_used_by_vars_entry **slot;
- struct types_used_by_vars_entry e;
- e.var_decl = var_decl;
- e.type = type;
- if (types_used_by_vars_hash == NULL)
- types_used_by_vars_hash
- = hash_table<used_type_hasher>::create_ggc (37);
-
- slot = types_used_by_vars_hash->find_slot (&e, INSERT);
- if (*slot == NULL)
- {
- struct types_used_by_vars_entry *entry;
- entry = ggc_alloc<types_used_by_vars_entry> ();
- entry->type = type;
- entry->var_decl = var_decl;
- *slot = entry;
- }
- }
-}
-
-namespace {
-
-const pass_data pass_data_leaf_regs =
-{
- RTL_PASS, /* type */
- "*leaf_regs", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_NONE, /* tv_id */
- 0, /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_leaf_regs : public rtl_opt_pass
-{
-public:
- pass_leaf_regs (gcc::context *ctxt)
- : rtl_opt_pass (pass_data_leaf_regs, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual unsigned int execute (function *)
- {
- return rest_of_handle_check_leaf_regs ();
- }
-
-}; // class pass_leaf_regs
-
-} // anon namespace
-
-rtl_opt_pass *
-make_pass_leaf_regs (gcc::context *ctxt)
-{
- return new pass_leaf_regs (ctxt);
-}
-
-static unsigned int
-rest_of_handle_thread_prologue_and_epilogue (void)
-{
- /* prepare_shrink_wrap is sensitive to the block structure of the control
- flow graph, so clean it up first. */
- if (optimize)
- cleanup_cfg (0);
-
- /* On some machines, the prologue and epilogue code, or parts thereof,
- can be represented as RTL. Doing so lets us schedule insns between
- it and the rest of the code and also allows delayed branch
- scheduling to operate in the epilogue. */
- thread_prologue_and_epilogue_insns ();
-
- /* Some non-cold blocks may now be only reachable from cold blocks.
- Fix that up. */
- fixup_partitions ();
-
- /* Shrink-wrapping can result in unreachable edges in the epilogue,
- see PR57320. */
- cleanup_cfg (optimize ? CLEANUP_EXPENSIVE : 0);
-
- /* The stack usage info is finalized during prologue expansion. */
- if (flag_stack_usage_info || flag_callgraph_info)
- output_stack_usage ();
-
- return 0;
-}
-
-/* Record a final call to CALLEE at LOCATION. */
-
-void
-record_final_call (tree callee, location_t location)
-{
- struct callinfo_callee datum = { location, callee };
- vec_safe_push (cfun->su->callees, datum);
-}
-
-/* Record a dynamic allocation made for DECL_OR_EXP. */
-
-void
-record_dynamic_alloc (tree decl_or_exp)
-{
- struct callinfo_dalloc datum;
-
- if (DECL_P (decl_or_exp))
- {
- datum.location = DECL_SOURCE_LOCATION (decl_or_exp);
- const char *name = lang_hooks.decl_printable_name (decl_or_exp, 2);
- const char *dot = strrchr (name, '.');
- if (dot)
- name = dot + 1;
- datum.name = ggc_strdup (name);
- }
- else
- {
- datum.location = EXPR_LOCATION (decl_or_exp);
- datum.name = NULL;
- }
-
- vec_safe_push (cfun->su->dallocs, datum);
-}
-
-namespace {
-
-const pass_data pass_data_thread_prologue_and_epilogue =
-{
- RTL_PASS, /* type */
- "pro_and_epilogue", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_THREAD_PROLOGUE_AND_EPILOGUE, /* tv_id */
- 0, /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- ( TODO_df_verify | TODO_df_finish ), /* todo_flags_finish */
-};
-
-class pass_thread_prologue_and_epilogue : public rtl_opt_pass
-{
-public:
- pass_thread_prologue_and_epilogue (gcc::context *ctxt)
- : rtl_opt_pass (pass_data_thread_prologue_and_epilogue, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual unsigned int execute (function *)
- {
- return rest_of_handle_thread_prologue_and_epilogue ();
- }
-
-}; // class pass_thread_prologue_and_epilogue
-
-} // anon namespace
-
-rtl_opt_pass *
-make_pass_thread_prologue_and_epilogue (gcc::context *ctxt)
-{
- return new pass_thread_prologue_and_epilogue (ctxt);
-}
-
-namespace {
-
-const pass_data pass_data_zero_call_used_regs =
-{
- RTL_PASS, /* type */
- "zero_call_used_regs", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_NONE, /* tv_id */
- 0, /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_zero_call_used_regs: public rtl_opt_pass
-{
-public:
- pass_zero_call_used_regs (gcc::context *ctxt)
- : rtl_opt_pass (pass_data_zero_call_used_regs, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual unsigned int execute (function *);
-
-}; // class pass_zero_call_used_regs
-
-unsigned int
-pass_zero_call_used_regs::execute (function *fun)
-{
- using namespace zero_regs_flags;
- unsigned int zero_regs_type = UNSET;
-
- tree attr_zero_regs = lookup_attribute ("zero_call_used_regs",
- DECL_ATTRIBUTES (fun->decl));
-
- /* Get the type of zero_call_used_regs from function attribute.
- We have filtered out invalid attribute values already at this point. */
- if (attr_zero_regs)
- {
- /* The TREE_VALUE of an attribute is a TREE_LIST whose TREE_VALUE
- is the attribute argument's value. */
- attr_zero_regs = TREE_VALUE (attr_zero_regs);
- gcc_assert (TREE_CODE (attr_zero_regs) == TREE_LIST);
- attr_zero_regs = TREE_VALUE (attr_zero_regs);
- gcc_assert (TREE_CODE (attr_zero_regs) == STRING_CST);
-
- for (unsigned int i = 0; zero_call_used_regs_opts[i].name != NULL; ++i)
- if (strcmp (TREE_STRING_POINTER (attr_zero_regs),
- zero_call_used_regs_opts[i].name) == 0)
- {
- zero_regs_type = zero_call_used_regs_opts[i].flag;
- break;
- }
- }
-
- if (!zero_regs_type)
- zero_regs_type = flag_zero_call_used_regs;
-
- /* No need to zero call-used-regs when no user request is present. */
- if (!(zero_regs_type & ENABLED))
- return 0;
-
- edge_iterator ei;
- edge e;
-
- /* This pass needs data flow information. */
- df_analyze ();
-
- /* Iterate over the function's return instructions and insert any
- register zeroing required by the -fzero-call-used-regs command-line
- option or the "zero_call_used_regs" function attribute. */
- FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)
- {
- rtx_insn *insn = BB_END (e->src);
- if (JUMP_P (insn) && ANY_RETURN_P (JUMP_LABEL (insn)))
- gen_call_used_regs_seq (insn, zero_regs_type);
- }
-
- return 0;
-}
-
-} // anon namespace
-
-rtl_opt_pass *
-make_pass_zero_call_used_regs (gcc::context *ctxt)
-{
- return new pass_zero_call_used_regs (ctxt);
-}
-
-/* If CONSTRAINT is a matching constraint, then return its number.
- Otherwise, return -1. */
-
-static int
-matching_constraint_num (const char *constraint)
-{
- if (*constraint == '%')
- constraint++;
-
- if (IN_RANGE (*constraint, '0', '9'))
- return strtoul (constraint, NULL, 10);
-
- return -1;
-}
-
-/* This mini-pass fixes fall-out from SSA in asm statements that have
- in-out constraints. Say you start with
-
- orig = inout;
- asm ("": "+mr" (inout));
- use (orig);
-
- which is transformed very early to use explicit output and match operands:
-
- orig = inout;
- asm ("": "=mr" (inout) : "0" (inout));
- use (orig);
-
- Or, after SSA and copyprop,
-
- asm ("": "=mr" (inout_2) : "0" (inout_1));
- use (inout_1);
-
- Clearly inout_2 and inout_1 can't be coalesced easily anymore, as
- they represent two separate values, so they will get different pseudo
- registers during expansion. Then, since the two operands need to match
- per the constraints, but use different pseudo registers, reload can
- only register a reload for these operands. But reloads can only be
- satisfied by hardregs, not by memory, so we need a register for this
- reload, just because we are presented with non-matching operands.
- So, even though we allow memory for this operand, no memory can be
- used for it, just because the two operands don't match. This can
- cause reload failures on register-starved targets.
-
- So it's a symptom of reload not being able to use memory for reloads
- or, alternatively it's also a symptom of both operands not coming into
- reload as matching (in which case the pseudo could go to memory just
- fine, as the alternative allows it, and no reload would be necessary).
- We fix the latter problem here, by transforming
-
- asm ("": "=mr" (inout_2) : "0" (inout_1));
-
- back to
-
- inout_2 = inout_1;
- asm ("": "=mr" (inout_2) : "0" (inout_2)); */
-
-static void
-match_asm_constraints_1 (rtx_insn *insn, rtx *p_sets, int noutputs)
-{
- int i;
- bool changed = false;
- rtx op = SET_SRC (p_sets[0]);
- int ninputs = ASM_OPERANDS_INPUT_LENGTH (op);
- rtvec inputs = ASM_OPERANDS_INPUT_VEC (op);
- bool *output_matched = XALLOCAVEC (bool, noutputs);
-
- memset (output_matched, 0, noutputs * sizeof (bool));
- for (i = 0; i < ninputs; i++)
- {
- rtx input, output;
- rtx_insn *insns;
- const char *constraint = ASM_OPERANDS_INPUT_CONSTRAINT (op, i);
- int match, j;
-
- match = matching_constraint_num (constraint);
- if (match < 0)
- continue;
-
- gcc_assert (match < noutputs);
- output = SET_DEST (p_sets[match]);
- input = RTVEC_ELT (inputs, i);
- /* Only do the transformation for pseudos. */
- if (! REG_P (output)
- || rtx_equal_p (output, input)
- || !(REG_P (input) || SUBREG_P (input)
- || MEM_P (input) || CONSTANT_P (input))
- || !general_operand (input, GET_MODE (output)))
- continue;
-
- /* We can't do anything if the output is also used as input,
- as we're going to overwrite it. */
- for (j = 0; j < ninputs; j++)
- if (reg_overlap_mentioned_p (output, RTVEC_ELT (inputs, j)))
- break;
- if (j != ninputs)
- continue;
-
- /* Avoid changing the same input several times. For
- asm ("" : "=mr" (out1), "=mr" (out2) : "0" (in), "1" (in));
- only change it once (to out1), rather than changing it
- first to out1 and afterwards to out2. */
- if (i > 0)
- {
- for (j = 0; j < noutputs; j++)
- if (output_matched[j] && input == SET_DEST (p_sets[j]))
- break;
- if (j != noutputs)
- continue;
- }
- output_matched[match] = true;
-
- start_sequence ();
- emit_move_insn (output, copy_rtx (input));
- insns = get_insns ();
- end_sequence ();
- emit_insn_before (insns, insn);
-
- constraint = ASM_OPERANDS_OUTPUT_CONSTRAINT(SET_SRC(p_sets[match]));
- bool early_clobber_p = strchr (constraint, '&') != NULL;
-
- /* Now replace all mentions of the input with output. We can't
- just replace the occurrence in inputs[i], as the register might
- also be used in some other input (or even in an address of an
- output), which would mean possibly increasing the number of
- inputs by one (namely 'output' in addition), which might pose
- a too complicated problem for reload to solve. E.g. this situation:
-
- asm ("" : "=r" (output), "=m" (input) : "0" (input))
-
- Here 'input' is used in two occurrences as input (once for the
- input operand, once for the address in the second output operand).
- If we would replace only the occurrence of the input operand (to
- make the matching) we would be left with this:
-
- output = input
- asm ("" : "=r" (output), "=m" (input) : "0" (output))
-
- Now we suddenly have two different input values (containing the same
- value, but different pseudos) where we formerly had only one.
- With more complicated asms this might lead to reload failures
- which wouldn't have happen without this pass. So, iterate over
- all operands and replace all occurrences of the register used.
-
- However, if one or more of the 'input' uses have a non-matching
- constraint and the matched output operand is an early clobber
- operand, then do not replace the input operand, since by definition
- it conflicts with the output operand and cannot share the same
- register. See PR89313 for details. */
-
- for (j = 0; j < noutputs; j++)
- if (!rtx_equal_p (SET_DEST (p_sets[j]), input)
- && reg_overlap_mentioned_p (input, SET_DEST (p_sets[j])))
- SET_DEST (p_sets[j]) = replace_rtx (SET_DEST (p_sets[j]),
- input, output);
- for (j = 0; j < ninputs; j++)
- if (reg_overlap_mentioned_p (input, RTVEC_ELT (inputs, j)))
- {
- if (!early_clobber_p
- || match == matching_constraint_num
- (ASM_OPERANDS_INPUT_CONSTRAINT (op, j)))
- RTVEC_ELT (inputs, j) = replace_rtx (RTVEC_ELT (inputs, j),
- input, output);
- }
-
- changed = true;
- }
-
- if (changed)
- df_insn_rescan (insn);
-}
-
-/* Add the decl D to the local_decls list of FUN. */
-
-void
-add_local_decl (struct function *fun, tree d)
-{
- gcc_assert (VAR_P (d));
- vec_safe_push (fun->local_decls, d);
-}
-
-namespace {
-
-const pass_data pass_data_match_asm_constraints =
-{
- RTL_PASS, /* type */
- "asmcons", /* name */
- OPTGROUP_NONE, /* optinfo_flags */
- TV_NONE, /* tv_id */
- 0, /* properties_required */
- 0, /* properties_provided */
- 0, /* properties_destroyed */
- 0, /* todo_flags_start */
- 0, /* todo_flags_finish */
-};
-
-class pass_match_asm_constraints : public rtl_opt_pass
-{
-public:
- pass_match_asm_constraints (gcc::context *ctxt)
- : rtl_opt_pass (pass_data_match_asm_constraints, ctxt)
- {}
-
- /* opt_pass methods: */
- virtual unsigned int execute (function *);
-
-}; // class pass_match_asm_constraints
-
-unsigned
-pass_match_asm_constraints::execute (function *fun)
-{
- basic_block bb;
- rtx_insn *insn;
- rtx pat, *p_sets;
- int noutputs;
-
- if (!crtl->has_asm_statement)
- return 0;
-
- df_set_flags (DF_DEFER_INSN_RESCAN);
- FOR_EACH_BB_FN (bb, fun)
- {
- FOR_BB_INSNS (bb, insn)
- {
- if (!INSN_P (insn))
- continue;
-
- pat = PATTERN (insn);
- if (GET_CODE (pat) == PARALLEL)
- p_sets = &XVECEXP (pat, 0, 0), noutputs = XVECLEN (pat, 0);
- else if (GET_CODE (pat) == SET)
- p_sets = &PATTERN (insn), noutputs = 1;
- else
- continue;
-
- if (GET_CODE (*p_sets) == SET
- && GET_CODE (SET_SRC (*p_sets)) == ASM_OPERANDS)
- match_asm_constraints_1 (insn, p_sets, noutputs);
- }
- }
-
- return TODO_df_finish;
-}
-
-} // anon namespace
-
-rtl_opt_pass *
-make_pass_match_asm_constraints (gcc::context *ctxt)
-{
- return new pass_match_asm_constraints (ctxt);
-}
-
-
-#include "gt-function.h"
generated by cgit v1.1 at 2025-05-19 16:03:14 +0000